Archives
1985-2007

21st International Symposium on Distributed Computing

LEMESOS, CYPRUS, SEPTEMBER 24 - 26, 2007

The proceedings of the conference is edited by
Andrzej Pelc
In: Lecture Notes in Computer Science Vol. 4731/2007, Springer-Verlag Heidelberg, 2007,
ISBN 978-3-540-75141-0.

List of papers:

Invited Talks

• Burkhard Monien and Karsten Tiemann : Routing and Scheduling with Incomplete Information,
  pages 1-2.
• David Peleg : Time-Efficient Broadcasting in Radio Networks,
  pages 3-4.

Accepted Papers

• Raynal Michel : A Subjective Visit to Selected Topics in Distributed Computing,
  pages 5-6.
• Amitanand S. Aiyer and Lorenzo Alvisi and Rida A. Bazzi : Bounded Wait-Free Implementation of Optimally Resilient Byzantine Storage Without (Unproven) Cryptographic Assumptions,
  pages 7-19.
• Dana Angluin and James Aspnes and David Eisenstat : A Simple Population Protocol for Fast Robust Approximate Majority,
  pages 20-32.
• Baruch Awerbuch and Christian Scheideler : A Denial-of-Service Resistant DHT,
  pages 33-47.
• Roberto Baldoni and Kleoni Ioannidou and Alessia Milani : Mobility Versus the Cost of Geocasting in Mobile Ad-Hoc Networks,
  pages 48-62.
• Joffroy Beauquier and Julien Clement and Stéphane Messika and Laurent Rosaz and Brigitte Rozoy : Self-stabilizing Counting in Mobile Sensor Networks with a Base Station,
  pages 63-76.
• Edward Bortnikov and Israel Cidon and Idit Keidar : Scalable Load-Distance Balancing,
  pages 77-91.
• Janna Burman and Shay Kutten : Time Optimal Asynchronous Self-stabilizing Spanning Tree,
  pages 92-107.
• Jérémie Chalopin and Shantanu Das and Nicola Santoro : Rendezvous of Mobile Agents in Unknown Graphs with Faulty Links,
  pages 108-122.
• Wei Chen and Jialin Zhang and Xuezheng Liu : Weakening Failure Detectors for k -Set Agreement Via the Partition Approach,
  pages 123-138.
• Gregory Chockler and Rachid Guerraoui and Idit Keidar : Amnesic Distributed Storage,
  pages 139-151.
• Andrzej Czygrinow and Michal Hanckowiak : Distributed Approximations for Packing in Unit-Disk Graphs,
  pages 152-164.
• Carole Delporte-Gallet and Hugues Fauconnier and Felix C. Freiling and Lucia Draque Penso and Andreas Tielmann : From Crash-Stop to Permanent Omission: Automatic Transformation and Weakest Failure Detectors,
  pages 165-178.
• Bilel Derbel and Cyril Gavoille and David Peleg : Deterministic Distributed Construction of Linear Stretch Spanners in Polylogarithmic Time,
  pages 179-192.
• Danny Dolev and Ezra N. Hoc : On Self-stabilizing Synchronous Actions Despite Byzantine Attacks,
  pages 193-207.
• Shlomi Dolev and Seth Gilbert and Rachid Guerraoui and Calvin C. Newport : Gossiping in a Multi-channel Radio Network,
  pages 208-222.
• Faith Ellen and Panagiota Fatourou and Eric Ruppert : The Space Complexity of Unbounded Timestamps,
  pages 223-237.
• Simon Fischer and Lars Olbrich and Berthold Vöcking : Approximating Wardrop Equilibria with Finitely Many Agents,
  pages 238-252.
• Leszek Gasieniec and Erez Kantor and Dariusz R. Kowalski and David Peleg and Chang Su : Energy and Time Efficient Broadcasting in Known Topology Radio Networks,
  pages 253-267.
• Beat Gfeller and Nicola Santoro and Peter Widmayer : A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree,
  pages 268-282.
• Seth Gilbert and Rachid Guerraoui and Dariusz R. Kowalski : On the Message Complexity of Indulgent Consensus,
  pages 283-297.
• Taisuke Izumi and Yoshiaki Katayama and Nobuhiro Inuzuka and Koichi Wada : Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result,
  pages 298-312.
• Amos Korman and David Peleg : Compact Separator Decompositions in Dynamic Trees and Applications to Labeling Schemes,
  pages 313-327.
• Dariusz R. Kowalski and Michal Strojnowski : On the Communication Surplus Incurred by Faulty Processors,
  pages 328-342.
• Shay Kutten and Toshimitsu Masuzawa : Output Stability Versus Time Till Output,
  pages 343-357.
• Matthew Lang and Paolo A. G. Sivilotti : A Distributed Maximal Scheduler for Strong Fairness,
  pages 358-372.
• Shuang Liang and Ke Chen and Song Jiang and Xiaodong Zhang : Cost-Aware Caching Algorithms for Distributed Storage Servers,
  pages 373-387.
• Thomas Locher and Remo Meier and Stefan Schmid and Roger Wattenhofer : Push-to-Pull Peer-to-Peer Live Streaming,
  pages 388-402.
• Michael G. Merideth and Michael K. Reiter : Probabilistic Opaque Quorum Systems,
  pages 403-419.
• Vinit A. Ogale and Vijay K. Garg : Detecting Temporal Logic Predicates on Distributed Computations,
  pages 420-434.
• Mordechai Shalom and Prudence W. H. Wong and Shmuel Zaks : Optimal On-Line Colorings for Minimizing the Number of ADMs in Optical Networks,
  pages 435-449.
• Gadi Taubenfeld : Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms,
  pages 450-464.
• Piotr Zielinski : Automatic Classification of Eventual Failure Detectors,
  pages 465-479.

Brief Anouncements

• Alysson Neves Bessani and Miguel Correia and Henrique Moniz and Nuno Ferreira Neves and Paulo Veríssimo : When 3f+1 Is Not Enough: Tradeoffs for Decentralized Asynchronous Byzantine Consensus,
  pages 480-481.
• Cyril Gavoille and Ralf Klasing and Adrian Kosowski and Alfredo Navarra : On the Complexity of Distributed Greedy Coloring,
  pages 482-484.
• Colette Johnen and Lisa Higham : Fault-Tolerant Implementations of the Atomic-State Communication Model in Weaker Networks,
  pages 485-487.
• Virendra J. Marathe and Michael F. Spear and Michael L. Scott : Transaction Safe Nonblocking Data Structures,
  pages 488-489.
• Tal Mizrahi and Yoram Moses : Long Live Continuous Consensus,
  pages 490-491.
• Damon Mosk-Aoyama and Tim Roughgarden and Devavrat Shah : Fully Distributed Algorithms for Convex Optimization Problems,
  pages 492-493.
• Michael Okun : On the Power of Impersonation Attacks,
  pages 494-495.
• Arpita Patra and Ashish Choudhary and Kannan Srinathan and C. Pandu Rangan : Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary,
  pages 496-498.
• Rodrigo Schmidt and Fernando Pedone : A Formal Analysis of the Deferred Update Technique,
  pages 499-500.

Winner of Best Student Paper Award

• Dana Angluin and James Aspnes and David Eisenstat : A Simple Population Protocol for Fast Robust Approximate Majority,
  pages 20-32.

DISC 20th Anniversary

• Michel Raynal and Sam Toueg and Shmuel Zaks : DISC at Its 20th Anniversary (Stockholm, 2006),
  pages 501-503.
• Leslie Lamport : DISC 20th Anniversary: Invited Talk Time, Clocks, and the Ordering of My Ideas About Distributed Systems,
  pages 504-504.
• Nancy A. Lynch : ISC 20th Anniversary: Invited Talk My Early Days in Distributed Computing Theory: 1979-1982,
  pages 505-506.
• Michael O. Rabin : DISC 20th Anniversary: Invited Talk Provably Unbreakable Hyper-Encryption Using Distributed Systems,
  pages 506-508.