| 2003 | The Minimal Graph Model of Lambda Calculus. | Antonio Bucciarelli, Antonino Salibra |
| 2003 | Lower Bounds for General Graph-Driven Read-Once Parity Branching Programs. | Henrik Brosenne, Matthias Homeister, Stephan Waack |
| 2003 | Denotational Testing Semantics in Coinductive Form. | Michele Boreale, Fabio Gadducci |
| 2003 | Symbolic Analysis of Crypto-Protocols Based on Modular Exponentiation. | Michele Boreale, Maria Grazia Buscemi |
| 2003 | A Faster FPT Algorithm for Finding Spanning Trees with Many Leaves. | Paul S. Bonsma, Tobias Brggemann, Gerhard J. Woeginger |
| 2003 | Error-Bounded Probabilistic Computations between MA and AM. | Elmar Bhler, Christian Glaer, Daniel Meister |
| 2003 | Starting with Nondeterminism: The Systematic Derivation of Linear-Time Graph Layout Algorithms. | Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos |
| 2003 | Periodicity and Transitivity for Cellular Automata in Besicovitch Topologies. | Franois Blanchard, Julien Cervelle, Enrico Formenti |
| 2003 | Faster Algorithms for | Robert Benkoczi, Binay K. Bhattacharya, Marek Chrobak, Lawrence L. Larmore, Wojciech Rytter |
| 2003 | Inferring Strings from Graphs and Arrays. | Hideo Bannai, Shunsuke Inenaga, Ayumi Shinohara, Masayuki Takeda |
| 2003 | Smoothed Analysis of Three Combinatorial Problems. | Cyril Banderier, Ren Beier, Kurt Mehlhorn |
| 2003 | On the Length of the Minimum Solution of Word Equations in One Variable. | Kensuke Baba, Satoshi Tsuruta, Ayumi Shinohara, Masayuki Takeda |
| 2003 | Completeness in Differential Approximation Classes. | Giorgio Ausiello, Cristina Bazgan, Marc Demange, Vangelis Th. Paschos |
| 2003 | ACID-Unification Is NEXPTIME-Decidable. | Siva Anantharaman, Paliath Narendran, Michal Rusinowitch |
| 2003 | Problems with Cannot Be Reduced to Any Proper Subproblems. | Klaus Ambos-Spies |
| 2003 | On Optimal Merging Networks. | Kazuyuki Amano, Akira Maruoka |
| 2003 | Adversarial Models for Priority-Based Networks. | Carme lvarez, Maria J. Blesa, Josep Daz, Antonio Fernndez, Maria J. Serna |
| 2002 | An Approximation Semantics for the Propositional Mu-Calculus. | Roger Villemaire |
| 2002 | Towards a Cardinality Theorem for Finite Automata. | Till Tantau |
| 2002 | Characterizing Simpler Recognizable Sets of Integers. | Michel Rigo |
| 2002 | Finite Test-Sets for Overlap-Free Morphisms. | Gwnal Richomme, Francis Wlazinski |
| 2002 | Low Stretch Spanning Trees. | David Peleg |
| 2002 | Comorphism-Based Grothendieck Logics. | Till Mossakowski |
| 2002 | On the Structure of the Simulation Order of Proof Systems. | Jochen Messner |
| 2002 | On the Construction of Effective Random Sets. | Wolfgang Merkle, Nenad Mihailovic |