19. DISC 2005:
Cracow,
Poland
Pierre Fraigniaud (Ed.):
Distributed Computing, 19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings.
Lecture Notes in Computer Science 3724 Springer 2005, ISBN 3-540-29163-6 BibTeX
Invited Papers
Regular Papers
- Flavio Paiva Junqueira, Keith Marzullo:
Coterie Availability in Sites.
3-17
Electronic Edition (link) BibTeX
- Gal Badishi, Amir Herzberg, Idit Keidar:
Keeping Denial-of-Service Attackers in the Dark.
18-32
Electronic Edition (link) BibTeX
- Hagen Völzer:
On Conspiracies and Hyperfairness in Distributed Computing.
33-47
Electronic Edition (link) BibTeX
- Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi:
On the Availability of Non-strict Quorum Systems.
48-62
Electronic Edition (link) BibTeX
- Eli Gafni, Sergio Rajsbaum:
Musical Benches.
63-77
Electronic Edition (link) BibTeX
- Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit:
Obstruction-Free Algorithms Can Be Practically Wait-Free.
78-92
Electronic Edition (link) BibTeX
- Neeraj Mittal, Felix C. Freiling, Subbarayan Venkatesan, Lucia Draque Penso:
Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System.
93-107
Electronic Edition (link) BibTeX
- Chris Purcell, Tim Harris:
Non-blocking Hashtables with Open Addressing.
108-121
Electronic Edition (link) BibTeX
- Hagit Attiya, Rachid Guerraoui, Petr Kouznetsov:
Computing with Reads and Writes in the Absence of Step Contention.
122-136
Electronic Edition (link) BibTeX
- Matei David, Alex Brodsky, Faith Ellen Fich:
Restricted Stack Implementations.
137-151
Electronic Edition (link) BibTeX
- Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Joshua A. Tauber:
Proving Atomicity: An Assertional Approach.
152-168
Electronic Edition (link) BibTeX
- Hagit Attiya, Danny Hendler:
Time and Space Lower Bounds for Implementations Using k-CAS.
169-183
Electronic Edition (link) BibTeX
- Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui:
(Almost) All Objects Are Universal in Message Passing Systems.
184-198
Electronic Edition (link) BibTeX
- Dahlia Malkhi, Florian Oprea, Lidong Zhou:
Omega Meets Paxos: Leader Election and Stability Without Eventual Timely Links.
199-213
Electronic Edition (link) BibTeX
- Brad T. Moore, Paolo A. G. Sivilotti:
Plausible Clocks with Bounded Inaccuracy.
214-228
Electronic Edition (link) BibTeX
- Kai Engelhardt, Yoram Moses:
Causing Communication Closure: Safe Program Composition with Non-FIFO Channels.
229-243
Electronic Edition (link) BibTeX
- Rachid Guerraoui, Eric Ruppert:
What Can Be Implemented Anonymously?
244-259
Electronic Edition (link) BibTeX
- Andrzej Pelc:
Waking Up Anonymous Ad Hoc Radio Networks.
260-272
Electronic Edition (link) BibTeX
- Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer:
Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs.
273-287
Electronic Edition (link) BibTeX
- Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanathan:
Distributed Computing with Imperfect Randomness.
288-302
Electronic Edition (link) BibTeX
- Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
Polymorphic Contention Management.
303-323
Electronic Edition (link) BibTeX
- Maurice Herlihy, Ye Sun:
Distributed Transactional Memory for Metric-Space Networks.
324-338
Electronic Edition (link) BibTeX
- Dahlia Malkhi, Douglas B. Terry:
Concise Version Vectors in WinFS.
339-353
Electronic Edition (link) BibTeX
- Virendra J. Marathe, William N. Scherer III, Michael L. Scott:
Adaptive Software Transactional Memory.
354-368
Electronic Edition (link) BibTeX
- Piotr Zielinski:
Optimistic Generic Broadcast.
369-383
Electronic Edition (link) BibTeX
- Yehuda Afek, Yaron De Levie:
Space and Step Complexity Efficient Adaptive Collect.
384-398
Electronic Edition (link) BibTeX
- Joffroy Beauquier, Laurence Pilard, Brigitte Rozoy:
Observing Locally Self-stabilization in a Probabilistic Way.
399-413
Electronic Edition (link) BibTeX
- Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes:
Asymptotically Optimal Solutions for Small World Graphs.
414-428
Electronic Edition (link) BibTeX
- Maria J. Blesa:
Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time , .
429-441
Electronic Edition (link) BibTeX
- Ittai Abraham, Cyril Gavoille, Dahlia Malkhi:
Compact Routing for Graphs Excluding a Fixed Minor.
442-456
Electronic Edition (link) BibTeX
- Amos Korman:
General Compact Labeling Schemes for Dynamic Trees.
457-471
Electronic Edition (link) BibTeX
- Uri Nadav, Moni Naor:
The Dynamic And-Or Quorum System.
472-486
Electronic Edition (link) BibTeX
Brief Announcements
- Barbara Liskov, Rodrigo Rodrigues:
Byzantine Clients Rendered Harmless.
487-489
Electronic Edition (link) BibTeX
- Antonio Fernández, Chryssis Georgiou, Luis López, Agustín Santos:
Reliably Executing Tasks in the Presence of Malicious Processors.
490-492
Electronic Edition (link) BibTeX
- Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit:
Obstruction-Free Step Complexity: Lock-Free DCAS as an Example.
493-494
Electronic Edition (link) BibTeX
- Mikel Larrea, Alberto Lafuente:
Communication-Efficient Implementation of Failure Detector Classes and.
495-496
Electronic Edition (link) BibTeX
- Christian Cachin, Stefano Tessaro:
Optimal Resilience for Erasure-Coded Byzantine Distributed Storage.
497-498
Electronic Edition (link) BibTeX
- Michael Okun:
Agreement Among Unacquainted Byzantine Generals.
499-500
Electronic Edition (link) BibTeX
- Yuanyuan Zhao, Sumeer Bhola, Daniel C. Sturman:
Subscription Propagation and Content-Based Routing with Delivery Guarantees.
501-502
Electronic Edition (link) BibTeX
- Christian Cachin, Stefano Tessaro:
Asynchronous Verifiable Information Dispersal.
503-504
Electronic Edition (link) BibTeX
- Emmanuelle Anceaume, Xavier Défago, Maria Gradinariu, Matthieu Roy:
Towards a Theory of Self-organization.
505-506
Electronic Edition (link) BibTeX
- Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle:
Timing Games and Shared Memory.
507-508
Electronic Edition (link) BibTeX
- Yu-Chen Kuo, Huang-Chen Lee:
A Lightweight Group Mutual k-Exclusion Algorithm Using Bi-k-Arbiters.
509-510
Electronic Edition (link) BibTeX
- Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel:
Could any Graph be Turned into a Small-World?.
511-513
Electronic Edition (link) BibTeX
- Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku:
Papillon: Greedy Routing in Rings.
514-515
Electronic Edition (link) BibTeX
- Burkhard Englert:
An Efficient Long-Lived Adaptive Collect Algorithm.
516-518
Electronic Edition (link) BibTeX
Copyright © Sat May 16 23:47:29 2009
by Michael Ley (ley@uni-trier.de)
