| 2000 | Time and Message Optimal Leader Election in Asynchronous Oriented Complete Networks. | Stefan Dobrev |
| 2000 | Compositional Characterizations of lambda-Terms Using Intersection Types. | Mariangiola Dezani-Ciancaglini, Furio Honsell, Yoko Motohama |
| 2000 | What Do We Learn from Experimental Algorithmics? | Camil Demetrescu, Giuseppe F. Italiano |
| 2000 | Abstract Data Types in Computer Algebra. | James H. Davenport |
| 2000 | Region Analysis and a pi-Calculus wiht Groups. | Silvano Dal-Zilio, Andrew D. Gordon |
| 2000 | Optical Routing of Uniform Instances in Tori. | Francesc Comellas, Margarida Mitjana, Lata Narayanan, Jaroslav Opatrny |
| 2000 | The Monadic Theory of Morphic Infinite Words and Generalizations. | Olivier Carton, Wolfgang Thomas |
| 2000 | Periodic-Like Words. | Arturo Carpi, Aldo de Luca |
| 2000 | Embedding Fibonacci Cubes into Hypercubes with | Rostislav Caha, Petr Gregor |
| 2000 | Iterative Arrays with Small Time Bounds. | Thomas Buchholz, Andreas Klein, Martin Kutrib |
| 2000 | Expressiveness of Updatable Timed Automata. | Patricia Bouyer, Catherine Dufourd, Emmanuel Fleury, Antoine Petit |
| 2000 | Restricted Nondeterministic Read-Once Branching Programs and an Exponential Lower Bound for Integer Multiplication. | Beate Bollig |
| 2000 | A Compositional Model for Confluent Dynamic Data-Flow Networks. | Frank S. de Boer, Marcello M. Bonsangue |
| 2000 | Balanced | Therese C. Biedl, Eowyn Cenek, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, Rudolf Fleischer, Ming-wei Wang |
| 2000 | Simplifying Flow Networks. | Therese C. Biedl, Brona Brejov, Toms Vinar |
| 2000 | XML Grammars. | Jean Berstel, Luc Boasson |
| 2000 | Equation Satisfiability and Program Satisfiability for Finite Monoids. | David A. Mix Barrington, Pierre McKenzie, Cristopher Moore, Pascal Tesson, Denis Thrien |
| 2000 | Edge-Bisection of Chordal Rings. | Lali Barrire, Josep Fbrega |
| 2000 | Measure Theoretic Completeness Notions for the Exponential Time Classes. | Klaus Ambos-Spies |
| 2000 | Axiomatizing Fully Complete Models for ML Polymorphic Types. | Samson Abramsky, Marina Lenisa |
| 2000 | On the Lower Bounds for One-Way Quantum Automata. | Farid M. Ablayev, Aida Gainutdinova |
| 1999 | The Arithmetical Hierarchy of Real Numbers. | Xizhong Zheng, Klaus Weihrauch |
| 1999 | A Foundation of Programming a Multi-tape Quantum Turing Machine. | Tomoyuki Yamakami |
| 1999 | Efficient Strongly Universal and Optimally Universal Hashing. | Philipp Woelfel |
| 1999 | A Type Discipline for Solving Year 2000 Problems in COBOL Programs. | Mads Tofte |