Archives
1985-2009

24th International Symposium on Distributed Computing

Boston, USA, September 13-15, 2010

The proceedings of the conference is edited by
Nancy A. Lynch, Alexander A. Shvartsman
In: Lecture Notes in Computer Science Vol. 6343, Springer, 2010,
ISBN 978-3-642-15762-2.

List of papers:

Invited Papers

• Barbara Liskov : The Power of Abstraction,
  pages 3-3.
• Rachid Guerraoui : Foundations of Speculative Distributed Computing,
  pages 204-205.
• Nitin H. Vaidya : Network-Aware Distributed Algorithms: Challenges and Opportunities in Wireless Networks,
  pages 343-343.

Accepted Papers

• Ittai Abraham and Marcos Kawazoe Aguilera and Dahlia Malkhi : Fast Asynchronous Consensus with Optimal Resilience,
  pages 4-19.
• Luke Dalessandro and Michael L. Scott and Michael F. Spear : Transactions as the Foundation of a Memory Consistency Model,
  pages 20-34.
• Hagit Attiya and Eshcar Hillel : The Cost of Privatization,
  pages 35-49.
• Francois Carouge and Michael F. Spear : A Scalable Lock-Free Universal Construction with Best Effort Transactional Hardware,
  pages 50-63.
• Gokarna Sharma and Brett Estrade and Costas Busch : Window-Based Greedy Contention Management for Transactional Memory,
  pages 4-19.
• Danny Hendler and Itai Incze and Nir Shavit and Moran Tzafrir : Scalable Flat-Combining Based Synchronous Queues,
  pages 79-93.
• Dan Alistarh and Hagit Attiya and Seth Gilbert and Andrei Giurgiu and Rachid Guerraoui : Fast Randomized Test-and-Set and Renaming,
  pages 94-108.
• Maurice Herlihy and Sergio Rajsbaum : Concurrent Computing and Shellable Complexes,
  pages 109-123.
• Johannes Schneider and Roger Wattenhofer : What Is the Use of Collision Detection (in Wireless Networks)?,
  pages 133-147.
• Alejandro Cornejo and Fabian Kuhn : Deploying Wireless Networks with Beeps,
  pages 148-162.
• Thomas Kesselheim and Berthold Vöcking : Distributed Contention Resolution in Wireless Networks,
  pages 163-178.
• Andréa W. Richa and Christian Scheideler and Stefan Schmid and Jin Zhang : A Jamming-Resistant MAC Protocol for Multi-Hop Wireless Networks,
  pages 179-193.
• François Bonnet and Michel Raynal : Anonymous Asynchronous Systems: the Case of Failure Detectors,
  pages 206-220.
• Gadi Taubenfeld : The Computational Structure of Progress Conditions,
  pages 221-235.
• Bogdan S. Chlebus and Dariusz R. Kowalski and Michal Strojnowski : Scalable Quantum Consensus for Crash Failures,
  pages 236-250.
• Emanuele G. Fusco and Andrzej Pelc : How Much Memory Is Needed for Leader Election,
  pages 251-266.
• Yoann Dieudonné and Franck Petit and Vincent Villain : Leader Election Problem versus Pattern Formation Problem,
  pages 267-281.
• Jérémie Chalopin and Shantanu Das and Peter Widmayer : Rendezvous of Mobile Agents in Directed Graphs,
  pages 282-296.
• Evangelos Bampas and Jurek Czyzowicz and Leszek Gasieniec and David Ilcinkas and Arnaud Labourel : Almost Optimal Asynchronous Rendezvous in Infinite Multidimensional Grids,
  pages 297-311.
• Lélia Blin and Alessia Milani and Maria Potop-Butucaru and Sébastien Tixeuil : Exclusive Perpetual Ring Exploration without Chirality,
  pages 312-327.
• Dariusz Dereniowski and Andrzej Pelc : Drawing Maps with Advice,
  pages 328-342.
• Dariusz R. Kowalski and Mariusz A. Rokicki : Connectivity Problem in Wireless Networks,
  pages 344-358.
• Seth Gilbert and Dariusz R. Kowalski : Trusted Computing for Fault-Prone Wireless Networks,
  pages 359-373.
• Antonio Fernández Anta and Alessia Milani and Miguel A. Mosteiro and Shmuel Zaks : Opportunistic Information Dissemination in Mobile Ad-hoc Networks: The Profit of Global Synchrony,
  pages 374-388.
• Edmund L. Wong and Joshua B. Leners and Lorenzo Alvisi : It's on Me! The Benefit of Altruism in BAR Environments,
  pages 406-420.
• Ido Ben-Zvi and Yoram Moses : Beyond Lamport's Happened-Before: On the Role of Time Bounds in Synchronous Systems,
  pages 421-436.
• Hrishikesh B. Acharya and Mohamed G. Gouda : On the Power of Non-spoofing Adversaries,
  pages 437-449.
• Vijay K. Garg : Implementing Fault-Tolerant Services Using State Machines: Beyond Replication,
  pages 450-464.
• Shay Kutten and Dmitry Zinenko : Low Communication Self-stabilization through Randomization,
  pages 465-479.
• Lélia Blin and Shlomi Dolev and Maria Gradinariu Potop-Butucaru and Stephane Rovedakis : Fast Self-stabilizing Minimum Spanning Tree Construction - Using Compact Nearest Common Ancestor Labeling Scheme,
  pages 480-494.
• Swan Dubois and Toshimitsu Masuzawa and Sébastien Tixeuil : The Impact of Topology on Byzantine Containment in Stabilization,
  pages 495-509.
• Christoph Lenzen and Roger Wattenhofer : Minimum Dominating Set Approximation in Graphs of Bounded Arboricity,
  pages 510-524.

Brief Anouncements

• Pascal Felber and Christof Fetzer and Patrick Marlier and Martin Nowack and Torvald Riegel : Hybrid Time-Based Transactional Memory,
  pages 124-126.
• Yehuda Afek and Eitan Yanovsky and Guy Korland : Quasi-Linearizability: Relaxed Consistency for Improved Concurrency,
  pages 127-129.
• Hyonho Lee : Fast Local-Spin Abortable Mutual Exclusion with Bounded Space,
  pages 130-132.
• Michael Ben-Or and Danny Dolev and Ezra N. Hoch : Simple Gradecast Based Algorithms,
  pages 194-197.
• Sukhyun Song and Peter J. Keleher and Bobby Bhattacharjee and Alan Sussman : Decentralized Network Bandwidth Prediction,
  pages 198-200.
• Abhinav Mehta and Shashank Agrawal and Kannan Srinathan : Synchronous Las Vegas URMT Iff Asynchronous Monte Carlo URMT,
  pages 201-203.
• Scott M. Pike and Srikanth Sastry and Jennifer L. Welch : Failure Detectors Encapsulate Fairness,
  pages 389-391.
• Francesco Alberti and Silvio Ghilardi and Elena Pagani and Silvio Ranise and Gian Paolo Rossi : Automated Support for the Design and Validation of Fault Tolerant Parameterized Systems - A Case Study,
  pages 392-394.
• Mitre Costa Dourado and Lucia Draque Penso and Dieter Rautenbach and Jayme Luiz Szwarcfiter : On Reversible and Irreversible Conversions,
  pages 395-397.
• Venkatesan T. Chakaravarthy and Anamitra R. Choudhury and Vijay K. Garg and Yogish Sabharwal : A Decentralized Algorithm for Distributed Trigger Counting,
  pages 398-400.
• Mahesh Balakrishnan and Philip A. Bernstein and Dahlia Malkhi and Vijayan Prabhakaran and Colin W. Reid : Flash-Log - A High Throughput Log,
  pages 401-403.
• Dan Alistarh and Seth Gilbert and Rachid Guerraoui and Corentin Travers : New Bounds for Partially Synchronous Set Agreement,
  pages 404-405.
• Noga Alon and Hagit Attiya and Shlomi Dolev and Swan Dubois and Maria Gradinariu and Sébastien Tixeuil : Sharing Memory in a Self-stabilizing Manner,
  pages 525-527.
• Benjamin Doerr and Leslie Ann Goldberg and Lorenz Minder and Thomas Sauerwald and Christian Scheideler : Stabilizing Consensus with the Power of Two Choices,
  pages 528-530.

Winner of Best Student Paper Award

• François Bonnet and Michel Raynal : Anonymous Asynchronous Systems: the Case of Failure Detectors,
  pages 206-220.