Distributed Computing, Volume 20

Volume 20, Number 1, July 2007

Anish Arora:
Introduction. 1
Electronic Edition (link) BibTeX
Alain Bui, Ajoy Kumar Datta, Franck Petit, Vincent Villain:
Snap-stabilization and PIF in tree networks. 3-19
Electronic Edition (link) BibTeX
Mohamed G. Gouda, F. Furman Haddix:
The alternator. 21-28
Electronic Edition (link) BibTeX
Shlomi Dolev, Ted Herman:
Parallel composition for time-to-fault adaptive stabilization. 29-38
Electronic Edition (link) BibTeX
Joffroy Beauquier, Sylvie Delaët, Shlomi Dolev, Sébastien Tixeuil:
Transient fault detectors. 39-51
Electronic Edition (link) BibTeX
Sukumar Ghosh, Arobinda Gupta, Ted Herman, Sriram V. Pemmaraju:
Fault-containing self-stabilizing distributed protocols. 53-73
Electronic Edition (link) BibTeX
Joffroy Beauquier, Maria Gradinariu, Colette Johnen:
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. 75-93
Electronic Edition (link) BibTeX

Indranil Gupta, Mahvesh Nagda, Christo Frank Devaraj:
The design of novel distributed protocols from differential equations. 95-114
Electronic Edition (link) BibTeX
Josef Widder, Ulrich Schmid:
Booting clock synchronization in partially synchronous systems with hybrid process and link failures. 115-140
Electronic Edition (link) BibTeX
Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri:
A family of optimal termination detection algorithms. 141-162
Electronic Edition (link) BibTeX

Pierre Fraigniaud:
Special Issue DISC 2005. 163
Electronic Edition (link) BibTeX
Rachid Guerraoui, Eric Ruppert:
Anonymous and fault-tolerant shared-memory computing. 165-177
Electronic Edition (link) BibTeX
Amos Korman:
General compact labeling schemes for dynamic trees. 179-193
Electronic Edition (link) BibTeX
Maurice Herlihy, Ye Sun:
Distributed transactional memory for metric-space networks. 195-208
Electronic Edition (link) BibTeX
Dahlia Malkhi, Douglas B. Terry:
Concise version vectors in WinFS. 209-219
Electronic Edition (link) BibTeX
Yehuda Afek, Yaron De Levie:
Efficient adaptive collect algorithms. 221-238
Electronic Edition (link) BibTeX

Yehuda Afek, Eli Gafni, Adam Morrison:
Common2 extended to stacks and unbounded concurrency. 239-252
Electronic Edition (link) BibTeX
Amos Korman, Shay Kutten:
Distributed verification of minimum spanning trees. 253-266
Electronic Edition (link) BibTeX
Ayalvadi J. Ganesh, Anne-Marie Kermarrec, Erwan Le Merrer, Laurent Massoulié:
Peer counting and sampling in overlay networks based on random walks. 267-278
Electronic Edition (link) BibTeX
Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
The computational power of population protocols. 279-304
Electronic Edition (link) BibTeX

Tal Mizrahi, Yoram Moses:
Continuous consensus via common knowledge. 305-321
Electronic Edition (link) BibTeX
Edya Ladan-Mozes, Nir Shavit:
An optimistic approach to lock-free FIFO queues. 323-341
Electronic Edition (link) BibTeX
Rachid Guerraoui, Petr Kouznetsov:
Failure detectors as type boosters. 343-358
Electronic Edition (link) BibTeX
Bojian Xu, Srikanta Tirthapura, Costas Busch:
Sketching asynchronous data streams over sliding windows. 359-374
Electronic Edition (link) BibTeX
Shlomi Dolev, Ronen I. Kat:
HyperTree for self-stabilizing peer-to-peer systems. 375-388
Electronic Edition (link) BibTeX

Shlomi Dolev, Alexander A. Shvartsman:
Introduction to special issue dedicated to the DISC 20th anniversary. 389-390
Electronic Edition (link) BibTeX
Maleq Khan, Gopal Pandurangan:
A fast distributed approximation algorithm for minimum spanning trees. 391-402
Electronic Edition (link) BibTeX
Michael Okun, Amnon Barak, Eli Gafni:
Renaming in synchronous message passing systems with Byzantine failures. 403-413
Electronic Edition (link) BibTeX
Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov:
The weakest failure detectors to boost obstruction-freedom. 415-433
Electronic Edition (link) BibTeX
Piotr Zielinski:
Low-latency atomic broadcast in the presence of contention. 435-450
Electronic Edition (link) BibTeX