| 1998 | An Efficient and Unified Approach to the Decidability of Equivalence of Propositional Programs. | Vladimir A. Zakharov |
| 1998 | Do Probabilistic Algorithms Outperform Deterministic Ones? | Avi Wigderson |
| 1998 | A Total AC-Compatible Reduction Ordering on Higher-Order Terms. | Daria Walukiewicz |
| 1998 | Difficult Configurations - On the Complexity of LTrL. | Igor Walukiewicz |
| 1998 | Concurrent Constraints in the Fusion Calculus. | Bjrn Victor, Joachim Parrow |
| 1998 | Reasoning about The Past with Two-Way Automata. | Moshe Y. Vardi |
| 1998 | A Neuroidal Architecture for Cognitive Computation. | Leslie G. Valiant |
| 1998 | A Complex Example of a Simplifying Rewrite System. | Hlne Touzet |
| 1998 | Bulk-Synchronous Parallel Multiplication of Boolean Matrices. | Alexandre Tiskin |
| 1998 | Independent Sets with Domination Constraints. | Magns M. Halldrsson, Jan Kratochvl, Jan Arne Telle |
| 1998 | Multi-Stage Programming: Axiomatization and Type Safety. | Walid Taha, Zine-El-Abidine Benaissa, Tim Sheard |
| 1998 | Global/Local Subtyping and Capability Inference for a Distributed pi-calculus. | Peter Sewell |
| 1998 | Image Density is Complete for Non-Interactive-SZK (Extended Abstract). | Alfredo De Santis, Giovanni Di Crescenzo, Giuseppe Persiano, Moti Yung |
| 1998 | An Algebraic Approach to Communication Complexity. | Jean-Franois Raymond, Pascal Tesson, Denis Thrien |
| 1998 | A Modular Approach to Denotational Semantics. | John Power, Giuseppe Rosolini |
| 1998 | Translation Validation for Synchronous Languages. | Amir Pnueli, Ofer Strichman, Michael Siegel |
| 1998 | Application of Lempel-Ziv Encodings to the Solution of Words Equations. | Wojciech Plandowski, Wojciech Rytter |
| 1998 | Existential Types: Logical Relations and Operational Equivalence. | Andrew M. Pitts |
| 1998 | Bridges for Concatenation Hierarchies. | Jean-Eric Pin |
| 1998 | Efficient Simulations by Queue Machines. | Holger Petersen, John Michael Robson |
| 1998 | Deterministic Polylog Approximation for Minimum Communication Spanning Trees. | David Peleg, Eilon Reshef |
| 1998 | Distributed Matroid Basis Completion via Elimination Upcast and Distributed Correction of Minimum-Weight Spanning Trees. | David Peleg |
| 1998 | Geometric Algorithms for Robotic Manipulation. | Mark H. Overmars |
| 1998 | Robust Asynchronous Protocols Are Finite-State. | Madhavan Mukund, K. Narayan Kumar, Jaikumar Radhakrishnan, Milind A. Sohoni |
| 1998 | On Asynchrony in Name-Passing Calculi. | Massimo Merro, Davide Sangiorgi |