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