| 1986 | A Complete Inference System for an Algebra or Regular Acceptance Models. Susanne Graf |
| 1986 | A Fast Parallel Algorithm for Six-Colouring of Planar Graphs (Extended Abstract). Krzysztof Diks |
| 1986 | A Greedy Algorithm for Constructing Shortest Common Superstrings. Jorma Tarhio, Esko Ukkonen |
| 1986 | A New Approach to Defining the Complexity for VLSI. Juraj Hromkovic |
| 1986 | A Proof System to Derive Evantually Properties Under Justice Hypothesis. Dominique Méry |
| 1986 | A Semantical Model for Integration and Modularization of Rules. Peter van Emde Boas |
| 1986 | AL-Khowarizmi: A Formal System for Higher-Order Logic Programming. M. A. Nait Abdallah |
| 1986 | Algebraic Theory of Module Specification with Constraints. Hartmut Ehrig, Werner Fey, Francesco Parisi-Presicce, Edward K. Blum |
| 1986 | An Alternative, Priority-Free, Solution to Post's Problem. Antonín Kucera |
| 1986 | An Analysis of the Nonemptiness Problem for Classes of Reversal-Bounded Multicounter Machines. Rodney R. Howell, Louis E. Rosier |
| 1986 | An Approach to Proof Checker. Ken Hirose |
| 1986 | Complexity of Generalized Graph Coloring. Vladislav Rutenburg |
| 1986 | Deterministic Simulation of Idealized Parallel Computers on More Realistic Ones. Helmut Alt, Torben Hagerup, Kurt Mehlhorn, Franco P. Preparata |
| 1986 | Developing Implicit Data Structures. J. Ian Munro |
| 1986 | Efficient Testing of Optimal Time Adders (Extended Abstract). Bernd Becker |
| 1986 | Fibonacci Numeration Systems and Rational Functions. Christiane Frougny |
| 1986 | Geometric Location Problems and Their Complexity. D. T. Lee |
| 1986 | Grammars with Context Dependency Restricted to Synchronization. Viliam Geffert |
| 1986 | Higher-Order Arrays and Stacks in Programming. An Application of Complexity Theory to Logics of Programs. Jerzy Tiuryn |
| 1986 | Homomorphic Realizations of Automata with Compositions. Zoltán Ésik, Pál Dömösi, Ferenc Gécseg, J. Virágh |
| 1986 | Iterative Systems of Equations. Virgil Emil Cazanescu |
| 1986 | Kins of Context-Free Languages. Michal Chytil |
| 1986 | Learning in Knowledge Based System, a Possibilistic Approach. Zbigniew W. Ras, Maria Zemankova |
| 1986 | Lower Bounds on the Complexity of Local Circuits (Preliminary Report). Stasys Jukna |
| 1986 | Mathematical Foundations of Computer Science 1986, Bratislava, Czechoslovakia, August 25-29, 1996, Proceedings Jozef Gruska, Branislav Rovan, Juraj Wiedermann |
| 1986 | Matrix Systems and Principal Cones of Algebraic Power Series. Werner Kuich |
| 1986 | Model and Complexity of Termination for Distributed Computations. Brigitte Rozoy |
| 1986 | Near Optimal Algorithms for Finding Minimum Steiner Trees on Random Graphs. Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi, Maurizio Talamo |
| 1986 | Nondeterministic Turing Machines with Modified Acceptance. Thomas Gundermann, Gerd Wechsung |
| 1986 | On Some Types of Pseudo-Random Sequences. Ivan Kramosil |
| 1986 | On the Degree of Ambiguity of Finite Automata. Andreas Weber, Helmut Seidl |
| 1986 | On the Inherent Combinatorial Complexity of Geometric Problems in D-Dimensional Space. Thomas M. Fischer, K. Wolfrum |
| 1986 | One-Sided Dyck Reduction Over Two Letter Alphabet and Deterministic Context-Free Languages. Fabienne Romian, Jacques Sakarovitch |
| 1986 | Optimal Sorting of Seven Element Sets. Lubor Kollár |
| 1986 | P-Genericity and Strong G-Genericity. Hans Fleischhack |
| 1986 | Parallel Arithmetic Computations: A Survey. Joachim von zur Gathen |
| 1986 | Partial Interpretations of Higher Order Algebraic Types (Extended Abstract). Manfred Broy |
| 1986 | Polynomial Complexity of the Newton-Puiseux Algorithm. Alexander L. Chistov |
| 1986 | Proofs that Release Minimum Knowledge. Oded Goldreich, Silvio Micali, Avi Wigderson |
| 1986 | Properties of Complexity Measures for PRAMs and WRAMs. Siegfried Bublitz, Ute Schürfeld, Bernd Voigt, Ingo Wegener |
| 1986 | Quicksort Without a Stack. Branislav Durian |
| 1986 | Recent Results in the Theory of Rational Sets. Jean Berstel, Jacques Sakarovitch |
| 1986 | Refined Bounds on the Complexity of Sorting and Selection in D-Dimensional Space. Thomas M. Fischer |
| 1986 | Regular Augmentation of Automata and Transducers (Extended Abstract). Václav Koubek, Antonín Ríha |
| 1986 | Regular Chain Code Picture Languages of Nonlinear Descriptional Complexity. Friedhelm Hinz |
| 1986 | Relational Specifications and Observational Semantics. Egidio Astesiano, Gianna Reggio, Martin Wirsing |
| 1986 | Remark on the Power of Compass (Extended Abstract). Armin Hemmerling |
| 1986 | Safe Implementation Equivalence for Asynchronous Nondeterministic Processes. B. Gammatie |
| 1986 | Some Improved Parallelisms for Graphs. A. Goralciková, Václav Koubek |
| 1986 | Systolic Arrays: Characterizations and Complexity. Oscar H. Ibarra |
| 1986 | The Centers of Context-Sensitive Languages. Ludwig Staiger, Werner Nehrlich |
| 1986 | The Equivalence of Finite Valued Transducers (on HDTOL Languages) is Decidable. Karel Culík II, Juhani Karhumäki |
| 1986 | The Evolution of Two Stacks in Bounded Space and Random Walks in a Triangle. Philippe Flajolet |
| 1986 | The OI-Hierarchy is Closed under Control. Heiko Vogler |
| 1986 | The Parallel Complexity of Deadlock Detection. Paul G. Spirakis |
| 1986 | The Promise of Electronic Prototyping. John E. Hopcroft |
| 1986 | The Space Complexity of the Accessibility Problem for Undirected Graphs of Log N Bounded Genus. Klaus Kriegel |
| 1986 | Towards an Efficient Merging. S. Dvorák, Branislav Durian |
| 1986 | Two Characterizations of the Logarithmic Alternation Hierarchy. Klaus-Jörn Lange |
| 1986 | Undecidable Problems Concerning Generalized Pascal Triangles of Commutative Algebras. Ivan Korec |
| 1986 | Unique Deciperability for Partially Commutative Alphabet (Extended Abstract). Marek Chrobak, Wojciech Rytter |
| 1986 | Why Sometimes Probabilistic Algorithms Can Be More Effective. Farid M. Ablayev, Rusins Freivalds |
| 1986 | p-Projection Reducibility and the Complexity Classes L(nonuniform) and NL(nonuniform). Christoph Meinel |