1. STACS 1984: Paris, France

Max Fontet, Kurt Mehlhorn (Eds.): STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings. Lecture Notes in Computer Science 166 Springer 1984, ISBN 3-540-12920-0 BibTeX

@proceedings{DBLP:conf/stacs/1984,
  editor    = {Max Fontet and
               Kurt Mehlhorn},
  title     = {STACS 84, Symposium of Theoretical Aspects of Computer Science,
               Paris, France, 11-13 April, 1984, Proceedings},
  booktitle = {STACS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {166},
  year      = {1984},
  isbn      = {3-540-12920-0},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Lectures

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

Contributed Papers

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