Archives
1985-2009

22nd International Symposium on Distributed Computing

Arcachon, France, September 22-24, 2008

The proceedings of the conference is edited by
Gadi Taubenfeld
In: Lecture Notes in Computer Science Vol. 4218/2008, Springer-Verlag Heidelberg, 2008,
ISBN 978-3-540-87778-3.

List of papers:

Accepted Papers

• Marcos Aguilera and Eli Gafni and Leslie Lamport : The Mailbox Problem,
  pages 1-15.
• Amitanand Aiyer and Lorenzo Alvisi and Rida Bazzi and Allen Clement : Matrix Signatures: From MACs to Digital Signatures in Distributed Systems,
  pages 16-31.
• Dan Alistarh and Seth Gilbert and Rachid Guerraoui and Corentin Travers : How to solve consensus in the smallest window of synchrony,
  pages 32-46.
• Jeremie Chalopin and Emmanuel Godard and Metivier Yves : Local Terminations and Distributed Computabillity in Anonymous Networks,
  pages 47-62.
• Viacheslav Chernoy and Mordechai Shalom and Shmuel Zaks : A Self-stabilizing algorithm with tight bounds for mutual exclusion on a ring,
  pages 63-77.
• Andrzej Czygrinow and Michal Hanckowiak and Wojciech Wawrzyniak : Fast distributed approximations in planar graphs,
  pages 78-92.
• Robert Danek and Wojciech Golab : Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion,
  pages 93-108.
• Carole Delporte and Hugues Fauconnier and Rachid Guerraoui and Andreas Tielmann : The Weakest Failure Detector for Message Passing Set-Agreement,
  pages 109-120.
• Bilel Derbel : Local Maps: New Insights into Mobile Agent Algorithms,
  pages 121-136.
• Stanko Dimitrov and P Krishnan and Colin Mallows and ean Meloche and Shalini Yajnik : r3: Resilient Random Regular Graphs,
  pages 137-151.
• Michael Dinitz : Online, Dynamic, and Distributed Embeddings of Approximate Ultrametrics,
  pages 152-166.
• Danny Dolev and Ezra N. Hoch : Constant-space Localized Byzantine Consensus,
  pages 167-181.
• Partha Dutta and Rachid Guerraoui and Ron Levy : Optimistic Erasure Coded Distributed Storage,
  pages 182-196.
• Mahmoud Elhaddad and Rami Melhem : On the emulation of finite-buffered OQ switches using Combined Input-Output Queuing,
  pages 197-211.
• Robert Elsaesser and Leszek Gasieniec and Thomas Sauerwald : On Radio Broadcasting in Random Geometric Graphs,
  pages 212-226.
• Paola Flocchini and David Ilcinkas and Nicola Santoro : Ping Pong in Dangerous Graphs,
  pages 227-241.
• Pierre Fraigniaud and Andrzej Pelc : Deterministic rendezvous in trees with little memory,
  pages 242-256.
• Emanuele Guido Fusco and Andrzej Pelc : Broadcasting in UDG Radio Networks with Missing and Inaccurate Information,
  pages 257-273.
• Leszek Gasieniec and Dariusz Kowalski and Andrzej Lingas and Martin Wahlen : Efficient broadcasting in known geometric radio networks with non-uniform ranges,
  pages 274-288.
• Chryssis Georgiou and Nicolas Nicolaou and Alexander Shvartsman : On the Robustness of (Semi)Fast Quorum-Based Implementations of Atomic Shared Memory,
  pages 289-304.
• Rachid Guerraoui and Thomas Henzinger and Vasu Singh : Permissiveness in Transactional Memories,
  pages 305-319.
• Phuong Ha and Philippas Tsigas and Otto Anshus : The Synchronization Power of Coalesced Memory Accesses,
  pages 320-334.
• Maurice Herlihy and Flavio Junqueira and Keith Marzullo and Lucia Draque Penso : Optimizing Threshold Protocols in Adversarial Structures,
  pages 335-349.
• Moran Tzafrir and Nir Shavit and Maurice Herlihy : Hopscotch Hashing,
  pages 350-364.
• Iyad Kanj and Ljubomir Perkovic and Ge Xia : Computing lightweight spanning subgraphs locally,
  pages 365-378.
• Goran Konjevod and Andrea Richa and Donglin Xia : Dynamic Routing and Location Services in Metrics of Low Doubling Dimension,
  pages 379-393.
• Christoph Lenzen and Roger Wattenhofer : Leveraging Linial's Locality Limit,
  pages 394-407.
• Yoram Moses and Tal Mizrahi : Continuous Consensus with Failures and Recoveries,
  pages 408-422.
• Yoram Moses and Michel Raynal : No Double Discount: Condition-based Simultaneity Yields Limited Gain,
  pages 423-437.
• Yee Jiun Song and Robbert van Renesse : Bosco: One-Step Byzantine Asynchronous Consensus,
  pages 438-450.
• Aaron Sterling : A Limit to the Power of Multiple Nucleation in Self-Assembly,
  pages 451-465.
• Alireza Vahdatpour and Foad Dabiri and Maryam Moazeni and Majid Sarrafzadeh : Theoretical Bound and Practical Analysis of Minimum Connected Dominating Set in Ad Hoc and Sensor Networks,
  pages 466-480.
• Tatsuhiro Tsuchiya and Andre Schiper : Using Bounded Model Checking to Verify Consensus Algorithms,
  pages 481-495.

Brief Anouncements

• Roberto Baldoni and François Bonnet and Alessia Milani and Michel Raynal : On the Solvability of Anonymous Partial Grids Exploration,
  pages 496-497.
• Ioannis Chatzigiannakis and Paul Spirakis : The Dynamics of Probabilistic Population Protocols,
  pages 498-499.
• David Coudert and Florian Huc and Dorian Mazauric : A distributed algorithm for computing and updating the process number of a forest,
  pages 500-501.
• Shlomi Dolev and Nir Tzachar : Corruption Resistant Local Codes,
  pages 502-503.
• Antonio Fernandez and Miguel Mosteiro and Christopher Thraves : An Early-stopping Protocol for Computing Aggregate Functions in Sensor Networks,
  pages 504-506.
• Felix Freiling and Christian Lambertz and Mila Majster-Cederbaum : Easy Consensus Algorithms for the Crash-Recovery Model,
  pages 507-508.
• Anne-Marie Kermarrec and Erwan Le Merrer and Bruno Sericola and Gilles Tredan : Evaluating the quality of a network topology through random walks,
  pages 509-511.
• Hyonho Lee and Robert Danek : Local-Spin Algorithms for Abortable Mutual Exclusion and Related Problems,
  pages 512-513.
• Simona Orzan and Mohammad Torabi Dashti : Data failures,
  pages 514-515.
• Guang Tan and Marin Bertier and Anne-Marie Kermarrec : Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network,
  pages 516-517.
• Sara Tucci-Piergiovanni and Roberto Baldoni : Eventual Leader Election in the Infinite Arrival Message-passing System Model,
  pages 518-520.

Winner of Best Paper Award

• Robert Danek and Wojciech Golab : Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion,
  pages 93-108.

Winner of Best Student Paper Award

• Andrzej Czygrinow and Michal Hanckowiak and Wojciech Wawrzyniak : Fast distributed approximations in planar graphs,
  pages 78-92.