17. DISC 2003: Sorrento, Italy

• Michael Merritt, Gadi Taubenfeld:
  Resilient Consensus for Infinitely Many Processes. 1-15
  Electronic Edition (link) BibTeX
• Marcos Kawazoe Aguilera, Burkhard Englert, Eli Gafni:
  Uniform Solvability with a Finite Number of MWMR Registers. 16-29
  Electronic Edition (link) BibTeX
• Yong-Jik Kim, James H. Anderson:
  Timing-Based Mutual Exclusion with Local Spinning. 30-44
  Electronic Edition (link) BibTeX
• Victor Luchangco, Mark Moir, Nir Shavit:
  On the Uncontended Complexity of Consensus. 45-59
  Electronic Edition (link) BibTeX
• Ittai Abraham, Dahlia Malkhi:
  Probabilistic Quorums for Dynamic Systems. 60-74
  Electronic Edition (link) BibTeX
• Rui Fan, Nancy A. Lynch:
  Efficient Replication of Large Data Objects. 75-91
  Electronic Edition (link) BibTeX
• Roman Vitenberg, Roy Friedman:
  On the Locality of Consistency Conditions. 92-105
  Electronic Edition (link) BibTeX
• Cheng Shao, Evelyn Pierce, Jennifer L. Welch:
  Multi-writer Consistency Conditions for Shared Memory Objects. 106-120
  Electronic Edition (link) BibTeX
• Josef Widder:
  Booting clock Synchronization in Partially Synchronous Systems. 121-135
  Electronic Edition (link) BibTeX
• Yoah Bar-David, Gadi Taubenfeld:
  Automatic Discovery of Mutual Exclusion Algorithms. 136-150
  Electronic Edition (link) BibTeX
• Paul C. Attie:
  On the Implementation Complexity of Specifications of Concurrent Programs. 151-165
  Electronic Edition (link) BibTeX
• Nir Andelman, Yishay Mansour:
  Competitive Management of Non-preemptive Queues with Multiple Values. 166-180
  Electronic Edition (link) BibTeX
• Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu:
  Constructing Disjoint Paths for Secure Communication. 181-195
  Electronic Edition (link) BibTeX
• Kazuo Iwama, Masaki Okita:
  Compact Routing for Flat Networks. 196-210
  Electronic Edition (link) BibTeX
• Pierre Fraigniaud, Cyril Gavoille:
  Lower Bounds for Oblivious Single-Packet End-to-End Communication. 211-223
  Electronic Edition (link) BibTeX
• Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman:
  Efficient Gossip and Robust Distributed Computation. 224-238
  Electronic Edition (link) BibTeX
• Yoav Zibin:
  Condition-Based Consensus in Synchronous Systems. 239-248
  Electronic Edition (link) BibTeX
• Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal:
  Using Conditions to Expedite Consensus in Synchronous Distributed Systems. 249-263
  Electronic Edition (link) BibTeX
• Partha Dutta, Rachid Guerraoui, Bastian Pochon:
  Tight Bounds on Early Local Decisions in Uniform Consensus. 264-278
  Electronic Edition (link) BibTeX
• Maurice Herlihy, Lucia Draque Penso:
  Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors. 279-291
  Electronic Edition (link) BibTeX
• Rachid Guerraoui, Petr Kouznetsov:
  On Failure Detectors and Type Boosters. 292-305
  Electronic Edition (link) BibTeX
• Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman, Jennifer L. Welch:
  GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks. 306-320
  Electronic Edition (link) BibTeX
• Kirsten Hildrum, John Kubiatowicz:
  Asymptotically Efficient Approaches to Fault-Tolerance in Peer-to-Peer Networks. 321-336
  Electronic Edition (link) BibTeX
• Qixiang Sun, Neil Daswani, Hector Garcia-Molina:
  Maximizing Remote Work in Flooding-Based Peer-to-Peer Systems. 337-351
  Electronic Edition (link) BibTeX
• Haifeng Yu:
  Overcoming the Majority Barrier in Large-Scale Systems. 352-366
  Electronic Edition (link) BibTeX