STACS A

48 papers

YearTitle / Authors
1987A Hierarchy Theorem for Almost Everywhere Complex Sets With Application to Polynomial Complexity Degrees.
John G. Geske, Dung T. Huynh, Alan L. Selman
1987An Algebraic Transformation System for Occam Programs.
Michael Goldsmith, A. Cox, Geoff Barrett
1987An Interactive, Incremental and Portable Computer Algebra System for Lambda-Calculus and Combinatory Logic Based on Video Edition and Rewriting Techniques.
N. Girard
1987Are Homomorphisms Sufficient for Behavioural Implementations of Deterministic and Nondeterministic Data Types?
Tobias Nipkow
1987Asspegique: An Integrated Specification Environment.
Michel Bidoit, Francis Capy, Christine Choppy, M.-A. Choquer, Stéphane Kaplan, Françoise Schlienger, Frédéric Voisin
1987Avoidable Patterns on 2 Letters.
Ursula Schmidt
1987Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra.
Rob J. van Glabbeek
1987CEC (Conditional Equations Completion).
Hubert Bertling, Harald Ganzinger, Hubert Baumeister
1987Closure Properties of Deterministic Petri Nets.
Elisabeth Pelz
1987Comparing Direct and Continuation Semantics Styles for Concurrent Languages: Revisiting an Old Problem from a New Viewpoint.
Egidio Astesiano, Gianna Reggio
1987Computing the Counting Function of Context-Free Languages.
Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini
1987Decidability Questions for Fairness in Petri Nets.
Heino Carstensen
1987Describing Semantic Domains with Sprouts.
Gunther Schmidt, Rudolf Berghammer, Hans Zierer
1987Efficient Graph Algorithm Using Limited Communication on a Fixed-Size Array of Processors.
Kshitij A. Doshi, Peter J. Varman
1987Expressibility of First Order Logic with a Nondeterministic Inductive Operator.
Vikraman Arvind, Somenath Biswas
1987Finding the Largest Empty Rectangle on a Grated Surface.
J. D. Brock
1987Geometric Relations Among Voronoi Diagrams.
Franz Aurenhammer, Hiroshi Imai
1987Graph Isomorphism is in the Low Hierarchy.
Uwe Schöning
1987Ground Term Confluence in Parametric Conditional Equational Specifications.
Harald Ganzinger
1987LPG: A Generic, Logic and Functional Programming Language.
Didier Bert, Pascal Drabik, Rachid Echahed
1987Making Distributed Spanning Tree Algorithms Fault-Resilient.
Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks
1987Natural Semantics.
Gilles Kahn
1987On Implementations of Loose Abstract Data Type Specifications and Their Vertical Composition.
Christoph Beierle, Angi Voß
1987On Local Routing of Two-Terminal Nets.
Michael Kaufmann, Kurt Mehlhorn
1987On Selecting the Largest Element in Spite of Erroneous Information.
Bala Ravikumar, K. Ganesan, K. B. Lakshmanan
1987On the Complexity of Containment, Equivalence and Reachability for Finite and 2-Dimensional Vector Addition Systems with States.
Rodney R. Howell
1987On the Contact-Minimization-Problem.
Paul Molitor
1987On the Expected Complexity of Distributed Selection.
Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney
1987On the k-Freeness of Morphisms on Free Monoids.
Veikko Keränen
1987Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers.
Manfred Kunde
1987Polynomial Operations on Rational Languages.
Mustapha Arfi
1987Probability One Separation of the Boolean Hierarchy.
Jin-Yi Cai
1987REVE: A Rewrite Rule Laboratory.
Pierre Lescanne
1987REVEUR4: A Laboratory for Conditional Rewriting.
Wadoud Bousdira, Jean-Luc Rémy
1987Reversal Complexity of Multicounter and Multihead Machines.
Juraj Hromkovic
1987SLOG: A Logic Interpreter for Equational Clauses.
Laurent Fribourg
1987SPRAC: A Software Engineering Environment.
Michel Lemoine, René Jacquart, Guy Zanon
1987STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings
Franz-Josef Brandenburg, Guy Vidal-Naquet, Martin Wirsing
1987Self-Reducibility.
José L. Balcázar
1987Some Remarks on Presentations by Finite Church-Rosser Thue Systems.
Volker Diekert
1987Some Results on Fairness: The Regular Case.
Lutz Priese, Ralf Rehrmann, Uwe Willecke-Klemme
1987Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement.
Annegret Habel, Hans-Jörg Kreowski
1987Specification and Implementation of Concurrently Accessed Data Structures: An Abstract Data Type Approach.
S. Kaplan, Amir Pnueli
1987The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems.
Thomas Lengauer, Klaus W. Wagner
1987The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols.
Gerard Tel, Richard B. Tan, Jan van Leeuwen
1987The Passau RAP System: Rapid Prototyping for Algebraic Specifications.
Heinrich Hußmann
1987The Step Failure Semantics.
Dirk Taubner, Walter Vogler
1987Towards a Theory of Relativizations: Positive Relativizations.
Ronald V. Book