Abstract is missing.
- On delivery times in packet networks under adversarial trafficAdi Rosén, Michael S. Tsirkin. 1-10 [doi]
- Adaptive channel queue routing on k-ary n-cubesArjun Singh, William J. Dally, Amit K. Gupta, Brian Towles. 11-19 [doi]
- Compact name-independent routing with minimum stretchIttai Abraham, Cyril Gavoille, Dahlia Malkhi, Noam Nisan, Mikkel Thorup. 20-24 [doi]
- Object location in realistic networksKirsten Hildrum, Robert Krauthgamer, John Kubiatowicz. 25-35 [doi]
- Simple efficient load balancing algorithms for peer-to-peer systemsDavid R. Karger, Matthias Ruhl. 36-43 [doi]
- Consistent and compact data management in distributed storage systemsBaruch Awerbuch, Christian Scheideler. 44-53 [doi]
- Geometric generalizations of the power of two choicesJohn W. Byers, Jeffrey Considine, Michael Mitzenmacher. 54-63 [doi]
- Fighting against two adversaries: page migration in dynamic networksMarcin Bienkowski, Miroslaw Korzeniowski, Friedhelm Meyer auf der Heide. 64-73 [doi]
- Online hierarchical cooperative cachingXiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani. 74-83 [doi]
- New results on web caching with request reorderingSusanne Albers. 84-92 [doi]
- Packet-mode policies for input-queued switchesDan Guez, Alexander Kesselman, Adi Rosén. 93-102 [doi]
- Parallelism versus memory allocation in pipelined router forwarding enginesFan R. K. Chung, Ronald L. Graham, George Varghese. 103-111 [doi]
- Lower bounds for graph embeddings and combinatorial preconditionersGary L. Miller, Peter C. Richter. 112-119 [doi]
- Balanced graph partitioningKonstantin Andreev, Harald Räcke. 120-124 [doi]
- Bi-criteria algorithm for scheduling jobs on cluster platformsPierre-François Dutot, Lionel Eyraud, Grégory Mounié, Denis Trystram. 125-132 [doi]
- On-the-fly maintenance of series-parallel relationships in fork-join multithreaded programsMichael A. Bender, Jeremy T. Fineman, Seth Gilbert, Charles E. Leiserson. 133-144 [doi]
- An NC algorithm for finding a maximal acyclic set in a graphAaron Windsor. 145-150 [doi]
- Scheduling against an adversarial networkStefano Leonardi, Alberto Marchetti-Spaccamela, Friedhelm Meyer auf der Heide. 151-159 [doi]
- On achieving optimized capacity utilization in application overlay networks with multiple competing sessionsYi Cui, Baochun Li, Klara Nahrstedt. 160-169 [doi]
- Pagoda: a dynamic overlay network for routing, data management, and multicastingAnkur Bhargava, Kishore Kothapalli, Chris Riley, Christian Scheideler, Mark Thober. 170-179 [doi]
- Sharing the cost of multicast transmissions in wireless networksVittorio Bilò, Chiara Di Francescomarino, Michele Flammini, Giovanna Melideo. 180-187 [doi]
- Selfish load balancing and atomic congestion gamesSubhash Suri, Csaba D. Tóth, Yunhong Zhou. 188-195 [doi]
- How to route and tax selfish unsplittable trafficVincenzo Auletta, Roberto De Prisco, Paolo Penna, Pino Persiano. 196-205 [doi]
- A scalable lock-free stack algorithmDanny Hendler, Nir Shavit, Lena Yerushalmi. 206-215 [doi]
- DCAS is not a silver bullet for nonblocking algorithm designSimon Doherty, David Detlefs, Lindsay Groves, Christine H. Flood, Victor Luchangco, Paul A. Martin, Mark Moir, Nir Shavit, Guy L. Steele Jr.. 216-224 [doi]
- Efficient orchestration of sub-word parallelism in media processorsJohn Oliver, Venkatesh Akella, Frederic T. Chong. 225-234 [doi]
- Effectively sharing a cache among threadsGuy E. Blelloch, Phillip B. Gibbons. 235-244 [doi]
- Cache-oblivious shortest paths in graphs using buffer heapRezaul Alam Chowdhury, Vijaya Ramachandran. 245-254 [doi]
- Online algorithms for prefetching and caching on parallel disksRahul Shah, Peter J. Varman, Jeffrey Scott Vitter. 255-264 [doi]
- Improved combination of online algorithms for acceptance and rejectionDavid P. Bunde, Yishay Mansour. 265-266 [doi]
- Time complexity of practical parallel steiner point insertion algorithmsDaniel A. Spielman, Shang-Hua Teng, Alper Üngör. 267-268 [doi]
- The inherent queuing delay of parallel packet switchesHagit Attiya, David Hay. 269-270 [doi]
- Efficient search in unstructured peer-to-peer networksVicent Cholvi, Pascal Felber, Ernst W. Biersack. 271-272 [doi]
- The potential in energy efficiency of a speculative chip-multiprocessorYuu Tanaka, Toshinori Sato, Takenori Koushiro. 273-274 [doi]
- Online algorithms for network designAdam Meyerson. 275-280 [doi]
- Expansion properties of (secure) wireless networksAlessandro Panconesi, Jaikumar Radhakrishnan. 281-285 [doi]
- The effect of faults on network expansionAmitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary, David Eppstein, Christian Scheideler. 286-293 [doi]
- Dynamic analysis of the arrow distributed protocolFabian Kuhn, Roger Wattenhofer. 294-301 [doi]
- Optimal early stopping uniform consensus in synchronous systems with process omission failuresPhilippe Raipin Parvédy, Michel Raynal. 302-310 [doi]
- Writing-all deterministically and optimally using a non-trivial number of asynchronous processorsDariusz R. Kowalski, Alexander A. Shvartsman. 311-320 [doi]