Archives
1985-2009

23rd International Symposium on Distributed Computing

Elche/Elx, Spain, September 23-25, 2009

The proceedings of the conference is edited by
Idit Keidar
In: Lecture Notes in Computer Science Vol. 5805, Springer, 2009,
ISBN 978-3-642-04354-3.

List of papers:

Accepted Papers

• Carole Delporte-Gallet and Hugues Fauconnier and Rachid Guerraoui and Andreas Tielmann : The Disagreement Power of an Adversary,
  pages 8-21.
• Yuval Emek and Amos Korman : New Bounds for the Controller Problem,
  pages 22-34.
• Eli Gafni and Petr Kuznetsov : On Set Consensus Numbers,
  pages 35-47.
• Fabian Kuhn and Nancy A. Lynch and Calvin C. Newport : The Abstract MAC Layer,
  pages 48-62.
• Henrique Moniz and Nuno Ferreira Neves and Miguel Correia and Paulo Veríssimo : Randomization Can Be a Healer: Consensus with Dynamic Omission Failures,
  pages 63-77.
• Yehuda Afek and Nir Shavit and Moran Tzafrir : Interrupting Snapshots and the JavaTM Size() Method,
  pages 78-92.
• Pascal Felber and Vincent Gramoli and Rachid Guerraoui : Elastic Transactions,
  pages 93-107.
• Yehuda Afek and Eli Gafni and Opher Lieber : Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus,
  pages 111-126.
• Panagiota Fatourou and Nikolaos D. Kallimanis : The RedBlue Adaptive Universal Constructions,
  pages 127-141.
• Damien Imbs and Michel Raynal : Help When Needed, But No More: Efficient Read/Write Partial Snapshot,
  pages 142-156.
• Gadi Taubenfeld : Contention-Sensitive Data Structures and Algorithm,
  pages 157-171.
• Bilel Derbel and Cyril Gavoille and David Peleg and Laurent Viennot : Local Computation of Nearly Additive Spanners,
  pages 176-190.
• Matti Åstrand and Patrik Floréen and Valentin Polishchuk and Joel Rybicki and Jukka Suomela and Jara Uitto : A Local 2-Approximation Algorithm for the Vertex Cover Problem,
  pages 191-205.
• Zvika Brakerski and Boaz Patt-Shamir : Distributed Discovery of Large Near-Cliques,
  pages 206-220.
• Christos Koufogiannakis and Neal E. Young : Distributed Fractional Packing and Maximum Weighted b-Matching via Tail-Recursive Duality,
  pages 221-238.
• Cyril Gavoille and Adrian Kosowski and Marcin Markiewicz : What Can Be Observed Locally?,
  pages 243-257.
• Sotiris Kentros and Aggelos Kiayias and Nicolas C. Nicolaou and Alexander A. Shvartsman : At-Most-Once Semantics in Asynchronous Shared Memory,
  pages 258-273.
• Simon Doherty and Mark Moir : Nonblocking Algorithms and Backward Simulation,
  pages 274-288.
• Martin Hoefer and Siddharth Suri : Dynamics in Network Interaction Games,
  pages 294-308.
• Vibhor Bhatt and Prasad Jayanti : On the Existence of Weakest Failure Detectors for Mutual Exclusion and k-Exclusion,
  pages 311-325.
• Srikanth Sastry and Scott M. Pike and Jennifer L. Welch : Crash-Quiescent Failure Detection,
  pages 326-340.
• François Bonnet and Michel Raynal : The Price of Anonymity: Optimal Consensus Despite Asynchrony, Crash and Anonymity,
  pages 341-355.
• Ittai Abraham and Dahlia Malkhi and David Ratajczak : Compact Multicast Routing,
  pages 364-378.
• Wei Chen and Christian Sommer and Shang-Hua Teng and Yajun Wang : Compact Routing in Power-Law Graphs,
  pages 379-391.
• Dahlia Malkhi and Siddhartha Sen and Kunal Talwar and Renato Fonseca F. Werneck and Udi Wieder : Virtual Ring Routing Trends,
  pages 392-406.
• Lélia Blin and Maria Potop-Butucaru and Stephane Rovedakis and Sébastien Tixeuil : A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property,
  pages 407-422.
• Evangelos Bampas and Leszek Gasieniec and Nicolas Hanusse and David Ilcinkas and Ralf Klasing and Adrian Kosowski : Euler Tour Lock-In Problem in the Rotor-Router Model,
  pages 423-435.
• Yoram Moses : Optimum Simultaneous Consensus for General Omissions Is Equivalent to an NP Oracle,
  pages 436-448.
• Matthias Fitzi and Jesper Buus Nielsen : On the Number of Synchronous Rounds Sufficient for Authenticated Byzantine Agreement,
  pages 449-463.
• Valerie King and Jared Saia : From Almost Everywhere to Everywhere: Byzantine Agreement with Õ(n^3/2) Bits,
  pages 464-478.
• Erez Kantor and David Peleg : Efficient k-Shot Broadcasting in Radio Networks,
  pages 481-495.
• Alejandro Cornejo and Fabian Kuhn and Ruy Ley-Wild and Nancy A. Lynch : Keeping Mobile Robot Swarms Connected,
  pages 496-511.
• Jurek Czyzowicz and Leszek Gasieniec and Dariusz R. Kowalski and Andrzej Pelc : Consensus and Mutual Exclusion in a Multiple Access Channel,
  pages 512-526.

Brief Anouncements

• Hagit Attiya and Alessia Milani : Transactional Scheduling for Read-Dominated Workloads,
  pages 108-110.
• Michiko Inoue and Tsuyoshi Suzuki and Hideo Fujiwara : Acceleration by Contention for Shared Memory Mutual Exclusion Algorithms,
  pages 172-173.
• Ananda Basu and Borzoo Bonakdarpour and Marius Bozga and Joseph Sifakis : Incremental Component-Based Modeling, Verification, and Performance Evaluation of Distributed Reset,
  pages 174-175.
• Ioannis Chatzigiannakis and Othon Michail and Paul G. Spirakis : Decidable Graph Languages by Mediated Population Protocols,
  pages 239-240.
• Rachid Guerraoui and Kévin Huguenin and Anne-Marie Kermarrec and Maxime Monod : Towards Secured Distributed Polling in Social Networks,
  pages 241-242.
• Péter Bokor and Marco Serafini and Neeraj Suri and Helmut Veith : Efficient Model Checking of Fault-Tolerant Distributed Protocols Using Symmetry Reduction,
  pages 289-290.
• Swan Dubois and Maria Gradinariu Potop-Butucaru and Sébastien Tixeuil : Dynamic FTSS in Asynchronous Systems: The Case of Unison,
  pages 291-293.
• Ashraf Al Daoud and Sachin Agarwal and Tansu Alpcan : Cloud Computing Games: Pricing Services of Large Data Centers,
  pages 309-310.
• Mikel Larrea and Cristian Martín : On Implementing Omega Efficiently in the Crash-Recovery Model,
  pages 356-357.
• Carole Delporte-Gallet and Hugues Fauconnier and Sam Toueg : The Minimum Failure Detector for Non-Local Tasks in Message-Passing Systems,
  pages 358-359.
• Martin Biely and Peter Robinson and Ulrich Schmid : Weak Synchrony Models and Failure Detectors for Message Passing (k-)Set Agreement,
  pages 360-361.
• Flavio Paiva Junqueira and Benjamin C. Reed : Zab: A Practical Totally Ordered Broadcast Protocol,
  pages 362-363.
• Fatemeh Borran and André Schiper : A Leader-free Byzantine Consensus Algorithm,
  pages 479-480.
• Roy Friedman and Alex Kogan : Efficient Utilization of Multiple Interfaces in Wireless Ad Hoc Networks,
  pages 527-528.
• Nikolaos Fountoulakis and Anna Huber and Konstantinos Panagiotou : The Speed of Broadcasting in Random Networks - Density Does Not Matter,
  pages 529-530.

Winner of Best Paper Award

• Carole Delporte-Gallet and Hugues Fauconnier and Rachid Guerraoui and Andreas Tielmann : The Disagreement Power of an Adversary,
  pages 8-21.

Winner of Best Student Paper Award

• Henrique Moniz and Nuno Ferreira Neves and Miguel Correia and Paulo Veríssimo : Randomization Can Be a Healer: Consensus with Dynamic Omission Failures,
  pages 63-77.