Abstract is missing.
- Randomized queue management for DiffServNir Andelman. 1-10 [doi]
- Randomization does not reduce the average delay in parallel packet switchesHagit Attiya, David Hay. 11-20 [doi]
- Dynamic circular work-stealing dequeDavid Chase, Yossi Lev. 21-28 [doi]
- Lexicographic QoS scheduling for parallel I/OAjay Gulati, Peter J. Varman. 29-38 [doi]
- Coloring unstructured radio networksThomas Moscibroda, Roger Wattenhofer. 39-48 [doi]
- Name independent routing for growth bounded networksIttai Abraham, Dahlia Malkhi. 49-55 [doi]
- Windows scheduling of arbitrary length jobs on parallel machinesAmotz Bar-Noy, Richard E. Ladner, Tami Tamir, Tammy VanDeGrift. 56-65 [doi]
- Parallel scheduling of complex dags under uncertaintyGrzegorz Malewicz. 66-75 [doi]
- On distributed smooth schedulingAmi Litman, Shiri Moran-Schein. 76-85 [doi]
- Scheduling malleable tasks with precedence constraintsKlaus Jansen, Hu Zhang. 86-95 [doi]
- An adaptive power conservation scheme for heterogeneous wireless sensor networks with node redeploymentIoannis Chatzigiannakis, Athanasios Kinalis, Sotiris E. Nikoletseas. 96-105 [doi]
- Irrigating ad hoc networks in constant timeDevdatt P. Dubhashi, C. Johansson, Olle Häggström, Alessandro Panconesi, Mauro Sozio. 106-115 [doi]
- Constant density spanners for wireless ad-hoc networksKishore Kothapalli, Christian Scheideler, Melih Onus, Andréa W. Richa. 116-125 [doi]
- The expansion and mixing time of skip graphs with applicationsJames Aspnes, Udi Wieder. 126-134 [doi]
- Decentralized algorithms using both local and random probes for P2P load balancingKrishnaram Kenthapadi, Gurmeet Singh Manku. 135-144 [doi]
- Fast construction of overlay networksDana Angluin, James Aspnes, Jiang Chen, Yinghua Wu, Yitong Yin. 145-154 [doi]
- Peer-to-peer networks based on random transformations of connected regular undirected graphsPeter Mahlmann, Christian Schindelhauer. 155-164 [doi]
- Processor efficient parallel matchingPiotr Sankowski. 165-170 [doi]
- Parallelizing time with polynomial circuitsRyan Williams. 171-175 [doi]
- Finding effective support-tree preconditionersBruce M. Maggs, Gary L. Miller, Ojas Parekh, R. Ravi, Shan Leung Maverick Woo. 176-185 [doi]
- Is partial quantum search of a database any easier?Lov K. Grover, Jaikumar Radhakrishnan. 186-194 [doi]
- A truthful mechanism for the non-utilitarian minimum radius spanning tree problemGuido Proietti, Peter Widmayer. 195-202 [doi]
- Selfish routing with incomplete informationMartin Gairing, Burkhard Monien, Karsten Tiemann. 203-212 [doi]
- A segmented parallel-prefix VLSI circuit with small delays for small segmentsBradley C. Kuszmaul. 213 [doi]
- A forward planning situated protocol for data propagation in wireless sensor networks based on swarm intelligence techniquesIoannis Chatzigiannakis, Sotiris E. Nikoletseas. 214 [doi]
- Autonomous virtual mobile nodesShlomi Dolev, Seth Gilbert, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch. 215 [doi]
- A space lower bound for name-independent compact routing in treesKofi A. Laing, Rajmohan Rajaraman. 216 [doi]
- On competitive online read-many parallel disks schedulingRahul Shah, Peter J. Varman, Jeffrey Scott Vitter. 217 [doi]
- Weighted distributed hash tablesChristian Schindelhauer, Gunnar Schomaker. 218-227 [doi]
- Concurrent cache-oblivious b-treesMichael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul. 228-237 [doi]
- Admission control to minimize rejections and online set cover with repetitionsNoga Alon, Yossi Azar, Shai Gutner. 238-244 [doi]
- Efficient algorithms for verifying memory consistencyChaiyasit Manovit, Sudheendra Hangal. 245-252 [doi]
- Using elimination to implement scalable and lock-free FIFO queuesMark Moir, Daniel Nussbaum, Ori Shalev, Nir Shavit. 253-262 [doi]
- Collaborate with strangers to find own preferencesBaruch Awerbuch, Yossi Azar, Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle. 263-269 [doi]
- Dynamic page migration with stochastic requestsMarcin Bienkowski. 270-278 [doi]
- Broadcasting on networks of workstationsSamir Khuller, Yoo Ah Kim, Yung-Chun (Justin) Wan. 279-288 [doi]
- Traffic engineering of management flows by link augmentations on confluent treesRandeep Bhatia, Nicole Immorlica, Tracy Kimbrel, Vahab S. Mirrokni, Seffi Naor, Baruch Schieber. 289-298 [doi]
- Value-maximizing deadline scheduling and its application to animation renderingEric Anderson, Dirk Beyer 0002, Kamalika Chaudhuri, Terence Kelly, Norman Salazar, Cipriano A. Santos, Ram Swaminathan, Robert Endre Tarjan, Janet L. Wiener, Yunhong Zhou. 299-308 [doi]
- Radio communication in random graphs: extended abstractRobert Elsässer, Leszek Gasieniec. 309-315 [doi]
- Oblivious routing on geometric networksCostas Busch, Malik Magdon-Ismail, Jing Xi. 316-324 [doi]
- Adversarial contention resolution for simple channelsMichael A. Bender, Martin Farach-Colton, Simai He, Bradley C. Kuszmaul, Charles E. Leiserson. 325-332 [doi]