| 2004 | Geometric generalizations of the power of two choices. | John W. Byers, Jeffrey Considine, Michael Mitzenmacher |
| 2004 | Improved combination of online algorithms for acceptance and rejection. | David P. Bunde, Yishay Mansour |
| 2004 | Effectively sharing a cache among threads. | Guy E. Blelloch, Phillip B. Gibbons |
| 2004 | Sharing the cost of multicast transmissions in wireless networks. | Vittorio Bil, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo |
| 2004 | Fighting against two adversaries: page migration in dynamic networks. | Marcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide |
| 2004 | Pagoda: a dynamic overlay network for routing, data management, and multicasting. | Ankur Bhargava, Kishore Kothapalli, Chris Riley, Christian Scheideler, Mark Thober |
| 2004 | On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programs. | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson |
| 2004 | The effect of faults on network expansion. | Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler |
| 2004 | Consistent and compact data management in distributed storage systems. | Baruch Awerbuch, Christian Scheideler |
| 2004 | How to route and tax selfish unsplittable traffic. | Vincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano |
| 2004 | The inherent queuing delay of parallel packet switches. | Hagit Attiya, David Hay |
| 2004 | Balanced graph partitioning. | Konstantin Andreev, Harald Rcke |
| 2004 | New results on web caching with request reordering. | Susanne Albers |
| 2004 | Compact name-independent routing with minimum stretch. | Ittai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup |
| 2003 | Optimal fault-tolerant linear arrays. | Toshinori Yamada, Shuichi Ueno |
| 2003 | Throughput-centric routing algorithm design. | Brian Towles, William J. Dally, Stephen P. Boyd |
| 2003 | MAPO: using a committee of algorithm-experts for parallel optimization of costly functions. | Christine A. Shoemaker, Rommel G. Regis |
| 2003 | Worst case mobility in ad hoc networks. | Christian Schindelhauer, Tams Lukovszki, Stefan Rhrup, Klaus Volbert |
| 2003 | Polynomial time algorithms for network information flow. | Peter Sanders, Sebastian Egner, Ludo M. G. M. Tolhuizen |
| 2003 | Novel architectures for P2P applications: the continuous-discrete approach. | Moni Naor, Udi Wieder |
| 2003 | VLSI layout of trees into grids of minimum width. | Akira Matsubayashi |
| 2003 | Nonblocking k-compare-single-swap. | Victor Luchangco, Mark Moir, Nir Shavit |
| 2003 | MST construction in O(log log n) communication rounds. | Zvi Lotker, Elan Pavlov, Boaz Patt-Shamir, David Peleg |
| 2003 | Quantifying instruction criticality for shared memory multiprocessors. | Tong Li, Alvin R. Lebeck, Daniel J. Sorin |
| 2003 | Online deadline scheduling: multiple machines and randomization. | Jae-Ha Lee |