STACS 84
Symposium of Theoretical Aspects of Computer Science Paris, April 11-13, 1984
Herausgegeben:Fontet, M.; Mehlhorn, K.
STACS 84
Symposium of Theoretical Aspects of Computer Science Paris, April 11-13, 1984
Herausgegeben:Fontet, M.; Mehlhorn, K.
- Broschiertes Buch
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
Sponsored by AFCET (Association Francaise pour la Cybern;&AAe;tique Economique et Technique) and GI (Gesellschaft für Informatik)
Andere Kunden interessierten sich auch für
- STACS 8530,99 €
- Developments in Language Theory37,99 €
- Heribert VollmerIntroduction to Circuit Complexity55,99 €
- Fundamentals of Computation Theory42,99 €
- STACS 8630,99 €
- Klaus WeihrauchComputability41,99 €
- Computer Science - Theory and Applications37,99 €
-
-
-
Sponsored by AFCET (Association Francaise pour la Cybern;&AAe;tique Economique et Technique) and GI (Gesellschaft für Informatik)
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Hinweis: Dieser Artikel kann nur an eine deutsche Lieferadresse ausgeliefert werden.
Produktdetails
- Produktdetails
- Lecture Notes in Computer Science 166
- Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
- Artikelnr. des Verlages: 978-3-540-12920-2
- 1984.
- Seitenzahl: 348
- Erscheinungstermin: 1. April 1984
- Englisch
- Abmessung: 235mm x 155mm x 19mm
- Gewicht: 490g
- ISBN-13: 9783540129202
- ISBN-10: 3540129200
- Artikelnr.: 23114014
- Herstellerkennzeichnung
- Books on Demand GmbH
- In de Tarpen 42
- 22848 Norderstedt
- info@bod.de
- 040 53433511
- Lecture Notes in Computer Science 166
- Verlag: Springer / Springer Berlin Heidelberg / Springer, Berlin
- Artikelnr. des Verlages: 978-3-540-12920-2
- 1984.
- Seitenzahl: 348
- Erscheinungstermin: 1. April 1984
- Englisch
- Abmessung: 235mm x 155mm x 19mm
- Gewicht: 490g
- ISBN-13: 9783540129202
- ISBN-10: 3540129200
- Artikelnr.: 23114014
- Herstellerkennzeichnung
- Books on Demand GmbH
- In de Tarpen 42
- 22848 Norderstedt
- info@bod.de
- 040 53433511
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.
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.