Archives
1985-2007

17th International Symposium on Distributed Computing

Sorrento, Italy, October 1-3, 2003

The proceedings of the conference is edited by
Faith Ellen Fich
In: Lecture Notes in Computer Science Vol. 2848/2003, Springer-Verlag Heidelberg, 2003,
ISBN 3-540-20184-X.

List of papers:

Accepted Papers

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

Brief Announcements

• Emanuelle Anceaume and Maria Gradinariu and Matthieu Roy : Self-organizing Systems Case Study: peer-to-peer networks,
  pages -.
• Baruch Awerbuch and Christian Scheideler : The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments,
  pages -.
• Philippe Duchon and Nicolas Hanusse and Nasser Saheb and Akka Zemmari : Broadcast using Rendezvous,
  pages -.
• Daniela Tulone : How accurately and efficiently can processes get the reference time?,
  pages -.

Winner of Best Student Paper Award

• Ittai Abraham and Dahlia Malkhi : Probabilistic Quorums for Dynamic Systems,
  pages 60-74.