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