Amazon cover image
Image from Amazon.com

STACS 84 : Symposium of Theoretical Aspects of Computer Science, Paris [April] 11-13, 1984 / sponsored by AFCET (Association Francaise pour la Cybernétique Economique et Technique) and GI (Gesellschaft für Informatik) ; edited by M. Fontet and K. Mehlhorn.

By: Contributor(s): Material type: TextTextSeries: Lecture notes in computer science ; 166.Publisher: Berlin ; New York : Springer-Verlag, 1984Description: 1 online resource (vi, 338 pages) : illustrationsContent type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9783540388050
  • 3540388052
  • 0387129200
  • 9780387129204
Subject(s): Genre/Form: Additional physical formats: Print version:Symposium on Theoretical Aspects of Computer Science (1st : 1984 : Paris, France).: STACS 84.DDC classification:
  • 001.64 19
LOC classification:
  • QA75.5 .S958 1984
Other classification:
  • 54.10
  • 54.00
Online resources:
Contents:
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.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library eBook LNCS Available
Total holds: 0

Includes bibliographical references.

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.

Powered by Koha