4. STACS 1987: Passau, Germany

@proceedings{DBLP:conf/stacs/1987,
  editor    = {Franz-Josef Brandenburg and
               Guy Vidal-Naquet and
               Martin Wirsing},
  title     = {STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer
               Science, Passau, Germany, February 19-21, 1987, Proceedings},
  booktitle = {STACS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {247},
  year      = {1987},
  isbn      = {3-540-17219-X},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

• Ronald V. Book: Towards a Theory of Relativizations: Positive Relativizations. 1-21 BibTeX
• Gilles Kahn: Natural Semantics. 22-39 BibTeX
• Michael Kaufmann, Kurt Mehlhorn: On Local Routing of Two-Terminal Nets. 40-52 BibTeX
• Franz Aurenhammer, Hiroshi Imai: Geometric Relations Among Voronoi Diagrams. 53-65 BibTeX
• J. D. Brock: Finding the Largest Empty Rectangle on a Grated Surface. 66-75 BibTeX
• Kshitij Doshi, Peter J. Varman: Efficient Graph Algorithm Using Limited Communication on a Fixed-Size Array of Processors. 76-87 BibTeX
• Bala Ravikumar, K. Ganesan, K. B. Lakshmanan: On Selecting the Largest Element in Spite of Erroneous Information. 88-99 BibTeX
• Thomas Lengauer, Klaus W. Wagner: The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. 100-113 BibTeX
• Uwe Schöning: Graph Isomorphism is in the Low Hierarchy. 114-124 BibTeX
• John G. Geske, Dung T. Huynh, Alan L. Selman: A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees. 125-135 BibTeX
• José L. Balcázar: Self-Reducibility. 136-147 BibTeX
• Jin-yi Cai: Probability One Separation of the Boolean Hierarchy. 148-158 BibTeX
• Juraj Hromkovic: Reversal Complexity of Multicounter and Multihead Machines. 159-168 BibTeX
• Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini: Computing the Counting Function of Context-Free Languages. 169-179 BibTeX
• Veikko Keränen: On the k-Freeness of Morphisms on Free Monoids. 180-188 BibTeX
• Ursula Schmidt: Avoidable Patterns on 2 Letters. 189-197 BibTeX
• Mustapha Arfi: Polynomial Operations on Rational Languages. 198-206 BibTeX
• Annegret Habel, Hans-Jörg Kreowski: Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement. 207-219 BibTeX
• S. Kaplan, Amir Pnueli: Specification and Implementation of Concurrently Accessed Data Structures: An Abstract Data Type Approach. 220-244 BibTeX
• Christoph Beierle, Angi Voß: On Implementations of Loose Abstract Data Type Specifications and Their Vertical Composition. 245-259 BibTeX
• Tobias Nipkow: Are Homomorphisms Sufficient for Behavioural Implementations of Deterministic and Nondeterministic Data Types? 260-271 BibTeX
• Volker Diekert: Some Remarks on Presentations by Finite Church-Rosser Thue Systems. 272-285 BibTeX
• Harald Ganzinger: Ground Term Confluence in Parametric Conditional Equational Specifications. 286-298 BibTeX
• Gunther Schmidt, Rudolf Berghammer, Hans Zierer: Describing Semantic Domains with Sprouts. 299-310 BibTeX
• Egidio Astesiano, Gianna Reggio: Comparing Direct and Continuation Semantics Styles for Concurrent Languages: Revisiting an Old Problem from a New Viewpoint. 311-322 BibTeX
• Vikraman Arvind, Somenath Biswas: Expressibility of First Order Logic with a Nondeterministic Inductive Operator. 323-335 BibTeX
• Rob J. van Glabbeek: Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra. 336-347 BibTeX
• Dirk Taubner, Walter Vogler: The Step Failure Semantics. 348-359 BibTeX
• Rodney R. Howell: On the Complexity of Containment, Equivalence and Reachability for Finite and 2-Dimensional Vector Addition Systems with States. 360-370 BibTeX
• Elisabeth Pelz: Closure Properties of Deterministic Petri Nets. 371-382 BibTeX
• Lutz Priese, Ralf Rehrmann, Uwe Willecke-Klemme: Some Results on Fairness: The Regular Case. 383-395 BibTeX
• Heino Carstensen: Decidability Questions for Fairness in Petri Nets. 396-407 BibTeX
• Manfred Kunde: Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers. 408-419 BibTeX
• Paul Molitor: On the Contact-Minimization-Problem. 420-431 BibTeX
• Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks: Making Distributed Spanning Tree Algorithms Fault-Resilient. 432-444 BibTeX
• Gerard Tel, Richard B. Tan, Jan van Leeuwen: The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols. 445-455 BibTeX
• Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney: On the Expected Complexity of Distributed Selection. 456-467 BibTeX
• Didier Bert, Pascal Drabik, Rachid Echahed: LPG: A Generic, Logic and Functional Programming Language. 468-469 BibTeX
• Hubert Bertling, Harald Ganzinger, Hubert Baumeister: CEC (Conditional Equations Completion). 470 BibTeX
• Michel Bidoit, Francis Capy, Christine Choppy, M.-A. Choquer, Stéphane Kaplan, Françoise Schlienger, Frédéric Voisin: Asspegique: An Integrated Specification Environment. 471 BibTeX
• Wadoud Bousdira, Jean-Luc Remy: REVEUR4: A Laboratory for Conditional Rewriting. 472-473 BibTeX
• N. Girard: An Interactive, Incremental and Portable Computer Algebra System for Lambda-Calculus and Combinatory Logic Based on Video Edition and Rewriting Techniques. 474 BibTeX
• Heinrich Hußmann: The Passau RAP System: Rapid Prototyping for Algebraic Specifications. 475-476 BibTeX
• Michel Lemoine, René Jacquart, Guy Zanon: SPRAC: A Software Engineering Environment. 477-478 BibTeX
• Laurent Fribourg: SLOG: A Logic Interpreter for Equational Clauses. 479-480 BibTeX
• Michael Goldsmith, A. Cox, Geoff Barrett: An Algebraic Transformation System for Occam Programs. 481 BibTeX
• Pierre Lescanne: REVE: A Rewrite Rule Laboratory. 482-483 BibTeX