default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDistributed Computing, Volume 20
Volume 20, Number 1, July 2007
- Anish Arora:
Introduction. 1 - Alain Bui, Ajoy Kumar Datta, Franck Petit
, Vincent Villain:
Snap-stabilization and PIF in tree networks. 3-19 - Mohamed G. Gouda, F. Furman Haddix:
The alternator. 21-28 - Shlomi Dolev, Ted Herman:
Parallel composition for time-to-fault adaptive stabilization. 29-38 - Joffroy Beauquier, Sylvie Delaët, Shlomi Dolev, Sébastien Tixeuil:
Transient fault detectors. 39-51 - Sukumar Ghosh, Arobinda Gupta, Ted Herman, Sriram V. Pemmaraju:
Fault-containing self-stabilizing distributed protocols. 53-73 - Joffroy Beauquier, Maria Gradinariu, Colette Johnen:
Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings. 75-93
Volume 20, Number 2, August 2007
- Indranil Gupta, Mahvesh Nagda, Christo Frank Devaraj:
The design of novel distributed protocols from differential equations. 95-114 - Josef Widder, Ulrich Schmid:
Booting clock synchronization in partially synchronous systems with hybrid process and link failures. 115-140 - Neeraj Mittal, Subbarayan Venkatesan, Sathya Peri:
A family of optimal termination detection algorithms. 141-162
Volume 20, Number 3, October 2007
- Pierre Fraigniaud:
Special Issue DISC 2005. 163 - Rachid Guerraoui, Eric Ruppert:
Anonymous and fault-tolerant shared-memory computing. 165-177 - Amos Korman:
General compact labeling schemes for dynamic trees. 179-193 - Maurice Herlihy, Ye Sun:
Distributed transactional memory for metric-space networks. 195-208 - Dahlia Malkhi, Douglas B. Terry:
Concise version vectors in WinFS. 209-219 - Yehuda Afek, Yaron De Levie:
Efficient adaptive collect algorithms. 221-238
Volume 20, Number 4, November 2007
- Yehuda Afek, Eli Gafni, Adam Morrison:
Common2 extended to stacks and unbounded concurrency. 239-252 - Amos Korman, Shay Kutten:
Distributed verification of minimum spanning trees. 253-266 - Ayalvadi J. Ganesh, Anne-Marie Kermarrec, Erwan Le Merrer, Laurent Massoulié:
Peer counting and sampling in overlay networks based on random walks. 267-278 - Dana Angluin, James Aspnes, David Eisenstat, Eric Ruppert:
The computational power of population protocols. 279-304
Volume 20, Number 5, February 2008
- Tal Mizrahi, Yoram Moses:
Continuous consensus via common knowledge. 305-321 - Edya Ladan-Mozes, Nir Shavit:
An optimistic approach to lock-free FIFO queues. 323-341 - Rachid Guerraoui, Petr Kouznetsov:
Failure detectors as type boosters. 343-358 - Bojian Xu, Srikanta Tirthapura, Costas Busch:
Sketching asynchronous data streams over sliding windows. 359-374 - Shlomi Dolev, Ronen I. Kat:
HyperTree for self-stabilizing peer-to-peer systems. 375-388
Volume 20, Number 6, April 2008
- Shlomi Dolev, Alexander A. Shvartsman:
Introduction to special issue dedicated to the DISC 20th anniversary. 389-390 - Maleq Khan, Gopal Pandurangan:
A fast distributed approximation algorithm for minimum spanning trees. 391-402 - Michael Okun, Amnon Barak, Eli Gafni:
Renaming in synchronous message passing systems with Byzantine failures. 403-413 - Rachid Guerraoui, Michal Kapalka, Petr Kouznetsov:
The weakest failure detectors to boost obstruction-freedom. 415-433 - Piotr Zielinski:
Low-latency atomic broadcast in the presence of contention. 435-450
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-02 23:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
