| 2001 | Compact routing schemes. | Mikkel Thorup, Uri Zwick |
| 2001 | Finding large independent sets of hypergraphs in parallel. | Hadas Shachnai, Aravind Srinivasan |
| 2001 | Library support for orthogonal processor groups. | Thomas Rauber, Robert Reilein, Gudula Rnger |
| 2001 | A data tracking scheme for general networks. | Rajmohan Rajaraman, Andra W. Richa, Berthold Vcking, Gayathri Vuppuluri |
| 2001 | A cost effective architecture for vectorizable numerical and multimedia applications. | Francisca Quintana, Jess Corbal, Roger Espasa, Mateo Valero |
| 2001 | Periodic, random-fault-tolerant correction networks. | Marek Piotrw |
| 2001 | Attack propagation in networks. | Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis |
| 2001 | Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. | Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin |
| 2001 | Randomized k-set agreement. | Achour Mostfaoui, Michel Raynal |
| 2001 | Finding strongly connected components in parallel in particle transport sweeps. | Will McLendon III, Bruce Hendrickson, Steve Plimpton, Lawrence Rauchwerger |
| 2001 | Modeling weakly consistent memories with locks. | Victor Luchangco |
| 2001 | Parallel controlled conspiracy number search. | Ulf Lorenz |
| 2001 | Fast, minimal and oblivious routing algorithms on the mesh with bounded queues. | Ami Litman, Shiri Moran-Schein |
| 2001 | Efficient parallel exponentiation in GF(2 | Mun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho |
| 2001 | Eventually consistent failure detectors. | Mikel Larrea, Antonio Fernndez, Sergio Arvalo |
| 2001 | Deterministic resource discovery in distributed networks. | Shay Kutten, David Peleg, Uzi Vishkin |
| 2001 | Approximation algorithms for data management in networks. | Christof Krick, Harald Rcke, Matthias Westermann |
| 2001 | Simple on-line algorithms for the maximum disjoint paths problem. | Petr Kolman, Christian Scheideler |
| 2001 | Optimal prefetching and caching for parallel I/O systems. | Mahesh Kallahalla, Peter J. Varman |
| 2001 | Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. | Gbor Ivanyos, Frdric Magniez, Miklos Santha |
| 2001 | The power of duality for prefetching and sorting with parallel disks. | David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter |
| 2001 | One-to-Many routing on the mesh. | Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci |
| 2001 | The push tree problem. | Frdric Havet, Marc Wennink |
| 2001 | Competitve buffer management for shared-memory switches. | Ellen L. Hahne, Alexander Kesselman, Yishay Mansour |
| 2001 | On tiling space-time mapped loop nests. | Martin Griebl |