21. PODC 2002: Monterey, California, USA

• James H. Anderson, Yong-Jik Kim:
  Nonatomic mutual exclusion with local spinning. 3-12
  
• Panagiota Fatourou, Faith Ellen Fich, Eric Ruppert:
  Space-optimal multi-writer snapshot objects are slow. 13-20
  
• Maged M. Michael:
  Safe memory reclamation for dynamic lock-free objects using atomic reads and writes. 21-30
  
• Michael L. Scott:
  Non-blocking timeout in scalable queue-based spin locks. 31-40
  
• Amotz Bar-Noy, Grzegorz Malewicz:
  Establishing wireless conference calls under delay constraints. 41-50
  
• Tomasz Jurdzinski, Miroslaw Kutylowski, Jan Zatopianski:
  Efficient algorithms for leader election in radio networks. 51-57
  
• Hongwei Zhang, Anish Arora:
  GS³: scalable self-configuration and self-healing in wireless networks. 58-67
  
• Stergios V. Anastasiadis, Peter J. Varman, Jeffrey Scott Vitter, Ke Yi:
  Lexicographically optimal smoothing for broadband traffic multiplexing. 68-77
  
• Gregory Chockler, Dahlia Malkhi:
  Active disk paxos with infinitely many processes. 78-87
  
• Partha Dutta, Rachid Guerraoui:
  The inherent price of indulgence. 88-97
  
• Haifeng Yu, Amin Vahdat:
  Minimal replication cost for availability. 98-107
  
• David Mazières, Dennis Shasha:
  Building secure file systems out of byantine storage. 108-117
  
• Matthias Fitzi, Daniel Gottesman, Martin Hirt, Thomas Holenstein, Adam Smith:
  Detectable byzantine agreement secure against faulty majorities. 118-126
  
• Paul D. Ezhilchelvan, Jean-Michel Hélary, Michel Raynal:
  Building responseive TMR-based servers in presence of timing constraints. 127
  
• Ugur Çetintemel, Peter J. Keleher, Yanif Ahmad:
  Exploiting precision vs. efficiency tradeoffs in symmetric replication environments. 128
  
• Achour Mostéfaoui, Michel Raynal, Matthieu Roy, Divyakant Agrawal, Amr El Abbadi:
  Towards a formal model for view maintenance in data warehouses. 129
  
• K. Vidyasankar:
  A highly concurrent group mutual /-exclusion algorithm⁰. 130
  
• Maurice Herlihy, Victor Luchangco, Paul A. Martin, Mark Moir:
  Dynamic-sized lock-free data structures. 131
  
• Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman:
  Optimally work-competitive scheduling for cooperative computing with merging groups. 132
  
• Yongqiang Huang, Hector Garcia-Molina:
  Assignment-based partitioning in a condition monitoring system. 133
  
• Zvi Lotker, Boaz Patt-Shamir:
  Nearly optimal FIFO buffer management for DiffServ. 134-142
  
• Andrei Z. Broder, Michael Mitzenmacher:
  Optmial plans for aggregation. 144-152
  
• Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe, Nicola Santoro:
  Searching for a black hole in arbitrary networks: optimal mobile agent protocols. 153-161
  
• Zvika Brakerski, Aviv Nisgav, Boaz Patt-Shamir:
  General perfectly periodic scheduling. 163-172
  
• Joan Feigenbaum, Christos H. Papadimitriou, Rahul Sami, Scott Shenker:
  A BGP-based mechanism for lowest-cost routing. 173-182
  
• Dahlia Malkhi, Moni Naor, David Ratajczak:
  Viceroy: a scalable and dynamic emulation of the butterfly. 183-192
  
• M. V. N. Ashwin Kumar, Pranava R. Goundan, K. Srinathan, C. Pandu Rangan:
  On perfectly secure cmmunication over arbitrary networks. 193-202
  
• Yehuda Lindell, Anna Lysyanskaya, Tal Rabin:
  Sequential composition of protocols without simultaneous termination. 203-212
  
• Sitaram Iyer, Antony I. T. Rowstron, Peter Druschel:
  Squirrel: a decentralized peer-to-peer web cache. 213-222
  
• James Aspnes, Zoë Diamadi, Gauri Shah:
  Fault-tolerant routing in peer-to-peer systems. 223-232
  
• David Liben-Nowell, Hari Balakrishnan, David R. Karger:
  Analysis of the evolution of peer-to-peer systems. 233-242
  
• Omar Bakr, Idit Keidar:
  Evaluating the running time of a communication round over the internet. 243-252
  
• Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
  Asynchronous interactive consistency and its relation with error-correcting codes. 253
  
• Weibin Zhao, Henning Schulzrinne:
  Selective anti-entropy. 254
  
• Kazuo Iwama, Masaki Okita:
  Compact routing for average-case networks. 255
  
• Michael Greenwald:
  How to wait when you are not going to block. 256
  
• Mikel Larrea:
  Understanding perfect failure detectors. 257
  
• Carole Delporte-Gallet, Hugues Fauconnier, Jean-Michel Hélary, Michel Raynal:
  Early stopping in aglobal data computation. 258
  
• Shlomi Dolev, Elad Schiller, Jennifer L. Welch:
  Random walk for self-stabilitzing group communication in ad hoc networks. 259
  
• Michael Greenwald:
  Two-handed emulation: how to build non-blocking implementation of complex data-structures using DCAS. 260-269
  
• Prasad Jayanti:
  f-arrays: implementation and applications. 270-279
  
• Danny Hendler, Nir Shavit:
  Non-blocking steal-half work queues. 280-289
  
• Subhendu Chattopadhyay, Lisa Higham, Karen Seyffarth:
  Dynamic and self-stabilizing distributed matching. 290-297
  

Last update Fri May 25 08:32:34 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page