2. STACS 1985: Saarbrücken, Germany

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