| 1998 | When Can an Equational Simple Graph Be Generated by Hyperedge Replacement? | Klaus Barthelmann |
| 1998 | The Semi-Full Closure of Pure Type Systems. | Gilles Barthe |
| 1998 | Grammatical Models for Some Process Synchronizers. | Tudor Balanescu, Horia Georgescu, Marian Gheorghe |
| 1998 | Proof Theory of Fuzzy Logics: Urquhart's C and Related Logics. | Matthias Baaz, Agata Ciabattoni, Christian G. Fermller, Helmut Veith |
| 1998 | Hypergraph Traversal Revisited: Cost Measures and Dynamic Algorithms. | Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni |
| 1998 | On the Complexity of Wavelength Converters. | Vincenzo Auletta, Ioannis Caragiannis, Christos Kaklamanis, Pino Persiano |
| 1998 | Randomness vs. Completeness: On the Diagonalization Strength of Resource-Bounded Random Sets. | Klaus Ambos-Spies, Steffen Lempp, Gunther Mainhardt |
| 1998 | On Counting AC | Andris Ambainis, David A. Mix Barrington, Huong LeThanh |
| 1998 | A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with At Most (1/6) log log | Kazuyuki Amano, Akira Maruoka |
| 1998 | Minimum Propositional Proof Length is NP-Hard to Linearly Approximate. | Michael Alekhnovich, Samuel R. Buss, Shlomo Moran, Toniann Pitassi |
| 1998 | Combinatorial Hardness Proofs for Polynomial Evaluation. | Mikel Aldaz, Joos Heintz, Guillermo Matera, Jos Luis Montaa, Luis Miguel Pardo |
| 1997 | Partial Order Semantics and Read Arcs. | Walter Vogler |
| 1997 | Queries and Algorithms Computable by Polynomial Time Existential Reflective Machines (Extended Abstract). | Jerzy Tyszkiewicz |
| 1997 | Routing with Finite Speeds of Memory and Network. | Jop F. Sibeyn |
| 1997 | Resolution Proofs, Exponential Bounds, and Kolmogorov Complexity. | Uwe Schning |
| 1997 | A Hierarchy for (1, +k)-Branching Programs with Respect of k. | Petr Savick, Stanislav Zk |
| 1997 | Partial Characterization of Synchronization Languages. | Isabelle Ryl, Yves Roos, Mireille Clerbout |
| 1997 | Learning to Perform Knowledge-Intensive Inferences. | Dan Roth |
| 1997 | Dependency-Based Action Refinement. | Arend Rensink, Heike Wehrheim |
| 1997 | Simplification Orders for Term Graph Rewriting. | Detlef Plump |
| 1997 | Homomorphic Images os Sentential Forms and Terminating Grammars (Extended Abstract). | Holger Petersen |
| 1997 | Deciding Verbose Languages with Linear Advice. | Arfst Nickelsen |
| 1997 | The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. | Martin Mundhenk, Judy Goldsmith, Eric Allender |
| 1997 | NP-Hard Sets Have Many Hard Instances. | Martin Mundhenk |
| 1997 | Decomposition of TrPTL Formulas. | Raphal Meyer, Antoine Petit |