STACS 84 : Symposium of Theoretical Aspects of Computer Science, Paris [April] 11-13, 1984
Author(s)
Bibliographic Information
STACS 84 : Symposium of Theoretical Aspects of Computer Science, Paris [April] 11-13, 1984
(Lecture notes in computer science, 166)
Springer-Verlag, 1984
- : gw
- : us
Available at / 46 libraries
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||16684012866
-
University of Tsukuba Library, Library on Library and Information Science
Germany007.08:L-49:166881003750
-
No Libraries matched.
- Remove all filters.
Note
Includes bibliographies
Description and Table of Contents
Description
Sponsored by AFCET (Association Francaise pour la Cybern; tique Economique et Technique) and GI (Gesellschaft fur Informatik)
Table of 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 vivacite dans les reseaux 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.
by "Nielsen BookData"