| 2003 | Time of Radio Broadcasting. | Dariusz R. Kowalski, Andrzej Pelc |
| 2003 | Instability of Networks with Quasi-Static Link Capacities. | Dimitrios Koukopoulos, Marios Mavronicolas, Paul G. Spirakis |
| 2003 | Polynomial-Time Computable Backup Tables for Shortest-Path Routing. | Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro |
| 2003 | Interval Routing in Reliability Networks. | Cyril Gavoille, Martin Nehz |
| 2003 | On Routing of Wavebands for Gossiping in All-Optical Paths and Cycles. | Michele Flammini, Alfredo Navarra, Andrzej Proskurowski |
| 2003 | The Do-All Problem with Byzantine Processor Failures. | Antonio Fernndez, Chryssis Georgiou |
| 2003 | The Broadcast Assignment Problem. | Christian Destr, Christian Laforest, Sandrine Vial |
| 2003 | Communication Properties of Cycle Prefix Digraphs. | Francesc Comellas, Margarida Mitjana |
| 2003 | Vertex Labeling and Routing in Recursive Clique-Trees, a New Family of Small-World Scale-Free Graphs. | Francesc Comellas, Guillaume Fertin, Andr Raspaud |
| 2003 | The Cost of Concurrent, Low-Contention Read-Modify-Write. | Costas Busch, Marios Mavronicolas, Paul G. Spirakis |
| 2003 | Approximate Multicommodity Flow for WDM Networks Design. | Mohamed Bouklit, David Coudert, Jean-Franois Lalande, Christophe Paul, Herv Rivano |
| 2003 | Bounds for Frequency Estimation of Packet Streams. | Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yihui Tang |
| 2003 | Election and Rendezvous in Fully Anonymous Systems with Sense of Direction. | Lali Barrire, Paola Flocchini, Pierre Fraigniaud, Nicola Santoro |
| 2003 | Energy Consumption in Radio Networks: Selfish Agents and Rewarding Mechanisms. | Christoph Ambhl, Andrea E. F. Clementi, Paolo Penna, Gianluca Rossi, Riccardo Silvestri |
| 2002 | An Upper Bound Result for Multi-label Interval Routing on Planar Graphs. | Savio S. H. Tse, Francis C. M. Lau |
| 2002 | A Protocol for Randomized Anonymous Two-process Wait-free Test-and-Set with Finite-state Verification. | John Tromp, Paul M. B. Vitnyi |
| 2002 | Distributed Highly Available Search Trees. | Konrad Schlude, Eljas Soisalon-Soininen, Peter Widmayer |
| 2002 | Two New Applications of Dynamos. | Fabrizio Luccio, Linda Pagli |
| 2002 | Minimum Feedback Vertex Sets in Shuffle-based Interconnection Networks. | Rastislav Kralovic, Peter Ruzicka |
| 2002 | Approximate Equilibria and Ball Fusion. | Elias Koutsoupias, Marios Mavronicolas, Paul G. Spirakis |
| 2002 | Disjoint Paths in Symmetric Digraphs. | Aubin Jarry, Stephane Perennes |
| 2002 | Avoiding Routing Loops on the Internet. | Hiro Ito, Kazuo Iwama, Yasuo Okabe, Takuya Yoshihiro |
| 2002 | Dimension-Exchange Algorithms for Load Balancing on Trees. | Michael E. Houle, Antonios Symvonis, David R. Wood |
| 2002 | Design of Fault Tolerant Satellite Networks with Priorities via Selectors. | Frdric Havet |
| 2002 | Equivalence of Structural Knowledges in Distributed Algorithms. | Emmanuel Godard, Yves Mtivier |