| 2003 | Algorithmic Aspects of Bandwidth Trading. | Randeep Bhatia, Julia Chuzhoy, Ari Freund, Joseph Naor |
| 2003 | Dynamic Algorithms for Approximating Interdistances. | Sergei Bespamyatnikh, Michael Segal |
| 2003 | Polarized Process Algebra and Program Equivalence. | Jan A. Bergstra, Inge Bethke |
| 2003 | Degree Distribution of the FKP Network Model. | Noam Berger, Bla Bollobs, Christian Borgs, Jennifer T. Chayes, Oliver Riordan |
| 2003 | A Simple Linear Time Algorithm for Computing a (2k-1)-Spanner of O(n | Surender Baswana, Sandeep Sen |
| 2003 | Stable Marriages with Multiple Partners: Efficient Search for an Optimal Solution. | Vipul Bansal, Aseem Agrawal, Varun S. Malhotra |
| 2003 | Anycasting in Adversarial Systems: Routing and Admission Control. | Baruch Awerbuch, Andr Brinkmann, Christian Scheideler |
| 2003 | Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem. | Sanjeev Arora, Kevin L. Chang |
| 2003 | Minimal Classical Logic and Control Operators. | Zena M. Ariola, Hugo Herbelin |
| 2003 | Sophistication Revisited. | Luis Antunes, Lance Fortnow |
| 2003 | Mixin Modules and Computational Effects. | Davide Ancona, Sonia Fagorzi, Eugenio Moggi, Elena Zucca |
| 2003 | Function Matching: Algorithms, Applications, and a Lower Bound. | Amihood Amir, Yonatan Aumann, Richard Cole, Moshe Lewenstein, Ely Porat |
| 2003 | Discounting the Future in Systems Theory. | Luca de Alfaro, Thomas A. Henzinger, Rupak Majumdar |
| 2003 | Information Flow in Concurrent Games. | Luca de Alfaro, Marco Faella |
| 2003 | A Study of Integrated Document and Connection Caching. | Susanne Albers, Rob van Stee |
| 2003 | Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. | Alexander A. Ageev, Yinyu Ye, Jiawei Zhang |
| 2002 | Optimal Net Surface Problems with Applications. | Xiaodong Wu, Danny Z. Chen |
| 2002 | Universal Inherence of Cycle-Free Context-Free Ambiguity Functions. | Klaus Wich |
| 2002 | The Essence of Principal Typings. | J. B. Wells |
| 2002 | Linear Time Algorithms on Chordal Bipartite and Strongly Chordal Graphs. | Ryuhei Uehara |
| 2002 | Deciding DPDA Equivalence Is Primitive Recursive. | Colin Stirling |
| 2002 | Strong Bisimilarity and Regularity of Basic Process Algebra Is PSPACE-Hard. | Jir Srba |
| 2002 | L(A) = L(B)? Decidability Results from Complete Formal Systems. | Graud Snizergues |
| 2002 | Molecular Assembly and Computation: From Theory to Experimental Demonstrations. | John H. Reif |
| 2002 | Improving Time Bounds on Maximum Generalised Flow Computations by Contracting the Network. | Tomasz Radzik |