| 1988 | Maximal Dense Intervals of Grammar Forms. | Valtteri Niemi |
| 1988 | Constructive Hopf's Theorem: Or How to Untangle Closed Planar Curves. | Kurt Mehlhorn, Chee-Keng Yap |
| 1988 | A Polynomial-Time Algorithm for Subgraph Isomorphism of Two-Connected Series-Parallel Graphs. | Andrzej Lingas, Maciej M. Syslo |
| 1988 | Efficient Analysis of Graph Properties on Context-free Graph Languages (Extended Abstract). | Thomas Lengauer, Egon Wanke |
| 1988 | Efficient Algorithms on Context-Free Graph Grammars. | Clemens Lautemann |
| 1988 | On the Learnability of DNF Formulae. | Ludek Kucera, Alberto Marchetti-Spaccamela, Marco Protasi |
| 1988 | A Complexity Theory of Efficient Parallel Algorithms (Extended Abstract). | Clyde P. Kruskal, Larry Rudolph, Marc Snir |
| 1988 | Contractions in Comparing Concurrent Semantics. | Joost N. Kok, Jan J. M. M. Rutten |
| 1988 | Do We Really Need to Balance Patricia Trees? (Extended Abstract). | Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski |
| 1988 | Operational Semantics of OBJ-3 (Extended Abstract). | Claude Kirchner, Hlne Kirchner, Jos Meseguer |
| 1988 | New Developments in Structural Complexity Theory. | Juris Hartmanis |
| 1988 | Systolic Architectures, Systems and Computations. | Jozef Gruska |
| 1988 | Random Allocations and Probabilistic Languages. | Philippe Flajolet, Danile Gardy, Los Thimonier |
| 1988 | Reset Sequences for Finite Automata with Application to Design of Parts Orienters. | David Eppstein |
| 1988 | Arrangements of Curves in the Plane - Topology, Combinatorics, and Algorithms. | Herbert Edelsbrunner, Leonidas J. Guibas, Jnos Pach, Richard Pollack, Raimund Seidel, Micha Sharir |
| 1988 | Geometric Structures in Computational Geometry. | Herbert Edelsbrunner |
| 1988 | The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines with Output Tape. | Martin Dietzfelbinger, Wolfgang Maass |
| 1988 | Transitive Orientations, Mbius Functions, and Complete Semi-Thue Systems for Free Partially Commutative Monoids. | Volker Diekert |
| 1988 | New Techniques for Proving the Decidability of Equivalence Problems. | Karel Culk II |
| 1988 | Approximation of a TRace, Asynchronous Automata and the Ordering of Events in a Distributed System. | Robert Cori, Yves Mtivier |
| 1988 | Optimal Slope Selection. | Richard Cole, Jeffrey S. Salowe, William L. Steiger, Endre Szemerdi |
| 1988 | Efficient Simulations of Simple Models of Parallel Computation by Time-Bounded ATM's and Space-Bounded TM's. | Jik H. Chang, Oscar H. Ibarra, Michael A. Palis |
| 1988 | Dynamic Programming on Graphs with Bounded Treewidth. | Hans L. Bodlaender |
| 1988 | Zeta Functions of Recognizable Languages. | Jean Berstel, Christophe Reutenauer |
| 1988 | Nonuniform Learnability. | Gyora M. Benedek, Alon Itai |