Abstract is missing.
- Nonatomic mutual exclusion with local spinningJames H. Anderson, Yong-Jik Kim. 3-12 [doi]
- Space-optimal multi-writer snapshot objects are slowPanagiota Fatourou, Faith Ellen Fich, Eric Ruppert. 13-20 [doi]
- Safe memory reclamation for dynamic lock-free objects using atomic reads and writesMaged M. Michael. 21-30 [doi]
- Non-blocking timeout in scalable queue-based spin locksMichael L. Scott. 31-40 [doi]
- Establishing wireless conference calls under delay constraintsAmotz Bar-Noy, Grzegorz Malewicz. 41-50 [doi]
- GS:::3:::: scalable self-configuration and self-healing in wireless networksHongwei Zhang, Anish Arora. 58-67 [doi]
- Lexicographically optimal smoothing for broadband traffic multiplexingStergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi. 68-77 [doi]
- Active disk paxos with infinitely many processesGregory Chockler, Dahlia Malkhi. 78-87 [doi]
- The inherent price of indulgencePartha Dutta, Rachid Guerraoui. 88-97 [doi]
- Minimal replication cost for availabilityHaifeng Yu, Amin Vahdat. 98-107 [doi]
- Building secure file systems out of byantine storageDavid Mazières, Dennis Shasha. 108-117 [doi]
- Detectable byzantine agreement secure against faulty majoritiesMatthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith. 118-126 [doi]
- Building responseive TMR-based servers in presence of timing constraintsPaul D. Ezhilchelvan, Jean-Michel Hélary, Michel Raynal. 127 [doi]
- Exploiting precision vs. efficiency tradeoffs in symmetric replication environmentsUgur Çetintemel, Peter J. Keleher, Yanif Ahmad. 128 [doi]
- Towards a formal model for view maintenance in data warehousesAchour Mostéfaoui, Michel Raynal, Matthieu Roy, Divyakant Agrawal, Amr El Abbadi. 129 [doi]
- Dynamic-sized lock-free data structures131 [doi]
- Optimally work-competitive scheduling for cooperative computing with merging groupsChryssis Georgiou, Alexander Russell, Alexander A. Shvartsman. 132 [doi]
- Assignment-based partitioning in a condition monitoring systemYongqiang Huang, Hector Garcia-Molina. 133 [doi]
- Nearly optimal FIFO buffer management for DiffServZvi Lotker, Boaz Patt-Shamir. 134-142 [doi]
- Searching for a black hole in arbitrary networks: optimal mobile agent protocolsStefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro. 153-161 [doi]
- General perfectly periodic schedulingZvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir. 163-172 [doi]
- A BGP-based mechanism for lowest-cost routingJoan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, Scott Shenker. 173-182 [doi]
- Viceroy: a scalable and dynamic emulation of the butterflyDahlia Malkhi, Moni Naor, David Ratajczak. 183-192 [doi]
- On perfectly secure cmmunication over arbitrary networksM. V. N. Ashwin Kumar, Pranava R. Goundan, K. Srinathan, C. Pandu Rangan. 193-202 [doi]
- Sequential composition of protocols without simultaneous terminationYehuda Lindell, Anna Lysyanskaya, Tal Rabin. 203-212 [doi]
- Squirrel: a decentralized peer-to-peer web cacheSitaram Iyer, Antony I. T. Rowstron, Peter Druschel. 213-222 [doi]
- Fault-tolerant routing in peer-to-peer systemsJames Aspnes, Zoë Diamadi, Gauri Shah. 223-232 [doi]
- Analysis of the evolution of peer-to-peer systemsDavid Liben-Nowell, Hari Balakrishnan, David R. Karger. 233-242 [doi]
- Evaluating the running time of a communication round over the internetOmar Bakr, Idit Keidar. 243-252 [doi]
- Asynchronous interactive consistency and its relation with error-correcting codesAchour Mostéfaoui, Sergio Rajsbaum, Michel Raynal. 253 [doi]
- Selective anti-entropyWeibin Zhao, Henning Schulzrinne. 254 [doi]
- Compact routing for average-case networksKazuo Iwama, Masaki Okita. 255 [doi]
- How to wait when you are not going to blockMichael Greenwald. 256 [doi]
- Understanding perfect falure detectorsMikel Larrea. 257 [doi]
- Early stopping in aglobal data computationCarole Delporte-Gallet, Hugues Fauconnier, Jean-Michel Hélary, Michel Raynal. 258 [doi]
- Random walk for self-stabilitzing group communication in ad hoc networksShlomi Dolev, Elad Schiller, Jennifer L. Welch. 259 [doi]
- Two-handed emulation: how to build non-blocking implementation of complex data-structures using DCASMichael Greenwald. 260-269 [doi]
- ::::f::::-arrays: implementation and applicationsPrasad Jayanti. 270-279 [doi]
- Non-blocking steal-half work queuesDanny Hendler, Nir Shavit. 280-289 [doi]
- Dynamic and self-stabilizing distributed matchingSubhendu Chattopadhyay, Lisa Higham, Karen Seyffarth. 290-297 [doi]