| 1985 | A Dynamization of the All Pairs Least Cost Path Problem. Hans Rohnert |
| 1985 | A Single Source Shortest Path Algorithm for a Planar Distributed Network. Greg N. Frederickson |
| 1985 | An Algorithm for Two-Layer Channel Routing. Shaodi Gao |
| 1985 | An Algorithm to Construct Minkowski-Reduced Lattice-Bases. Bettina Helfrich |
| 1985 | An O(N^(1.5+epsilon)) Expected Time Algorithm for Canonization and Isomorphism Testing of Trivalent Garphs. Ludek Kucera |
| 1985 | Base non finie de varietes. Christine Irastorza |
| 1985 | Boundedness, Empty Channel Detection and Synchronization for Communicating Finite State Machines. Louis E. Rosier, Hsu-Chun Yen |
| 1985 | Combined Simplicity and Immunity in Relativized NP. Leen Torenvliet, Peter van Emde Boas |
| 1985 | Construction of a Family of Factorizing Codes. Clelia De Felice |
| 1985 | Deriving Stack Semantics Congruent to Standard Denotational Semantics. Véronique Royer |
| 1985 | Deterministic Languages and Non-Generators. Luc Boasson, Antoine Petit |
| 1985 | Distributed Termination in CSP: Symmetric Solutions with Minimal Storage. Jean-Luc Richier |
| 1985 | Fairness in Context-Free Grammars under Canonical Derivations. Sara Porat, Nissim Francez |
| 1985 | Geometric Containment is not Reducible to Pareto Dominance. Nicola Santoro, Jeffrey B. Sidney, Stuart J. Sidney, Jorge Urrutia |
| 1985 | Groups, Codes and Unambiguous Automata. Pascal Weil |
| 1985 | Layouts with Wires of Balanced Length. Bernd Becker, Hans-Georg Osthof |
| 1985 | New Algorithms for Special Cases of the Hidden Line Elimination Problem. Ralf Hartmut Güting, Thomas Ottmann |
| 1985 | Non-Deterministic Two-Tape Automata are More Powerful Then Deterministic Ones. Wilfried Brauer, Klaus-Jörn Lange |
| 1985 | On Hotz Groups and Homomorphic Images of Sentential Form Languages. Volker Diekert |
| 1985 | On Lovász' Lattice Reduction and the Nearest Lattice Point Problem (Shortened Version). László Babai |
| 1985 | On the Complexity of Deadlock Recovery. Joseph Y.-T. Leung, Burkhard Monien |
| 1985 | On the Planar Monotone Computation of Threshold Functions. William F. McColl |
| 1985 | On the Relative Complexity of Subproblems of Intractable Problems. Klaus Ambos-Spies |
| 1985 | On the Single-Operation Worst-Case Time Complexity on the Disjoint Set Union Problem. Norbert Blum |
| 1985 | Petri Nets and Algebraic Calculi of Processes. Gérard Boudol, Gérard Roucairol, Robert de Simone |
| 1985 | Planar Circuits Have Short Specifications. William F. McColl |
| 1985 | Proximity of a Grid. Rolf G. Karlsson, J. Ian Munro |
| 1985 | Reduced Memory Space for Multi-Dimensional Search Trees (Extended Abstract). Dan E. Willard |
| 1985 | STACS 85, 2nd Symposium of Theoretical Aspects of Computer Science, Saarbrücken, Germany, January 3-5, 1985, Proceedings Kurt Mehlhorn |
| 1985 | Shortest Paths on Polyhedral Surfaces. Joseph O'Rourke, Subhash Suri, Heather Booth |
| 1985 | Simulation of Large Networks on Smaller Networks. Hans L. Bodlaender, Jan van Leeuwen |
| 1985 | Sorting and Recognition Problems for Ordered Sets. Ulrich Faigle, György Turán |
| 1985 | Structure of Relations Satisfying Certain Families of Dependencies. Patrick C. Fischer, Dirk Van Gucht |
| 1985 | The Volume of the Union of Many Sheres and Point Inclusion Problems. Paul G. Spirakis |
| 1985 | Translating Polygons in the Plane. Jörg-Rüdiger Sack, Godfried T. Toussaint |
| 1985 | Tree Automata and Logic Programs. Gilberto Filé |
| 1985 | Using Domain Algebras to Prove the Correctness of a Compiler. Peter Dybjer |