Abstract is missing.
- On Genuinely Time Bounded CompuationsFriedhelm Meyer auf der Heide. 1-16
- Unified Algebras and Action SemanticsPeter D. Mosses. 17-35
- Properties of Infinite Words: Recent ResultJean Berstel. 36-46
- A First Order Logic for Partial Functions (Extended Abstract)Francisca Lucio-Carrasco, Antonio Gavilanes-Franco. 47-58
- Observational ImplementationsRolf Hennicker. 59-71
- On the Boundary of a Union of RaysPanagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata. 72-83
- Dynamic Planar Point Location with Optimal Query TimeFranco P. Preparata, Roberto Tamassia. 84-95
- An O(n log n) Algorithm for Computing a Link Center in a Simple PolygonHristo Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack. 96-107
- Polynomial Graph-ColoringsWolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger. 108-119
- Time-Optimal Simulations of Networks by Universal Parallel ComputersFriedhelm Meyer auf der Heide, Rolf Wanka. 120-131
- Classes of Picture Languages that Cannot be Distinguished in the Chain Code Concept and Deletion of Redundant RetreatsFriedhelm Hinz. 132-143
- Linear Numeration Systems, Theta-Developments and Finite AutomataChristiane Frougny. 144-155
- A Generalization of Automatic SequencesJeffrey Shallit. 156-167
- Word Problems over TRaces Which are Solvable in Linear TimeVolker Diekert. 168-180
- Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor ArraysFriedhelm Meyer auf der Heide. 181-192
- Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract)Otfried Schwarzkopf. 193-204
- Successive Approximation in Parallel Graph AlgorithmsDonald S. Fussell, Ramakrishna Thurimella. 205-217
- Reversals and AlternationGerhard Buntrock, Albrecht Hoene. 218-228
- On the Power of Parity Polynomial TimeJin-yi Cai, Lane A. Hemachandra. 229-239
- Complete Problems and Strong Polynomial ReducibilitiesK. Ganesan, Steven Homer. 240-250
- If Deterministic and Nondeterministic Space Complexities are Equal for ::::log log n:::: then they are also Equal for ::::log n::::Andrzej Szepietowski. 251-255
- On the Complexity of Approximating the Independent Set ProblemPiotr Berman, Georg Schnitger. 256-268
- Average Number of Messages for Distributed Leader Finding in Rings of ProcessorsChristian Lavault. 269-281
- TIME vs BITSMark H. Overmars, Nicola Santoro. 282-293
- Distributed Computing on TRansitive Networks: The ThorusPaul Beame, Hans Leo Bodlaender. 294-303
- Time is Not a HealerNicola Santoro, Peter Widmayer. 304-313
- Area Efficient Methods to Increase the Reliability of Combinatorial CircuitsRüdiger Reischuk, Bernd Schmeltz. 314-326
- Fault Masking Probabilities with Single and Multiple Signature AnalysisJürgen Doenhardt. 327-338
- Chain Properties of Rule ClosuresMiki Hermann. 339-347
- It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed PairPaliath Narendran, Jonathan Stillman. 348-359
- Algebraic Specifications for Domain THeoryFriederike Nickl. 360-374
- The Query Topology in Logic ProgrammingAïda Batarekh, V. S. Subrahmanian. 375-387
- Testing Membership: Beyond Permutation Groups (Extended Abstract)Martin Beaudry, Pierre McKenzie, Denis Thérien. 388-399
- Membership in Plynomial Ideals over Q Is Exponential Space CompleteErnst W. Mayr. 400-406
- Some Complexity Theoretic Aspects of AC RewritingRakesh M. Verma, I. V. Ramakrishnan. 407-420
- Deciding Bisimulation Equivalences for a Class of Non-Finite-State ProgramsBengt Jonsson, Joachim Parrow. 421-433
- Measure of Parallelism of Distributed ComputationsBernadette Charron-Bost. 434-445
- Decidability of Waek Fairness in Petri NetsPetr Jancar. 446-457
- New Results on the Generalized Star-Height ProblemJean-Eric Pin, Howard Straubing, Denis Thérien. 458-467
- On the Equivalence Problem for Deterministic Multitape Automata and TransducersKarel Culik II, Juhani Karhumäki. 468-479
- Deciding Equivalence of Finite Tree AutomataHelmut Seidl. 480-492
- Concatenable Segment Trees (Extended Abstract)Marc J. van Kreveld, Mark H. Overmars. 493-504
- Shorest Edge-Disjoint Paths in GraphsAndreas Schwill. 505-516
- Rounds versus Time for the Two Person Pebble Game (Extended Abstract)Bala Kalyanasundaram, Georg Schnitger. 517-529
- AXE: The Syntax Driven Diagram Editor for Visual Languages used in the Software Engineering Environments AxISMaria Morandi Cecchi, F. Nachria, O. Viele. 530-531
- Graph^Ed: An Interactive Garpg EditorMichael Himsolt. 532-533
- SAMPLE: A Language Dependent Prototyping EnvironmentM. Jäger. 534-535
- Examining the Satisfiability of Formulas of Propositional Dynamic LogicTomasz Janowski. 536
- AMORE: A System for Computing Automata, MOnoidsm and Regular ExpressionsV. Kell, Albert Maier, Andreas Potthoff, Wolfgang Thomas, U. Wermuth. 537-538
- A Proof System for Type Theory and CCSOlov Schelén, N. O. Forsgren. 539-540
- Implementation of a Transition Sematics for Parallel Programs with Shared VariablesThomas Wolff. 541-543