| 1986 | Efficient Testing of Optimal Time Adders (Extended Abstract). | Bernd Becker |
| 1986 | Relational Specifications and Observational Semantics. | Egidio Astesiano, Gianna Reggio, Martin Wirsing |
| 1986 | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. | Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata |
| 1986 | Why Sometimes Probabilistic Algorithms Can Be More Effective. | Farid M. Ablayev, Rusins Freivalds |
| 1986 | AL-Khowarizmi: A Formal System for Higher-Order Logic Programming. | M. A. Nait Abdallah |
| 1984 | An Exponential Lower Bound for One-Time-Only Branching Programs. | Stanislav Zk |
| 1984 | On the Complexity of Slice Functions. | Ingo Wegener |
| 1984 | The Complexity of Problems Concerning Graphs with Regularities (Extended Abstract). | Klaus Wagner |
| 1984 | Remarks on Comparing Expressive Power of Logics of Programs. | Jerzy Tiuryn, Pawel Urzyczyn |
| 1984 | Free Constructions in Algebraic Institutions. | Andrzej Tarlecki |
| 1984 | Multiprocessor Systems and Their Concurrency. | Peter H. Starke |
| 1984 | A Topological View of Some Problems in Complexity Theory. | Michael Sipser |
| 1984 | Decidability of Monadic Theories. | Alexei L. Semenov |
| 1984 | Fast Recognition of Pushdown Automaton and Context-Free Languages. | Wojciech Rytter |
| 1984 | Combinatorial Games with Exponential Space Complete Decision Problems. | J. M. Robson |
| 1984 | From Dynamic Algebras to Test Algebras. | Jan Reiterman, Vera Trnkov |
| 1984 | A Lower Bound on Complexity of Branching Programs (Extended Abstract). | Pavel Pudlk |
| 1984 | VLSI Algorithms and Architectures. | Franco P. Preparata |
| 1984 | Another Look at Parameterization Using Algebras with Subsorts. | Axel Poign |
| 1984 | Recent Results on Automata and Infinite Words. | Dominique Perrin |
| 1984 | Solving Visibility Problems by Using Skeleton Structures. | Thomas Ottmann, Peter Widmayer |
| 1984 | The Structure of Polynomial Complexity Cores (Extended Abstract). | Pekka Orponen, Uwe Schning |
| 1984 | Algorithms for String Editing which Permit Arbitrarily Complex Editing Constraints. | B. John Oommen |
| 1984 | Models and Operators for Nondeterministic Processes. | Rocco De Nicola |
| 1984 | Decidability of the Equivalence Problem for Synchronous Deterministic Pushdown Automata. | A. Sh. Nepomnjashchaja |