Here is the booklet program.

  • December 12, Tuesday 2006
    • 8:30-9:30 Welcome

    • Session 1, Alex Shvartsman, Session Chair
    • 9:30-10:30 Invited talk: Lazy and Speculative Execution in Computer Systems, Butler Lampson
    • 10:30-10:50 coffee break

    • Session 2, Michael Fischer, Session Chair
    • 10:50-11:15 Mobile agent algorithms versus message passing algorithms, Jeremie Chalopin, Emmanuel Godard, Yves Metivier, and Rodrigue Ossamy
    • 11:15-11:40 Incremental Construction of k-Dominating Sets in Wireless Sensor Networks, Mathieu Couture, Michel Barbeau, Prosenjit Bose, and Evangelos Kranakis
    • 11:40-12:05 Of malicious motes and suspicious sensors: on the efficiency of malicious interference in wireless networks, Seth Gilbert, Rachid Guerraoui, and Calvin Newport
    • 12:05-13:20 Lunch

    • Session 3, Nir Shavit, Session Chair
    • 13:20-13:45 A Topological Treatment of Early-deciding Set Agreement, Rachid Guerraoui, Maurice Herlihy, and Bastian Pochon
    • 13:45-14:10 Renaming with k-Set-Consensus: An Optimal Algorithm into n+k-1 Slots, Eli Gafni
    • 14:10-14:35 When Consensus Meets Self-Stabilization, Shlomi Dolev, Ronen I. Kat, and Elad M. Schiller
    • 14:35-15:00 On the Cost of Uniform Protocols whose Memory Consumption is Adaptive to Interval Contention, Burkhard Englert
    • 15:00-15:20 coffee break

    • Session 4, Eli Gafni, Session Chair
    • 15:20-15:45 Optimistic Algorithms for Partial Database Replication, Nicolas Schiper, Rodrigo Schmidt, and Fernando Pedone
    • 15:45-16:10 Optimal clock synchronization revisited: Upper and lower bounds in real-time systems, Heinrich Moser and Ulrich Schmid
    • 16:10-16:35 Distributed Priority Inheritance for Real-Time and Embedded Systems, Cesar Sanchez, Henny B. Sipma, Christopher D. Gill, and Zohar Manna
    • Session 5, Rachid Guerraoui, Session Chair
    • 16:35-17:00 Safe Termination Detection in an Asynchronous Distributed System when Processes may Crash and Recover, Neeraj Mittal, Kuppahalli L. Phaneesh, and Felix C. Freiling
    • 17:00-17:25 Lock-free Dynamically Resizable Arrays, Damian Dechev, Peter Pirkelbauer, and Bjarne Stroustrup
    • 17:25-17:50 Computing on a Partially Eponymous Ring, Marios Mavronicolas, Loizos Michael, and Paul Spirakis
  • December 13, Wednesday 2006

      Session 6, Ivan Lavalee, Session Chair
    • 8:30-8:55 Distributed Spanner Construction in Doubling Metric Spaces, Mirela Damian, Saurav Pandit, and Sriram Pemmaraju
    • 8:55-9:50 Invited talk: Looking for the weakest failure detector for wait-free set agreement, Michel Raynal and Corentin Travers
    • 9:50-10:20 Verification Techniques for Distributed Algorithms, Anna Philippou and George Michael
    • 10:20-10:40 coffee break
    • 10:40-11:40 Invited talk: Gerard Roucairol
    • 11:50-13:30 Lunch

    • Session 7, Michel Raynal, Session Chair
    • 13:30-13:55 Empire of Colonies, Shlomi Dolev and Nir Tzachar
    • 13:55-14:15 Glance: A Lightweight Querying Service for Wireless Sensor Networks, Murat Demirbas, Anish Arora, and Vinod Kulathumani
    • 14:20-14:45 On Many-to-Many Communication in Packet Radio Networks, Bogdan S. Chlebus, Dariusz R. Kowalski, and Tomasz Radzik
    • 14:45-15:10 Robust Random Number Generation for Peer-to-Peer Systems, Baruch Awerbuch and Christian Scheideler
    • 15:10-15:30 coffee break

    • Session 8, Burkhard Englert, Session Chair
    • 15:30-15:55 Lifespan of Peer to Peer Networks: models and insight,
      Rudi Cilibrasi, Zvi Lotker, Alfredo Navarra, Stephane Perennes, and Paul Vitanyi
    • 15:55-16:20 Incentive-based Robust Reputation Mechanism for P2P Services, Emmanuelle Anceaume and Aina Ravoaja
    • 16:20-16:45 Gathering few fat mobile robots in the plane, Jurek Czyzowicz, Leszek Gasieniec, and Andrzej Pelc

    • Session 9, Chryssis Georgiou, Session Chair
    • 16:45-17:45 Brief Announcements:
      • Conflict Managers for Self-Stabilization without Fairness Assumptions M.Gradinariu and S.Tixeuil
      • A Provably Correct Scalable Concurrent Skip List M.Herlihy, Y.Lev, V.Luchangco, and N.Shavit
      • An Algorithm for Distributing and Retrieving Information in Sensor Networks H.Miranda, S.Leggio, L.Rodrigues, and K.Raatikainen
  • December 14, Thursday 2006

      Session 10, Nicola Santoro, Session Chair
    • 9:00-10:00 Invited talk: Automatic Sythesis of Programs from Property Specifications Amir Pnuelli
    • 10:00-17:45 Excursion to St. Emilion
  • December 15, Friday 2006

      Session 11, Alain Bui, Session Chair
    • 8:30-8:55 Hop Chains: Secure Routing and the Establishment of Distinct Identities, Rida A. Bazzi, Young-ri Choi, and Mohamed G. Gouda
    • 8:55-9:20 Gathering Asynchronous Mobile Robots with Inaccurate Compasses, Samia Souissi, Xavier Defago, and Masafumi Yamashita
    • 9:20-9:45 Searching for black-hole faults in a network using multiple agents, Colin Cooper, Ralf Klasing, and Tomasz Radzik
    • 9:45-10:10 Self-stabilizing Leader Election in Networks of Finite-state Anonymous Agents, Michael John Fischer and Hong Jiang
    • 10:10-10:30 coffee break

    • Session 12, Alexander Shvartsman, Session Chair
    • 10:30-10:55 Robust Self-Stabilizing Clustering Algorithm, Colette Johnen and Lehuy Nguyen
    • 10:55-11:20 Self-stabilizing Wireless Connected Overlays, Vadim Drabkin, Roy Friedman, and Maria Gradinariu
    • 11:55-13:30 Lunch