| 2000 | A Fully Dynamic Algorithm for Distributed Shortest Paths. | Serafino Cicerone, Gabriele Di Stefano, Daniele Frigioni, Umberto Nanni |
| 2000 | Unambiguous Bchi Automata. | Olivier Carton, Max Michel |
| 2000 | On the Competitive Theory and Practice of Portfolio Selection (Extended Abstract). | Allan Borodin, Ran El-Yaniv, Vincent Gogan |
| 2000 | Iteration Algebras Are Not Finitely Axiomatizable. Extended Abstract. | Stephen L. Bloom, Zoltn sik |
| 2000 | Quintic Reciprocity and Primality Test for Numbers of the Form M = A5 | Pedro Berrizbeitia, Mauricio Odremn Vera, Juan Tena Ayuso |
| 2000 | The LCA Problem Revisited. | Michael A. Bender, Martin Farach-Colton |
| 2000 | Squaring Transducers: An Efficient Procedure for Deciding Functionality and Sequentiality of Transducers. | Marie-Pierre Bal, Olivier Carton, Christophe Prieur, Jacques Sakarovitch |
| 2000 | On the Complexity of Routing Permutations on Trees by Arc-Disjoint Paths. Extended Abstract. | Dominique Barth, Sylvie Corteel, Alain Denise, Danile Gardy, Mario Valencia-Pabon |
| 2000 | Two Conjectures on the Chromatic Polynomial. | David Avis, Caterina De Simone, Paolo Nobili |
| 2000 | Imroved Upper Bounds on the Simultaneous Messages Complexity of the Generalized Addressing Function. | Andris Ambainis, Satyanarayana V. Lokam |
| 2000 | Worst-Case Complexity of the Optimal LLL Algorithm. | Ali Akhavi |
| 2000 | From Semantics to Spatial Distribution. | Luis R. Sierra Abbate, Pedro R. D'Argenio, Juan V. Echage |
| 1998 | Spelling Approximate Repeated or Common Motifs Using a Suffix Tree. | Marie-France Sagot |
| 1998 | On-Line Matching Routing on Trees. | Alan Roberts, Antonios Symvonis |
| 1998 | Analyzing Glauber Dynamics by Comparison of Markov Chains. | Dana Randall, Prasad Tetali |
| 1998 | Positive Varieties and Infinite Words. | Jean-Eric Pin |
| 1998 | Unfolding Parametric Automata. | Marcos Veloso Peixoto, Laurent Fribourg |
| 1998 | Analysis of Rabin's Polynomial Irreducability Test. | Daniel Panario, Alfredo Viola |
| 1998 | Improved Approximate Pattern Matching on Hypertext. | Gonzalo Navarro |
| 1998 | Colouring Graphs whose Chromatic Number Is Almost Their Maximum Degree. | Michael Molloy, Bruce A. Reed |
| 1998 | Circuit Covers in Series-Parallel Mixed Graphs. | Orlando Lee, Yoshiko Wakabayashi |
| 1998 | Maximal Groups in Free Burnside Semigroups. | Alair Pereira do Lago |
| 1998 | A New Characterization for Parity Graphs and a Coloring Problem with Costs. | Klaus Jansen |
| 1998 | Strength of Two Data Encryption Standard Implementations under Timing Attacks. | Alejandro Hevia, Marcos A. Kiwi |
| 1998 | Communication-Efficient Parallel Multiway and Approximate Minimum Cut Computation. | Friedhelm Meyer auf der Heide, Gabriel Tern Martinez |