|
|
|
|
| LEADER |
02926nmm a2200313 u 4500 |
| 001 |
EB000654621 |
| 003 |
EBX01000000000000000507703 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
140122 ||| eng |
| 020 |
|
|
|a 9783540388050
|
| 100 |
1 |
|
|a Fontet, M.
|e [editor]
|
| 245 |
0 |
0 |
|a STACS 84
|h Elektronische Ressource
|b Symposium of Theoretical Aspects of Computer Science Paris, April 11-13, 1984
|c edited by M. Fontet, K. Mehlhorn
|
| 250 |
|
|
|a 1st ed. 1984
|
| 260 |
|
|
|a Berlin, Heidelberg
|b Springer Berlin Heidelberg
|c 1984, 1984
|
| 300 |
|
|
|a VIII, 339 p
|b online resource
|
| 505 |
0 |
|
|a Key-problems and key-methods in computational geometry -- Some recent results on squarefree words -- Transformations realizing fairness assumptions for parallel programs -- Computing the largest empty rectangle -- Approximation schemes for covering and packing problems in robotics and vlsi -- Covering polygons with minimum number of rectangles -- On expressive interpretations of a Hoare-logic for Clarke's language L4 -- Towards executable specifications using conditional axioms -- Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible -- On a general weight of trees -- From expanders to better superconcentrators without cascading -- Locally synchronous complexity in the light of the trans-box method -- A new definition of morphism on Petri nets -- Blocage et vivacité dans les réseaux a pile-file -- Denotational semantics of concurrent programs with shared memory -- Higher order data structures -- Computability in higher types and the universal domain P? -- On the structure of polynomial time degrees -- Optimal layouts of the tree of meshes with vertices on the perimeter of the bounding convex region -- Efficient simulations among several models of parallel computers (extended abstract) -- Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphismes iteres -- Adherence equivalence is decidable for DOL languages -- Pusdown space complexity and related full-A.F.L.s. -- Automates a pile sur des alphabets infinis -- Logic programs and many-valued logic -- Algebre de machines et logique temporelle -- Algebraic and topological theory of languages and computation -- A property of three-element codes -- Polynomial time inference of general pattern languages -- On extendibility of unavoidable sets
|
| 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
|
| 700 |
1 |
|
|a Mehlhorn, K.
|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-12920-0
|
| 856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-12920-0?nosfx=y
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 518.1
|