Skip to main content
  • Conference proceedings
  • © 2005

Distributed Computing

19th International Conference, DISC 2005, Cracow, Poland, September 26-29, 2005, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3724)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): DISC: International Symposium on Distributed Computing

Conference proceedings info: DISC 2005.

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, access via your institution.

Table of contents (48 papers)

  1. Front Matter

  2. Regular Papers

    1. Coterie Availability in Sites

      • Flavio Junqueira, Keith Marzullo
      Pages 3-17
    2. Keeping Denial-of-Service Attackers in the Dark

      • Gal Badishi, Amir Herzberg, Idit Keidar
      Pages 18-32
    3. On the Availability of Non-strict Quorum Systems

      • Amitanand Aiyer, Lorenzo Alvisi, Rida A. Bazzi
      Pages 48-62
    4. Musical Benches

      • Eli Gafni, Sergio Rajsbaum
      Pages 63-77
    5. Obstruction-Free Algorithms Can Be Practically Wait-Free

      • Faith Ellen Fich, Victor Luchangco, Mark Moir, Nir Shavit
      Pages 78-92
    6. Efficient Reduction for Wait-Free Termination Detection in a Crash-Prone Distributed System

      • Neeraj Mittal, Felix C. Freiling, S. Venkatesan, Lucia Draque Penso
      Pages 93-107
    7. Non-blocking Hashtables with Open Addressing

      • Chris Purcell, Tim Harris
      Pages 108-121
    8. Computing with Reads and Writes in the Absence of Step Contention

      • Hagit Attiya, Rachid Guerraoui, Petr Kouznetsov
      Pages 122-136
    9. Restricted Stack Implementations

      • Matei David, Alex Brodsky, Faith Ellen Fich
      Pages 137-151
    10. Proving Atomicity: An Assertional Approach

      • Gregory Chockler, Nancy Lynch, Sayan Mitra, Joshua Tauber
      Pages 152-168
    11. Time and Space Lower Bounds for Implementations Using k-CAS

      • Hagit Attiya, Danny Hendler
      Pages 169-183
    12. (Almost) All Objects Are Universal in Message Passing Systems

      • Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui
      Pages 184-198
    13. Ω Meets Paxos: Leader Election and Stability Without Eventual Timely Links

      • Dahlia Malkhi, Florin Oprea, Lidong Zhou
      Pages 199-213
    14. Plausible Clocks with Bounded Inaccuracy

      • Brad T. Moore, Paolo A. G. Sivilotti
      Pages 214-228
    15. What Can Be Implemented Anonymously?

      • Rachid Guerraoui, Eric Ruppert
      Pages 244-259

Other Volumes

  1. Distributed Computing

Keywords

  • Byzantine processes
  • Routing
  • Switch
  • ad-hoc networks
  • algorithm
  • algorithms
  • broadcasting
  • complexity
  • concurrent programming
  • distributed algorithms
  • distributed applications
  • distributed computing
  • distributed objects
  • distributed systems
  • graph algorithms
  • algorithm analysis and problem complexity

Editors and Affiliations

  • CNRS and University Paris Diderot,  

    Pierre Fraigniaud

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access