Abstract is missing.
- On the Relative Complexity of Subproblems of Intractable ProblemsKlaus Ambos-Spies. 1-12
- On Lovász Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version)László Babai. 13-20
- Layouts with Wires of Balanced LengthBernd Becker, Hans-Georg Osthof. 21-31
- On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union ProblemNorbert Blum. 32-38
- Deterministic Languages and Non-GeneratorsLuc Boasson, Antoine Petit. 39-46
- Simulation of Large Networks on Smaller NetworksHans Leo Bodlaender, Jan van Leeuwen. 47-58
- Petri Nets and Algebraic Calculi of ProcessesGérard Boudol, Gérard Roucairol, Robert de Simone. 59-70
- Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic OnesWilfried Brauer, Klaus-Jörn Lange. 71-79
- Construction of a Family of Factorizing CodesClelia de Felice. 80-86
- On Hotz Groups and Homomorphic Images of Sentential Form LanguagesVolker Diekert. 87-97
- Using Domain Algebras to Prove the Correctness of a CompilerPeter Dybjer. 98-108
- Sorting and Recognition Problems for Ordered SetsUlrich Faigle, György Turán. 109-118
- Tree Automata and Logic ProgramsGilberto Filé. 119-130
- Structure of Relations Satisfying Certain Families of DependenciesPatrick C. Fischer, Dirk Van Gucht. 131-142
- A Single Source Shortest Path Algorithm for a Planar Distributed NetworkGreg N. Frederickson. 143-150
- An Algorithm for Two-Layer Channel RoutingShaodi Gao. 151-160
- New Algorithms for Special Cases of the Hidden Line Elimination ProblemRalf Hartmut Güting, Thomas Ottmann. 161-172
- An Algorithm to Construct Minkowski-Reduced Lattice-BasesBettina Helfrich. 173-179
- Base non finie de varietesChristine Irastorza. 180-186
- Proximity of a GridRolf G. Karlsson, J. Ian Munro. 187-196
- An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent GarphsLudek Kucera. 197-207
- On the Complexity of Deadlock RecoveryJoseph Y.-T. Leung, Burkhard Monien. 208-218
- On the Planar Monotone Computation of Threshold FunctionsWilliam F. McColl. 219-230
- Planar Circuits Have Short SpecificationsWilliam F. McColl. 231-242
- Shortest Paths on Polyhedral SurfacesJoseph O Rourke, Subhash Suri, Heather Booth. 243-254
- Fairness in Context-Free Grammars under Canonical DerivationsSara Porat, Nissim Francez. 255-266
- Distributed Termination in CSP: Symmetric Solutions with Minimal StorageJean-Luc Richier. 267-278
- A Dynamization of the All Pairs Least Cost Path ProblemHans Rohnert. 279-286
- Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State MachinesLouis E. Rosier, Hsu-Chun Yen. 287-298
- Deriving Stack Semantics Congruent to Standard Denotational SemanticsVéronique Royer. 299-309
- Translating Polygons in the PlaneJörg-Rüdiger Sack, Godfried T. Toussaint. 310-321
- Geometric Containment is not Reducible to Pareto DominanceNicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia. 322-327
- The Volume of the Union of Many Sheres and Point Inclusion ProblemsPaul G. Spirakis. 328-338
- Combined Simplicity and Immunity in Relativized NPLeen Torenvliet, Peter van Emde Boas. 339-350
- Groups, Codes and Unambiguous AutomataPascal Weil. 351-362
- Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract)Dan E. Willard. 363-374