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