|
|
|
|
| LEADER |
03115nmm a2200325 u 4500 |
| 001 |
EB000655358 |
| 003 |
EBX01000000000000000508440 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540397588
|
| 100 |
1 |
|
|a Monien, B.
|e [editor]
|
| 245 |
0 |
0 |
|a STACS 86
|h Elektronische Ressource
|b 3rd Annual Symposium on Theoretical Aspects of Computer Science - Orsay, France, January 16-18, 1986
|c edited by B. Monien, G. Vidal-Naquet
|
| 250 |
|
|
|a 1st ed. 1986
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1986, 1986
|
| 300 |
|
|
|a XII, 372 p
|b online resource
|
| 505 |
0 |
|
|a Abstract interpretation of denotational definitions -- Temporal reasoning under generalized fairness constraints -- Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples -- Some probabilistic powerdomains in the category SFP -- Ions and local definitions in logic programming -- Input sensitive, optimal parallel randomized algorithms for addition and identification -- A parallel statistical cooling algorithm -- Subgraph isomorphism for biconnected outerplanar graphs in cubic time -- Polynomial time algorithms for finding integer relations among real numbers -- New upperbounds for decentralized extrema-finding in a ring of processors -- Algorithms for visibility representations of planar graphs -- Speeding up random access machines by few processors -- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs -- On sparseness, ambiguity and other decision problems for acceptors and transducers -- Varietes de Semis Groupes et Mots Infinis -- Equations in free partially commutative monoids -- Separating and testing -- Decomposition de Fonctions Rationnelles -- Long unavoidable patterns -- Abstract implementations and correctness proofs -- Strictness and serializability -- Towards specification and proof of asynchronous systems -- Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report) -- Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata -- Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ?-machines -- On sparse oracles separating feasible complexity classes -- On generalized kolmogorov complexity -- Area-time optimal division for T=?((logn)1+? ) -- A time-spacetradeoff for element distinctness -- Parallel machines and their communication theoretical limits
|
| 653 |
|
|
|a Computer Science Logic and Foundations of Programming
|
| 653 |
|
|
|a Computer science
|
| 653 |
|
|
|a Algorithms
|
| 653 |
|
|
|a Formal Languages and Automata Theory
|
| 653 |
|
|
|a Machine theory
|
| 653 |
|
|
|a Theory of Computation
|
| 700 |
1 |
|
|a Vidal-Naquet, G.
|e [editor]
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b SBA
|a Springer Book Archives -2004
|
| 490 |
0 |
|
|a Lecture Notes in Computer Science
|
| 028 |
5 |
0 |
|a 10.1007/3-540-16078-7
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-16078-7?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 004.0151
|