19. DISC 2005: Cracow, Poland

Invited Papers

• Michael Mitzenmacher:
  Digital Fountains and Their Application to Informed Content Delivery over Adaptive Overlay Networks. 1
  
• Amir Herzberg:
  Securing the Net: Challenges, Failures and Directions. 2
  

Regular Papers

• Flavio Paiva Junqueira, Keith Marzullo:
  Coterie Availability in Sites. 3-17
  
• Gal Badishi, Amir Herzberg, Idit Keidar:
  Keeping Denial-of-Service Attackers in the Dark. 18-32
  
• Hagen Völzer:
  On Conspiracies and Hyperfairness in Distributed Computing. 33-47
  
• Amitanand S. Aiyer, Lorenzo Alvisi, Rida A. Bazzi:
  On the Availability of Non-strict Quorum Systems. 48-62
  
• Eli Gafni, Sergio Rajsbaum:
  Musical Benches. 63-77
  
• Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit:
  Obstruction-Free Algorithms Can Be Practically Wait-Free. 78-92
  
• 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
  
• Chris Purcell, Tim Harris:
  Non-blocking Hashtables with Open Addressing. 108-121
  
• Hagit Attiya, Rachid Guerraoui, Petr Kouznetsov:
  Computing with Reads and Writes in the Absence of Step Contention. 122-136
  
• Matei David, Alex Brodsky, Faith Ellen Fich:
  Restricted Stack Implementations. 137-151
  
• Gregory Chockler, Nancy A. Lynch, Sayan Mitra, Joshua A. Tauber:
  Proving Atomicity: An Assertional Approach. 152-168
  
• Hagit Attiya, Danny Hendler:
  Time and Space Lower Bounds for Implementations Using k-CAS. 169-183
  
• Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui:
  (Almost) All Objects Are Universal in Message Passing Systems. 184-198
  
• Dahlia Malkhi, Florian Oprea, Lidong Zhou:
  Omega Meets Paxos: Leader Election and Stability Without Eventual Timely Links. 199-213
  
• Brad T. Moore, Paolo A. G. Sivilotti:
  Plausible Clocks with Bounded Inaccuracy. 214-228
  
• Kai Engelhardt, Yoram Moses:
  Causing Communication Closure: Safe Program Composition with Non-FIFO Channels. 229-243
  
• Rachid Guerraoui, Eric Ruppert:
  What Can Be Implemented Anonymously? 244-259
  
• Andrzej Pelc:
  Waking Up Anonymous Ad Hoc Radio Networks. 260-272
  
• Fabian Kuhn, Thomas Moscibroda, Tim Nieberg, Roger Wattenhofer:
  Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. 273-287
  
• Shafi Goldwasser, Madhu Sudan, Vinod Vaikuntanathan:
  Distributed Computing with Imperfect Randomness. 288-302
  
• Rachid Guerraoui, Maurice Herlihy, Bastian Pochon:
  Polymorphic Contention Management. 303-323
  
• Maurice Herlihy, Ye Sun:
  Distributed Transactional Memory for Metric-Space Networks. 324-338
  
• Dahlia Malkhi, Douglas B. Terry:
  Concise Version Vectors in WinFS. 339-353
  
• Virendra J. Marathe, William N. Scherer III, Michael L. Scott:
  Adaptive Software Transactional Memory. 354-368
  
• Piotr Zielinski:
  Optimistic Generic Broadcast. 369-383
  
• Yehuda Afek, Yaron De Levie:
  Space and Step Complexity Efficient Adaptive Collect. 384-398
  
• Joffroy Beauquier, Laurence Pilard, Brigitte Rozoy:
  Observing Locally Self-stabilization in a Probabilistic Way. 399-413
  
• Michele Flammini, Luca Moscardelli, Alfredo Navarra, Stéphane Pérennes:
  Asymptotically Optimal Solutions for Small World Graphs. 414-428
  
• Maria J. Blesa:
  Deciding Stability in Packet-Switched FIFO Networks Under the Adversarial Queuing Model in Polynomial Time ^, . 429-441
  
• Ittai Abraham, Cyril Gavoille, Dahlia Malkhi:
  Compact Routing for Graphs Excluding a Fixed Minor. 442-456
  
• Amos Korman:
  General Compact Labeling Schemes for Dynamic Trees. 457-471
  
• Uri Nadav, Moni Naor:
  The Dynamic And-Or Quorum System. 472-486
  

Brief Announcements

• Barbara Liskov, Rodrigo Rodrigues:
  Byzantine Clients Rendered Harmless. 487-489
  
• Antonio Fernández, Chryssis Georgiou, Luis López, Agustín Santos:
  Reliably Executing Tasks in the Presence of Malicious Processors. 490-492
  
• Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit:
  Obstruction-Free Step Complexity: Lock-Free DCAS as an Example. 493-494
  
• Mikel Larrea, Alberto Lafuente:
  Communication-Efficient Implementation of Failure Detector Classes and. 495-496
  
• Christian Cachin, Stefano Tessaro:
  Optimal Resilience for Erasure-Coded Byzantine Distributed Storage. 497-498
  
• Michael Okun:
  Agreement Among Unacquainted Byzantine Generals. 499-500
  
• Yuanyuan Zhao, Sumeer Bhola, Daniel C. Sturman:
  Subscription Propagation and Content-Based Routing with Delivery Guarantees. 501-502
  
• Christian Cachin, Stefano Tessaro:
  Asynchronous Verifiable Information Dispersal. 503-504
  
• Emmanuelle Anceaume, Xavier Défago, Maria Gradinariu, Matthieu Roy:
  Towards a Theory of Self-organization. 505-506
  
• Zvi Lotker, Boaz Patt-Shamir, Mark R. Tuttle:
  Timing Games and Shared Memory. 507-508
  
• Yu-Chen Kuo, Huang-Chen Lee:
  A Lightweight Group Mutual k-Exclusion Algorithm Using Bi-k-Arbiters. 509-510
  
• Philippe Duchon, Nicolas Hanusse, Emmanuelle Lebhar, Nicolas Schabanel:
  Could any Graph be Turned into a Small-World?. 511-513
  
• Ittai Abraham, Dahlia Malkhi, Gurmeet Singh Manku:
  Papillon: Greedy Routing in Rings. 514-515
  
• Burkhard Englert:
  An Efficient Long-Lived Adaptive Collect Algorithm. 516-518
  

Last update Thu May 23 18:07:55 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page