Format:
Online-Ressource (VI, 338 S.)
Edition:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540388050
Series Statement:
Lecture notes in computer science 166
Content:
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.
Note:
Literaturangaben
Additional Edition:
ISBN 3540129200
Additional Edition:
ISBN 0387129200
Additional Edition:
ISBN 9783540129202
Additional Edition:
Erscheint auch als Druck-Ausgabe STACS (1 : 1984 : Paris) STACS 84 Berlin [u.a.] : Springer, 1984 ISBN 3540129200
Additional Edition:
ISBN 0387129200
Language:
English
Keywords:
Theoretische Informatik
;
Konferenzschrift
DOI:
10.1007/3-540-12920-0
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
Bookmarklink
