1. STACS 1984: Paris, France

Invited Lectures

• Herbert Edelsbrunner:
  Key-Problems and Key-Methods in Computational Geormetry. 1-13
  
• Jean Berstel:
  Some Recent Results on Squarefree Words. 14-25
  
• Krzysztof R. Apt, Ernst-Rüdiger Olderog:
  Transformations Realizing Fairness Assumptions for Parallel Programs. 26-42
  

Contributed Papers

• Bernard Chazelle, Robert L. (Scot) Drysdale III, D. T. Lee:
  Computing the Largest Empty Rectangle. 43-54
  
• Dorit S. Hochbaum, Wolfgang Maass:
  Approximation Schemes for Covering and Packing Problems in Robotics and VLSI. 55-62
  
• Christos Levcopoulos, Andrzej Lingas:
  Covering Polygons with Minimum Number of Rectangles. 63-72
  
• Bernhard Josko:
  On Expressive Interpretations of a Hoare-Logic for Clarke's Language L4. 73-84
  
• Klaus Drosten:
  Towards Executable Specifications Using Conditional Axioms. 85-96
  
• H. Perdrix:
  Proprietes Church-Rosser de systemes de reecriture equationnels ayant la propriete de terminaison faible. 97-108
  
• Rainer Kemp:
  On a General Weight of Trees. 109-120
  
• Eli Shamir:
  From Expanders to Better Superconcentrators without Cascading. 121-128
  
• Edward G. Belaga:
  Locally Synchronous Complexity in the Light of the Trans-Box Method. 129-139
  
• Glynn Winskel:
  A New Definition of Morphism on Petri Nets. 140-150
  
• Alain Finkel:
  Blocage et vivacité dans les réseaux a pile-file. 151-162
  
• Manfred Broy:
  Denotational Semantics of Concurrent Programs with Shared Memory. 163-173
  
• Axel Poigné:
  Higher Order Data Structures: Cartesian Closure Versus Lambda-Calculus. 174-185
  
• Giuseppe Longo, Simone Martini:
  Computability in Higher Types and the Universal Domain P_omega. 186-197
  
• Klaus Ambos-Spies:
  On the Structure of Polynomial Time Degrees. 198-208
  
• Ondrej Sýkora, Imrich Vrto:
  Optimal Layouts of the Tree of Meshes with Vertices on the Perimeter of the Bounding Convex Region. 209-217
  
• Friedhelm Meyer auf der Heide:
  Efficient Simulations among Several Models of Parallel Computers. 218-229
  
• Jean-Jacques Pansiot:
  Bornes inferieures sur la complexite des facteurs des mots infinis engendres par morphimes iteres. 230-240
  
• Tom Head:
  Adherence Equivalence Is Decidable for DOL Languages. 241-249
  
• Joaquim Gabarró:
  Pushdown Space Complexity and Related Full-AFLs. 250-259
  
• Jeanne Idt:
  Automates a pile sur des alphabets infinis. 260-273
  
• Alan Mycroft:
  Logic Programs and Many-Valued Logic. 274-286
  
• Max Michel:
  Algebre de machines et logique temporelle. 287-298
  
• John Rhodes:
  Algebraic and Topological Theory of Languages and Computation, Part I: Theorems for Arbitrary Labguages Generalizing the Theorems of Eilenberg, Kleene, Schützenberger and Straubing. 299-304
  
• Juhani Karhumäki:
  A Property of Three-Element Codes. 305-313
  
• Klaus P. Jantke:
  Polynomial Time Inference of General Pattern Languages. 314-325
  
• Christian Choffrut, Karel Culik II:
  On Extendibility of Unavoidable Sets. 326-338