| 1999 | Closed Reductions in the lambda-Calculus. | Maribel Fernndez, Ian Mackie |
| 1999 | An Expressively Complete Temporal Logic without Past Tense Operators for Mazurkiewicz Traces. | Volker Diekert, Paul Gastin |
| 1999 | Constraint-Based Analysis of Broadcast Protocols. | Giorgio Delzanno, Javier Esparza, Andreas Podelski |
| 1999 | Anti-Symmetry of Higher-Order Subtyping. | Adriana B. Compagnoni, Healfdene Goguen |
| 1999 | Fixpoint Alternation and the Game Quantifier. | Julian C. Bradfield |
| 1999 | Using Fields and Explicit Substitutions to Implement Objects and Functions in a de Bruijn Setting. | Eduardo Bonelli |
| 1999 | Open Least Element Principle and Bounded Query Computation. | Lev D. Beklemishev |
| 1999 | The Consistency Dimension, Compactness, and Query Learning. | Jos L. Balczar |
| 1999 | A Linear Logical View of Linear Type Isomorphisms. | Vincent Balat, Roberto Di Cosmo |
| 1999 | Applying Rewriting Techniques to the Verification of Erlang Processes. | Thomas Arts, Jrgen Giesl |
| 1999 | A Road-Map on Complexity for Hybrid Logics. | Carlos Areces, Patrick Blackburn, Maarten Marx |
| 1999 | Monadic Presentations of Lambda Terms Using Generalized Inductive Types. | Thorsten Altenkirch, Bernhard Reus |
| 1998 | Testing for Finite State Systems. | Mihalis Yannakakis, David Lee |
| 1998 | Subtyping Functional+Nonempty Record Types. | Sergei G. Vorobyov |
| 1998 | Morphisms and Partitions of V-sets. | Richard Statman |
| 1998 | Computational Adequacy in an Elementary Topos. | Alex K. Simpson |
| 1998 | Descriptive Complexity, Lower Bounds and Linear Time. | Thomas Schwentick |
| 1998 | On an Optimal Deterministic Algorithm for SAT. | Zenon Sadowski |
| 1998 | Belnap, Urquhart and Relevant Decidability & Complexity. "Das ist nicht Mathematik, das ist Theologie.". | Jacques Riche, Robert K. Meyer |
| 1998 | On the Complexity of H-Subsumption. | Reinhard Pichler |
| 1998 | Computational Complexity of Ehrenfeucht-Frass Games on Finite Structures. | Elena Pezzoli |
| 1998 | RPO Constraint Solving Is in NP. | Paliath Narendran, Michal Rusinowitch, Rakesh M. Verma |
| 1998 | Monotone Fixed-Point Types and Strong Normalization. | Ralph Matthes |
| 1998 | Revision Programming = Logic Programming + Integrity Constraints. | V. Wiktor Marek, Inna Pivkina, Miroslaw Truszczynski |
| 1998 | Invariant Definability and P/ | Johann A. Makowsky |