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)
Guardat en:
| Autor corporatiu: | |
|---|---|
| Altres autors: | , |
| Format: | Livre numérique |
| Idioma: | Anglais |
| Publicat: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Col·lecció: | Lecture notes in computer science
166 |
| Matèries: | |
| Accés en línia: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Nota: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Theoretical aspects of computer science, Symposium of theoretical aspects of computer science, Paris, April 11-13, 1984 ; sp, by AFCET, Association francaise pour la cybernetique economique et technique, GI, Gesellschaft fur Informatik ; ed, Berlin, Springer, 1984, 1 vol. (VI-338 p.), Lecture notes in computer science, 3-540-12920-0 • STACS 84, Texte imprimé, 9783662178331 |
Taula de continguts:
- 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.