| 1998 | On a Duality Between Kruskal and Dershowitz Theorems. | Paul-Andr Mellis |
| 1998 | Optimal Sampling Strategies in Quicksort. | Conrado Martnez, Salvador Roura |
| 1998 | Generalised Flowcharts and Games. | Pasquale Malacaria, Chris Hankin |
| 1998 | A Good Class of Tree Automata and Application to Inductive Theorem Proving. | Denis Lugiez |
| 1998 | Improved Pseudorandom Generators for Combinatorial Rectangles. | Chi-Jen Lu |
| 1998 | Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract). | Xinxin Liu, Scott A. Smolka |
| 1998 | Complete Proof Systems for Observation Congruences in Finite-Control pi-Calculus. | Huimin Lin |
| 1998 | Checking Strong/Weak Bisimulation Equivalences and Observation Congruence for the pi-Calculus. | Zhoujun Li, Huowang Chen |
| 1998 | Partial-Congruence Factorization of Bisimilarity Induced by Open Maps. | Slawomir Lasota |
| 1998 | Algorithmic Verification of Linear Temporal Logic Specifications. | Yonit Kesten, Amir Pnueli, Li-on Raviv |
| 1998 | Locally Periodic Infinite Words and a Chaotic Behaviour. | Juhani Karhumki, Arto Lepist, Wojciech Plandowski |
| 1998 | Efficient Minimization of Numerical Summation Errors. | Ming-Yang Kao, Jie Wang |
| 1998 | On Branching Programs With Bounded Uncertainty (Extended Abstract). | Stasys Jukna, Stanislav Zk |
| 1998 | Deciding Bisimulation-Like Equivalences with Finite-State Processes. | Petr Jancar, Antonn Kucera, Richard Mayr |
| 1998 | Hardness Results for Dynamic Problems by Extensions of Fredman and Saks' Chronogram Method. | Thore Husfeldt, Theis Rauhe |
| 1998 | Randomness Spaces. | Peter Hertling, Klaus Weihrauch |
| 1998 | The Regular Real-Time Languages. | Thomas A. Henzinger, Jean-Franois Raskin, Pierre-Yves Schobbens |
| 1998 | Model Checking Game Properties of Multi-agent Systems (Abstract). | Thomas A. Henzinger |
| 1998 | Constraint Automata and the Complexity of Recursive Subtype Entailment. | Fritz Henglein, Jakob Rehof |
| 1998 | Simpler and Faster Dictionaries on the AC | Torben Hagerup |
| 1998 | A Degree-Decreasing Lemma for (MOD q - MOD p) Circuits. | Vince Grolmusz |
| 1998 | Reducing Simple Polygons to Triangles - A Proof for an Improved Conjecture. | Thorsten Graf, Kamakoti Veezhinathan |
| 1998 | Structural Recursive Definitions in Type Theory. | Eduardo Gimnez |
| 1998 | Explicit Substitutions for Constructive Necessity. | Neil Ghani, Valeria de Paiva, Eike Ritter |
| 1998 | Limited Wavelength Conversion in All-Optical Tree Networks. | Luisa Gargano |