Archives
1985-2009

20th International Symposium on Distributed Computing

STOCKHOLM, SWEDEN, SEPTEMBER 18 - 20, 2006

The proceedings of the conference is edited by
Shlomi Dolev
In: Lecture Notes in Computer Science Vol. 4167/2006, Springer-Verlag Heidelberg, 2006,
ISBN 3-540-44624-9.

List of papers:

Accepted Papers

• Anchour Mostefaoui and Michel Raynal and Corentin Travers : Exploring Gafni's reduction land: from Omega-k to wait-free adaptive (wp - |p/k|) renaming via k-set agreement,
  pages 1-15.
• Michael Okun and Amnon Barak : Renaming in Message Passing Systems with Byzantine Failures,
  pages 16-30.
• Hagit Attiya and Eschar Hillel : Built-in Coloring for Highly-Concurrent Doubly-Linked Lists,
  pages 31-45.
• Xavier Defago and Maria Gradinariu and Stephane Messika and Philippe Raipin-Parvedy : Fault-tolerant and Self-stabilizing Mobile Robots Gathering,
  pages 46-60.
• Dana Angluin and James Aspnes and David Eisenstat : Fast Computation by Population Protocols With a Leader,
  pages 61-75.
• Doina Bein and Ajoy K. Datta and Lawrence L. Larmore : On Self-stabilizing Search Trees,
  pages 76-89.
• Yitzhak Birk and Idit Keidar and Liran Liss and Assaf Schuster : Efficient Dynamic Aggregation,
  pages 90-104.
• Jérémie Chalopin and Shantanu Das and Nicola Santoro : Groupings and Pairings in Anonymous Networks,
  pages 105-119.
• Yoram Moses and Benny Shimony : A New Proof of the GHS Minimum Spanning Tree Algorithm,
  pages 120-136.
• Joseph Y. Halpern and Sabina Petride : A Knowledge-Based Analysis of Global Function Computation,
  pages 136-150.
• Leslie Lamport : Checking a Multithreaded Algorithm with +CAL,
  pages 151-163.
• Lisa Higham and LillAnne Jackson and Jalal Kawash : Capturing Register and Control Dependence in Memory Consistency Models with Applications to the Itanium Architecture,
  pages 164-178.
• Michael F. Spear and Virendra J. Marathe and William N. Scherer III and Michael L. Scott : Conflict Detection and Validation Strategies for Software Transactional Memory,
  pages 179-193.
• David Dice and Ori Shalev and Nir Shavit : Transactional Locking II,
  pages 194-208.
• Yehuda Afek and Eran Shalom : Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects,
  pages 209-223.
• Taisuke Izumi and Toshimitsu Masuzawa : One-Step Consensus Solvability,
  pages 224-237.
• Ran Canetti and Ling Cheung and Dilsun Kirli Kaynar and Moses Liskov and Nancy A. Lynch and Olivier Pereira and Roberto Segala : Time-Bounded Task-PIOAs: A Framework for Analyzing Security Protocols,
  pages 238-253.
• Alina Oprea and Michael K. Reiter : On Consistency of Encrypted Files,
  pages 254-268.
• Michael B. Greenwald and Sanjeev Khanna and Keshav Kunal and Benjamin C. Pierce and Alan Schmitt : Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data,
  pages 269-283.
• Torvald Riegel and Pascal Felber and Christof Fetzer : A Lazy Snapshot Algorithm with Eager Validation,
  pages 284-298.
• Rida A. Bazzi and Yin Ding : Bounded Wait-Free f-Resilient Atomic Byzantine Data Storage Systems for an Unbounded Number of Clients,
  pages 299-313.
• Bogdan S. Chlebus and Dariusz R. Kowalski : Time and Communication Efficient Consensus for Crash Failures,
  pages 314-328.
• Eli Gafni and Sergio Rajsbaum and Maurice Herlihy : Subconsensus Tasks: Renaming Is Weaker Than Set Agreement,
  pages 329-338.
• Arthur Brady and Lenore Cowen : Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes,
  pages 339-354.
• Maleq Khan and Gopal Pandurangan : A Fast Distributed Approximation Algorithm for Minimum Spanning Trees,
  pages 355-369.
• Robert Elsässer : On Randomized Broadcasting in Power Law Networks,
  pages 370-384.
• Andrzej Czygrinow and Michal Hanckowiak : Distributed Approximation Algorithms in Unit-Disk Graphs,
  pages 385-398.
• Rachid Guerraoui and Michal Kapalka and Petr Kouznetsov : The Weakest Failure Detectors to Boost Obstruction-Freedom,
  pages 399-412.
• Alex Brodsky and Faith Ellen and Philipp Woelfel : Fully-Adaptive Algorithms for Long-Lived Renaming,
  pages 413-427.
• Danny Hendler and Shay Kutten : Constructing Shared Objects That Are Both Robust and High-Throughput,
  pages 428-442.
• Amitanand S. Aiyer and Lorenzo Alvisi and Rida A. Bazzi : Byzantine and Multi-writer K-Quorums,
  pages 443-458.
• Michele Flammini and Mordechai Shalom and Shmuel Zaks : On Minimizing the Number of ADMs in a General Topology Optical Network,
  pages 459-473.
• Kishori M. Konwar and Sanguthevar Rajasekaran and Alexander A. Shvartsman : Robust Network Supercomputing with Malicious Processes,
  pages 474-488.
• Cathy H. Xia and James Broberg and Zhen Liu and Li Zhang : Distributed Resource Allocation in Stream Processing Systems,
  pages 489-504.
• Piotr Zielinski : Low-latency Atomic Broadcast in the presence of contention,
  pages 505-519.
• Thomas Locher and Roger Wattenhofer : Oblivious Gradient Clock Synchronization,
  pages 520-533.

Brief Anouncements

• Marcos Kawazoe Aguilera and Svend Frølund and Vassos Hadzilacos and Stephanie Lorraine Horn and Sam Toueg : Abortable and Query-Abortable Objects,
  pages 534-536.
• Nicolas C. Nicolaou and Alexander A. Shvartsman : Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers,
  pages 537-539.
• Bassam Bamieh and Amr El Abbadi : Convergence Analysis of Scalable Gossip Protocols,
  pages 540-542.
• Colette Johnen and Stéphane Messika : Computing Automatically the Stabilization Time Against the Worst and the Best Schedules,
  pages 543-547.
• A. Ogale and Vijay K. Garg : Many Slices Are Better Than One,
  pages 548-550.
• Pierre Fraigniaud and Emmanuelle Lebhar and Zvi Lotker : On Augmented Graph Navigability,
  pages 551-553.
• Alysson Neves Bessani and Miguel Correia and Joni da Silva Fraga and Lau Cheuk Lung : Decoupled Quorum-Based Byzantine-Resilient Coordination in Open Distributed Systems,
  pages 554-556.
• Nicolas Schiper and Rodrigo Schmidt and Fernando Pedone : Optimistic Algorithms for Partial Database Replication,
  pages 557-559.
• Frederic Tronel and Spyros Voulgari : Performance Analysis of Cyclon, an Inexpensive Membership Management for Unstructured P2P Overlays,
  pages 560-562.
• Yu Chen and Wei Chen : Decentralized, Connectivity-Preserving, and Cost-Effective Structured Overlay Maintenance,
  pages 563-565.
• Anton Esin and Rostislav Yavorskiy and Nikolay Zemtsov : Monitoring of Linear Distributed Computations,
  pages 563-565.
• Mikel Larrea and Alberto Lafuenten and Joachim Wieland : Communication-Optimal Implementation of Failure Detector Class diamond-P,
  pages 569-571.
• Srinivasan Krishnamurthy and R. Chandrasekaran and Neeraj Mittal and S. Venkatesan : Synchronous Distributed Algorithms for Node Discovery and Configuration in Multi-channel Cognitive Radio Networks,
  pages 572-574.

Winner of Best Student Paper Award

• Maleq Khan and Gopal Pandurangan : A Fast Distributed Approximation Algorithm for Minimum Spanning Trees,
  pages 355-369.