Wednesday, October 1st

08:00 - 09:00: Registration

09:00 - 10:00: Invited Talk - David Culler

PlanetLab: a worldwide testbed for distributed computing

10:00 - 10:30: Coffee break

10:30 - 12:10 Session 1 (Chair: TBA)

• Resilient Consensus for Infinitely Many Processes
  M. Merritt, G. Taubenfeld
• Uniform Solvability with a Finite Number of MWMR Registers
  M. Aguilera, B. Englert, A. Gafni
• Timing-based Mutual Exclusion with Local Spinning
  Y. Kim, J. Anderson
• On the Uncontended Complexity of Consensus
  V, Luchangco, M. Moir, N. Shavit

12:10 - 14:10 Lunch

14:10 - 15:50 Session 2 (Chair: TBA)

• Probabilistic Quorums for Dynamic Systems
  I. Abraham, D. Malkhi
• Efficient Replication of Large Data Objects
  R. Fan, N. Lynch
• On the Locality of Consistency Conditions
  R. Vitenberg, R. Friedman
• Multi-Writer Consistency Conditions for Shared Memory Objects
  C. Saho, E. Pierce, J. Welch

15:50 - 16:20: Coffee Break

16:20 - 17:45 Session 3 (Chair: TBA)

• (BA) On the Accuracy and Efficiency of Ecternal Clock Estimation
  D. Tulone
• Booting Clock Synchronization in Partially Synchronous Systems
  J. Widder
• Automatic Discovery of Mutual Exclusion Algorithms
  Y. Bar-David, G. Taubenfeld
• On the Implementation Complexity of Specifications of Concurrent Programs
  P. Attie

17:45 - 18:45: Business Meeting

19:30 - 21:00: Banquet

Thursday, October 2nd

09:00 - 10:15 Session 4 (Chair: TBA)

• Competitive Management of Non-Preemptive Queues with Multiple Values
  N. Andelman, V. Mansour
• Constructing Disjoint Paths for Secure Communication
  A. Bagchi, A. Chaudhary, M. T. Goodrich, S. Xu
• Compact Routing for Flat Networks
  K. Iwama, M. Okita

10:15 - 10:45: Coffee break

10:45 - 11:45 Session 5 (Chair: TBA)

• Lower Bounds for Oblivious Single-Message End-to-End Communication
  P. Fraigniaud, C. Gavoille
• Efficient Gossip and Robust Distributed Computation
  C. Georgiou, D. Kowalski, A. Sharvtsman
• (BA) Broadcast using Rendezvous
  P. Duchon, N. Hanusse, N. Saheb, A. Zemmari

11:45 - 13:15: Lunch

13:15 - 14:45: WORKSHOP ON ADAPTIVE DISTRIBUTED SYSTEMS

• Self-Stabilizing Autonomic Recoverer for Eventual Byzantine Software
  O. Brukman, S. Dolev, E. K. Kolodner
• Heterogeneity-Aware Peer-to-peer Multicast
  R. van Renesse, K. Birman, A. Bozdog, D. Dumitriu, M. Singh, W. Vogels
• OpenPING: A Refelctive Middleware Platform for construction of Adaptive Virtual Reality Applications
  P. Okanda, G. Blair, N. Parlavantzas
• Two-ways Adaptive Failure Detection with the PHI-Failure Detector
  N. Hayashibara, X. Defago, T. Katayama

15:00 - 20:00: Excursion to the Ruins of Pompei

Friday, October 3rd

09:00 - 10:00: Invited Talk - Maurice Herlihy

The Transactional Manifesto: Toward a Low-Level API for Scalable Synchronization

10:00 - 10:30: Coffee Break

10:30 - 12:10 Session 6 (Chair: TBA)

• Joint talk:
  • Condition-based Consensus in Synchronous Systems
    Y. Zibin
  • Using Conditions to Expedite Consensus in Synchronous Distributed Systems
    A. Mostefaoui, S. Rajsbaum, M. Raynal
• Tight Lower Bounds on Early Local Decisions in Uniform Consensus
  P. Dutta, R. Guerraoui, B. Pochon
• Tight Bounds for k-Set Agreement with Limited-Scope Failure Detectors
  M. Herlihy, L. Penso
• On Failure Detectors and Type Boosters
  R. Guerraoui, P. Kouznetsov

12:10 - 14:00: Lunch

14:10 - 16:10 Session 7 (Chair: TBA)

• GeoQuorums: Implementing Atomic Memory in Ad Hoc Networks
  S. Dolev, S. Gilbert, N. Lynch, A. Shvartsman, J. Welch
• Asymptotically efficient approaches to fault-tolerance in peer-to-peer networks
  K. Hildrum, J. Kubiatowicz
• Maximizing Remote Work in Flooding-based Peer-to-Peer Systems
  Q. Sun, N. Deswani, H. Garcia-Molina
• Overcoming the Majority Barrier in Large-Scale Systems
  H. Yu
• (BA) Self-organizing Systems Case Study: peer-to-peer networks
  E. Anceaume, M. Gradinariu, M. Roy
• (BA) The Hyperring: A Low-Congestion Deterministic Data Structure for Distributed Environments
  B. Awerbuch, C. Scheideler

16:10 - 16:15: Closing Remarks

16:15 - 16:55: Coffee Break