Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID4th STACS 1987: Passau, Germany
- Franz-Josef Brandenburg, Guy Vidal-Naquet, Martin Wirsing:
STACS 87, 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Germany, February 19-21, 1987, Proceedings. Lecture Notes in Computer Science 247, Springer 1987, ISBN 3-540-17219-X - Ronald V. Book:
Towards a Theory of Relativizations: Positive Relativizations. 1-21 - Gilles Kahn:
Natural Semantics. 22-39 - Michael Kaufmann, Kurt Mehlhorn:
On Local Routing of Two-Terminal Nets. 40-52 - Franz Aurenhammer, Hiroshi Imai:
Geometric Relations Among Voronoi Diagrams. 53-65 - J. D. Brock:
Finding the Largest Empty Rectangle on a Grated Surface. 66-75 - Kshitij A. Doshi, Peter J. Varman:
Efficient Graph Algorithm Using Limited Communication on a Fixed-Size Array of Processors. 76-87 - Bala Ravikumar, K. Ganesan, K. B. Lakshmanan:
On Selecting the Largest Element in Spite of Erroneous Information. 88-99 - Thomas Lengauer, Klaus W. Wagner:
The Correlation Between the Complexities of the Nonhierarchical and Hierarchical Versions of Graph Problems. 100-113 - Uwe Schöning:
Graph Isomorphism is in the Low Hierarchy. 114-124 - 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 - José L. Balcázar:
Self-Reducibility. 136-147 - Jin-yi Cai:
Probability One Separation of the Boolean Hierarchy. 148-158 - Juraj Hromkovic:
Reversal Complexity of Multicounter and Multihead Machines. 159-168 - Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini:
Computing the Counting Function of Context-Free Languages. 169-179 - Veikko Keränen:
On the k-Freeness of Morphisms on Free Monoids. 180-188 - Ursula Schmidt:
Avoidable Patterns on 2 Letters. 189-197 - Mustapha Arfi:
Polynomial Operations on Rational Languages. 198-206 - Annegret Habel, Hans-Jörg Kreowski:
Some Structural Aspects of Hypergraph Languages Generated by Hyperedge Replacement. 207-219 - S. Kaplan, Amir Pnueli:
Specification and Implementation of Concurrently Accessed Data Structures: An Abstract Data Type Approach. 220-244 - Christoph Beierle, Angi Voß
:
On Implementations of Loose Abstract Data Type Specifications and Their Vertical Composition. 245-259 - Tobias Nipkow:
Are Homomorphisms Sufficient for Behavioural Implementations of Deterministic and Nondeterministic Data Types? 260-271 - Volker Diekert:
Some Remarks on Presentations by Finite Church-Rosser Thue Systems. 272-285 - Harald Ganzinger:
Ground Term Confluence in Parametric Conditional Equational Specifications. 286-298 - Gunther Schmidt, Rudolf Berghammer, Hans Zierer:
Describing Semantic Domains with Sprouts. 299-310 - Egidio Astesiano, Gianna Reggio:
Comparing Direct and Continuation Semantics Styles for Concurrent Languages: Revisiting an Old Problem from a New Viewpoint. 311-322 - Vikraman Arvind, Somenath Biswas:
Expressibility of First Order Logic with a Nondeterministic Inductive Operator. 323-335 - Rob J. van Glabbeek:
Bounded Nondeterminism and the Approximation Induction Principle in Process Algebra. 336-347 - Dirk Taubner, Walter Vogler:
The Step Failure Semantics. 348-359 - Rodney R. Howell:
On the Complexity of Containment, Equivalence and Reachability for Finite and 2-Dimensional Vector Addition Systems with States. 360-370 - Elisabeth Pelz:
Closure Properties of Deterministic Petri Nets. 371-382 - Lutz Priese, Ralf Rehrmann, Uwe Willecke-Klemme:
Some Results on Fairness: The Regular Case. 383-395 - Heino Carstensen:
Decidability Questions for Fairness in Petri Nets. 396-407 - Manfred Kunde:
Optimal Sorting on Multi-Dimensionally Mesh-Connected Computers. 408-419 - Paul Molitor:
On the Contact-Minimization-Problem. 420-431 - Reuven Bar-Yehuda, Shay Kutten, Yaron Wolfstahl, Shmuel Zaks:
Making Distributed Spanning Tree Algorithms Fault-Resilient. 432-444 - Gerard Tel, Richard B. Tan, Jan van Leeuwen:
The Derivation of on-the-fly Garbage Collection Algorithms from Distributed Termination Detection Protocols. 445-455 - Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney:
On the Expected Complexity of Distributed Selection. 456-467 - Didier Bert, Pascal Drabik, Rachid Echahed:
LPG: A Generic, Logic and Functional Programming Language. 468-469 - Hubert Bertling, Harald Ganzinger, Hubert Baumeister:
CEC (Conditional Equations Completion). 470 - 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 - Wadoud Bousdira, Jean-Luc Rémy:
REVEUR4: A Laboratory for Conditional Rewriting. 472-473 - N. Girard:
An Interactive, Incremental and Portable Computer Algebra System for Lambda-Calculus and Combinatory Logic Based on Video Edition and Rewriting Techniques. 474 - Heinrich Hußmann:
The Passau RAP System: Rapid Prototyping for Algebraic Specifications. 475-476 - Michel Lemoine, René Jacquart, Guy Zanon:
SPRAC: A Software Engineering Environment. 477-478 - Laurent Fribourg:
SLOG: A Logic Interpreter for Equational Clauses. 479-480 - Michael Goldsmith, A. Cox, Geoff Barrett:
An Algebraic Transformation System for Occam Programs. 481 - Pierre Lescanne:
REVE: A Rewrite Rule Laboratory. 482-483
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-05-02 22:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
