| 2001 | A cost effective architecture for vectorizable numerical and multimedia applications. Francisca Quintana, Jesús Corbal, Roger Espasa, Mateo Valero |
| 2001 | A data tracking scheme for general networks. Rajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri |
| 2001 | A note on cycle covering. Jean-Claude Bermond, David Coudert, Lilian Chacon, François Tillerot |
| 2001 | A parallel block algorithm for exact triangularization of rectangular matrices. Jean-Guillaume Dumas, Jean-Louis Roch |
| 2001 | A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systems. Philippas Tsigas, Yi Zhang |
| 2001 | A work-optimal CGM algorithm for the LIS problem. Thierry Garcia, Jean Frédéric Myoupo, David Semé |
| 2001 | Approximation algorithms for data management in networks. Christof Krick, Harald Räcke, Matthias Westermann |
| 2001 | Attack propagation in networks. Sotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis |
| 2001 | Automatable verification of sequential consistency. Anne Condon, Alan J. Hu |
| 2001 | Columnsort lives! an efficient out-of-core sorting program. Geeta Chaudhry, Thomas H. Cormen, Leonard F. Wisniewski |
| 2001 | Compact routing schemes. Mikkel Thorup, Uri Zwick |
| 2001 | Competitve buffer management for shared-memory switches. Ellen L. Hahne, Alexander Kesselman, Yishay Mansour |
| 2001 | Computational power of pipelined memory hierarchies. Gianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik |
| 2001 | D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networks. Yongbing Zhang, Xiaohua Jia, Sajal K. Das |
| 2001 | Deterministic resource discovery in distributed networks. Shay Kutten, David Peleg, Uzi Vishkin |
| 2001 | Efficient parallel exponentiation in GF(2 Mun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho |
| 2001 | Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. Gábor Ivanyos, Frédéric Magniez, Miklos Santha |
| 2001 | Estimating simple functions on the union of data streams. Phillip B. Gibbons, Srikanta Tirthapura |
| 2001 | Eventually consistent failure detectors. Mikel Larrea, Antonio Fernández, Sergio Arévalo |
| 2001 | Fast, minimal and oblivious routing algorithms on the mesh with bounded queues. Ami Litman, Shiri Moran-Schein |
| 2001 | Finding large independent sets of hypergraphs in parallel. Hadas Shachnai, Aravind Srinivasan |
| 2001 | Finding strongly connected components in parallel in particle transport sweeps. Will McLendon III, Bruce Hendrickson, Steve Plimpton, Lawrence Rauchwerger |
| 2001 | Latency effects on reachability in large-scale peer-to-peer networks. Fred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic |
| 2001 | Library support for orthogonal processor groups. Thomas Rauber, Robert Reilein, Gudula Rünger |
| 2001 | Low-contention depth-first scheduling of parallel computations with write-once synchronization variables. Panagiota Fatourou |
| 2001 | Modeling weakly consistent memories with locks. Victor Luchangco |
| 2001 | New spectral bounds on k-partitioning of graphs. Robert Elsässer, Thomas Lücking, Burkhard Monien |
| 2001 | On tiling space-time mapped loop nests. Martin Griebl |
| 2001 | One-to-Many routing on the mesh. Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci |
| 2001 | Optimal prefetching and caching for parallel I/O systems. Mahesh Kallahalla, Peter J. Varman |
| 2001 | Optimal semi-oblique tiling. Rumen Andonov, Stephan Balev, Sanjay V. Rajopadhye, Nicola Yanev |
| 2001 | Ordering disks for double erasure codes. Myra B. Cohen, Charles J. Colbourn |
| 2001 | Parallel controlled conspiracy number search. Ulf Lorenz |
| 2001 | Periodic, random-fault-tolerant correction networks. Marek Piotrów |
| 2001 | Proceedings of the Thirteenth Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 2001, Heraklion, Crete Island, Greece, July 4-6, 2001 Arnold L. Rosenberg |
| 2001 | Pursuit and evasion on a ring: An infinite hierarchy for parallel real--time systems. Stefan D. Bruda, Selim G. Akl |
| 2001 | Randomized k-set agreement. Achour Mostéfaoui, Michel Raynal |
| 2001 | Room synchronizations. Guy E. Blelloch, Perry Cheng, Phillip B. Gibbons |
| 2001 | Routing without flow control. Costas Busch, Maurice Herlihy, Roger Wattenhofer |
| 2001 | Scheduling best-effort and real-time pipelined applications on time-shared clusters. Yanyong Zhang, Anand Sivasubramaniam |
| 2001 | Scheduling on hierarchical clusters using malleable tasks. Pierre-François Dutot, Denis Trystram |
| 2001 | Scheduling tasks with small communication delays for clusters of processors. Evripidis Bampis, Rodolphe Giroudeau, Alexander V. Kononov |
| 2001 | Simple on-line algorithms for the maximum disjoint paths problem. Petr Kolman, Christian Scheideler |
| 2001 | Stability and non-stability of the FIFO protocol. Josep Díaz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos |
| 2001 | The power of duality for prefetching and sorting with parallel disks. David A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter |
| 2001 | The push tree problem. Frédéric Havet, Marc Wennink |
| 2001 | Towards a first vertical prototyping of an extremely fine-grained parallel programming approach. Dorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin |
| 2001 | Towards practical deteministic write-all algorithms. Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto |
| 2001 | Tradeoffs between knowledge and time of communication in geometric radio networks. Anders Dessmark, Andrzej Pelc |