| 1987 | Another Look at Abstraction in Process Algebra (Extended Abstract). | Jos C. M. Baeten, Rob J. van Glabbeek |
| 1987 | The I/O Complexity of Sorting and Related Problems (Extended Abstract). | Alok Aggarwal, Jeffrey Scott Vitter |
| 1987 | Logic Programming with Ions. | M. A. Nait Abdallah |
| 1987 | Decision Problems for Regular Trace Languages. | IJsbrand Jan Aalbersberg, Hendrik Jan Hoogeboom |
| 1986 | E-Unification Algorithms for a Class of Confluent Term Rewriting Systems. | Jia-Huai You, P. A. Subrahmanyam |
| 1986 | Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract). | Dan E. Willard |
| 1986 | More Complicated Questions About Maxima and Minima, and Some Closures of NP. | Klaus W. Wagner |
| 1986 | A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees. | Peter J. Varman, Kshitij A. Doshi |
| 1986 | Semigroups and Languages of Dot-Depth 2. | Howard Straubing |
| 1986 | A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language. | Colin Stirling |
| 1986 | A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph. | Paul G. Spirakis, Athanasios K. Tsakalidis |
| 1986 | Un Algorithme Determinant les Melanges de Deux Mots. | Jean-Claude Spehner |
| 1986 | An Improved Algorithm for Transitive Closure on Acyclic Digraphs. | Klaus Simon |
| 1986 | A New Approach to Detection of Locally Indicative Stability. | Nir Shavit, Nissim Francez |
| 1986 | Lower Bounds by Recursion Theoretic Arguments (Extended Abstract). | Uwe Schning |
| 1986 | A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract). | Claus-Peter Schnorr |
| 1986 | On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs. | Louis E. Rosier, Hsu-Chun Yen |
| 1986 | A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman. | Kenneth W. Regan |
| 1986 | A Timed Model for Communicating Sequential Processes. | George M. Reed, A. W. Roscoe |
| 1986 | Refusal Testing. | Iain Phillips |
| 1986 | Etude Syntaxique des Parties Reconnaissables de Mots Infinis. | Jean-Pierre Pcuchet |
| 1986 | On Fixed-Point Clones (Extended Abstract). | Damian Niwinski |
| 1986 | Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity. | David E. Muller, Ahmed Saoudi, Paul E. Schupp |
| 1986 | Subpolynomial Complexity Classes of Real Functions and Real Numbers. | Norbert Th. Mller |
| 1986 | Min Cut is NP-Complete for Edge Weigthed Trees. | Burkhard Monien, Ivan Hal Sudborough |