Table of Contents

• Compact routing schemesMikkel Thorup, Uri Zwick. 1-10 [doi]
• Routing without flow controlCostas Busch, Maurice Herlihy, Roger Wattenhofer. 11-20 [doi]
• Fast, minimal and oblivious routing algorithms on the mesh with bounded queuesAmi Litman, Shiri Moran-Schein. 21-31 [doi]
• One-to-Many routing on the meshKieran T. Herley, Andrea Pietracaprina, Geppino Pucci. 31-37 [doi]
• Simple on-line algorithms for the maximum disjoint paths problemPetr Kolman, Christian Scheideler. 38-47 [doi]
• Stability and non-stability of the FIFO protocolJosep Díaz, Dimitrios Koukopoulos, Sotiris E. Nikoletseas, Maria J. Serna, Paul G. Spirakis, Dimitrios M. Thilikos. 48-52 [doi]
• Competitve buffer management for shared-memory switchesEllen L. Hahne, Alexander Kesselman, Yishay Mansour. 53-58 [doi]
• Tradeoffs between knowledge and time of communication in geometric radio networksAnders Dessmark, Andrzej Pelc. 59-66 [doi]
• Attack propagation in networksSotiris E. Nikoletseas, Grigorios Prasinos, Paul G. Spirakis, Christos D. Zaroliagis. 67-76 [doi]
• Latency effects on reachability in large-scale peer-to-peer networksFred S. Annexstein, Kenneth A. Berman, Mihajlo A. Jovanovic. 84-92 [doi]
• Towards a first vertical prototyping of an extremely fine-grained parallel programming approachDorit Naishlos, Joseph Nuzman, Chau-Wen Tseng, Uzi Vishkin. 93-102 [doi]
• A cost effective architecture for vectorizable numerical and multimedia applicationsFrancisca Quintana, Jesús Corbal, Roger Espasa, Mateo Valero. 103-112 [doi]
• Automatable verification of sequential consistencyAnne Condon, Alan J. Hu. 113-121 [doi]
• Room synchronizationsGuy E. Blelloch, Perry Cheng, Phillip B. Gibbons. 122-133 [doi]
• A simple, fast and scalable non-blocking concurrent FIFO queue for shared memory multiprocessor systemsPhilippas Tsigas, Yi Zhang. 134-143 [doi]
• Computational power of pipelined memory hierarchiesGianfranco Bilardi, Kattamuri Ekanadham, Pratap Pattnaik. 144-152 [doi]
• Optimal semi-oblique tilingRumen Andonov, Stephan Balev, Sanjay V. Rajopadhye, Nicola Yanev. 153-162 [doi]
• Columnsort lives! an efficient out-of-core sorting programGeeta Chaudhry, Thomas H. Cormen, Leonard F. Wisniewski. 169-178 [doi]
• Efficient parallel exponentiation in GF(2:::n:::) using normal basis representationsMun-Kyu Lee, Yoonjeong Kim, Kunsoo Park, Yookun Cho. 179-188 [doi]
• Low-contention depth-first scheduling of parallel computations with write-once synchronization variablesPanagiota Fatourou. 189-198 [doi]
• Scheduling on hierarchical clusters using malleable tasksPierre-François Dutot, Denis Trystram. 199-208 [doi]
• Optimal prefetching and caching for parallel I/O sytemsMahesh Kallahalla, Peter J. Varman. 219-228 [doi]
• Ordering disks for double erasure codesMyra B. Cohen, Charles J. Colbourn. 229-236 [doi]
• Approximation algorithms for data management in networksChristof Krick, Harald Räcke, Matthias Westermann. 237-246 [doi]
• A data tracking scheme for general networksRajmohan Rajaraman, Andréa W. Richa, Berthold Vöcking, Gayathri Vuppuluri. 247-254 [doi]
• New spectral bounds on k-partitioning of graphsRobert Elsässer, Thomas Lücking, Burkhard Monien. 255-262 [doi]
• Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problemGábor Ivanyos, Frédéric Magniez, Miklos Santha. 263-270 [doi]
• Towards practical deteministic write-all algorithmsBogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto. 271-280 [doi]
• Estimating simple functions on the union of data streamsPhillip B. Gibbons, Srikanta Tirthapura. 281-291 [doi]
• Randomized k-set agreementAchour Mostéfaoui, Michel Raynal. 291-297 [doi]
• Periodic, random-fault-tolerant correction networksMarek Piotrów. 298-305 [doi]
• D-CAT: A distributed channel allocation strategy based on a threshold scheme for cellular mobile networksYongbing Zhang, Xiaohua Jia, Sajal K. Das. 308-309 [doi]
• A note on cycle coveringJean-Claude Bermond, David Coudert, Lilian Chacon, François Tillerot. 310-311 [doi]
• Pursuit and evasion on a ring: An infinite hierarchy for parallel real--time systemsStefan D. Bruda, Selim G. Akl. 312-313 [doi]
• Scheduling tasks with small communication delays for clusters of processorsEvripidis Bampis, Rodolphe Giroudeau, Alexander Kononov. 314-315 [doi]
• Library support for orthogonal processor groupsThomas Rauber, Robert Reilein, Gudula Rünger. 316-317 [doi]
• The push tree problemFrédéric Havet, Marc Wennink. 318-319 [doi]
• Parallel controlled conspiracy number searchUlf Lorenz. 320-321 [doi]
• On tiling space-time mapped loop nestsMartin Griebl. 322-323 [doi]
• A parallel block algorithm for exact triangularization of rectangular matricesJean-Guillaume Dumas, Jean-Louis Roch. 324-325 [doi]
• Eventually consistent failure detectorsMikel Larrea, Antonio Fernández, Sergio Arévalo. 326-327 [doi]
• Finding strongly connected components in parallel in particle transport sweepsWill McLendon III, Bruce Hendrickson, Steve Plimpton, Lawrence Rauchwerger. 328-329 [doi]
• A work-optimal CGM algorithm for the LIS problemThierry Garcia, Jean Frédéric Myoupo, David Semé. 330-331 [doi]
• Modeling weakly consistent memories with locksVictor Luchangco. 332-333 [doi]
• The power of duality for prefetching and sorting with parallel disksDavid A. Hutchinson, Peter Sanders, Jeffrey Scott Vitter. 334-335 [doi]