| 1988 | On Efficiency of Interval Routing Algorithms. | Peter Ruzicka |
| 1988 | 3-Dimensional Shortest Paths in the Presence of Polyhedral Obstacles. | John H. Reif, James A. Storer |
| 1988 | On Complexity of Counting. | Marek Piotrw |
| 1988 | Proof System for Weakest Prespecification and its Applications. | Ewa Orlowska |
| 1988 | Comparing Interconnection Networks. | Burkhard Monien, Ivan Hal Sudborough |
| 1988 | Δ | Satoru Miyano |
| 1988 | Design, Proof and Analysis of New Efficient Algorithms for Incremental Attribute Evaluation. | Qi Lu, Jiahua Qian |
| 1988 | Two Applications of Frer's Counter to One-Tape Nondeterministic TMs. | Krzysztof Lorys, Maciej Liskiewicz |
| 1988 | Introducing Negative Information in Relational Databases. | Dominique Laurent, Nicolas Spyratos |
| 1988 | Compositional Proofs by Partial Specification of Processes. | Kim Guldstrand Larsen, Bent Thomsen |
| 1988 | Separating the Eraser Turing Machine Classes L | Matthias Krause, Christoph Meinel, Stephan Waack |
| 1988 | On the Computational Complexity of Codes in Graphs. | Jan Kratochvl, Mirko Krivnek |
| 1988 | Inductive Syntactical Synthesis of Programs from Sample Computations. | Efim B. Kinber |
| 1988 | Positive/Negative Conditional Rewriting. | Stphane Kaplan |
| 1988 | Two Lower Bounds for Circuits over the Basis (&, V, -). | Stasys Jukna |
| 1988 | Branching Programs as a Tool for Proving Lower Bounds on VLSI Computations and Optimal Algorithms for Systolic Arrays. | Juraj Hromkovic, Juraj Prochzka |
| 1988 | A Taxonomy of Fairness and Temporal Logic Problems for Petri Nets. | Rodney R. Howell, Louis E. Rosier, Hsu-Chun Yen |
| 1988 | Structure of Complexity Classes: Separations, Collapses, and Completeness. | Lane A. Hemachandra |
| 1988 | On Representing CCS Programs by Finite Petri Nets. | Ursula Goltz |
| 1988 | Hoare Calculi for Higher-Type Control Structures and Their Completeness in the Sense of Cook. | Andreas Goerdt |
| 1988 | On the Expressive Strength of the Finitely Typed Lambda-Terms. | Andreas Goerdt |
| 1988 | Context-Free-Like Forms for the Phrase-Structure Grammars. | Viliam Geffert |
| 1988 | Strong and Robustly Strong Polynomial Time Reducibilities to Sparse Sets. | Ricard Gavald, Jos L. Balczar |
| 1988 | A Fast Parallel Algorithm for Eigenvalue Problem of Jacobi Matrices. | Michael A. Frumkin |
| 1988 | Edge Separators for Planar Graphs and Their Applications. | Krzysztof Diks, Hristo N. Djidjev, Ondrej Skora, Imrich Vrto |