STACS 84
Springer Berlin (Verlag)
978-3-540-12920-2 (ISBN)
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.
| Erscheint lt. Verlag | 1.4.1984 |
|---|---|
| Reihe/Serie | Lecture Notes in Computer Science |
| Zusatzinfo | VIII, 339 p. |
| Verlagsort | Berlin |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Gewicht | 490 g |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik | |
| Schlagworte | Algorithm analysis and problem complexity • Alphabet • Complexity • Computability • Computational Geometry • data structures • Informatik • Logic • Notation • parallel computer • Petri net • Semantics |
| ISBN-10 | 3-540-12920-0 / 3540129200 |
| ISBN-13 | 978-3-540-12920-2 / 9783540129202 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
