List of accepted papers

The following papers, listed alphabetically by first author, have been accepted for presentation at DISC 2003.

REGULAR PAPERS

  1. Probabilistic Quorums for Dynamic Systems
    Ittai Abraham, Dahlia Malkhi
  2. Uniform Solvability with a Finite Number of MWMR Registers
    Marcos Aguilera, Burkhard Englert, Eli Gafni
  3. Competitive Management of Non-Preemptive Queues with Multiple Values
    Nir Andelman, Yishay Mansour
  4. On the Implementation Complexity of Specifications of Concurrent Programs
    Paul Attie
  5. Constructing Disjoint Paths for Secure Communication
    Amitabha Bagchi, Amitabh Chaudhary, Michael T. Goodrich, Shouhuai Xu
  6. Automatic Discovery of Mutual Exclusion Algorithms
    Yoah Bar-David, Gadi Taubenfeld
  7. GeoQuorums: Implementing Atomic Memory in Ad Hoc Networks
    Shlomi Dolev, Seth Gilbert, Nancy Lynch, Alex Shvartsman, Jennifer Welch
  8. Tight Lower Bounds on Early Local Decisions in Uniform Consensus
    Partha Dutta, Rachid Guerraoui, Bastian Pochon
  9. Efficient Replication of Large Data Objects
    Rui Fan, Nancy Lynch
  10. Lower Bounds for Oblivious Single-Message End-to-End Communication
    Pierre Fraigniaud, Cyril Gavoille
  11. Efficient Gossip and Robust Distributed Computation
    Chryssis Georgiou, Dariusz Kowalski, Alex Shvartsman
  12. On Failure Detectors and Type Boosters
    Rachid Guerraoui, Petr Kouznetsov
  13. Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors
    Maurice Herlihy, Lucia Penso
  14. Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks
    Kirsten Hildrum
  15. Compact Routing for Flat Networks
    Kazuo Iwama, Masaki Okita
  16. Timing-based Mutual Exclusion with Local Spinning
    Yong-Jik Kim, James Anderson
  17. On the Uncontended Complexity of Consensus
    Victor Luchangco, Mark Moir, Nir Shavit
  18. Resilient Consensus for Infinitely Many Processes
    Michael Merritt, Gadi Taubenfeld
  19. Using Conditions to Expedite Consensus in Synchronous Distributed Systems
    Achour Mostefaoui, Sergio Rajsbaum, Michel Raynal
  20. Multi-Writer Consistency Conditions for Shared Memory Objects
    Cheng Shao, Evelyn Pierce, Jennifer Welch
  21. Maximizing Remote Work in Flooding-based Peer-to-Peer Systems
    Qixiang Sun, Neil Daswani, Hector Garcia-Molina
  22. On the Locality of Consistency Conditions
    Roman Vitenberg, Roy Friedman
  23. Booting Clock Synchronization in Partially Synchronous Systems
    Josef Widder
  24. Overcoming the Majority Barrier in Large-Scale Systems
    Haifeng Yu
  25. Condition-based Consensus in Synchronous Systems
    Yoav Zibin

BRIEF ANNOUNCEMENTS

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