Archives
1985-2007

15th International Symposium on Distributed Computing

Lisboa, Portugal, October 3-5, 2001

The proceedings of the conference is edited by
Jennifer L. Welch
In: Lecture Notes in Computer Science Vol. 2180, Springer, 2001,
ISBN 3-540-42605-1.

List of papers:

Accepted Papers

• Yong-Jik Kim and James H. Anderson : A Time Complexity Bound for Adaptive Mutual Exclusion,
  pages 1-15.
• Yuh-Jzer Joung : Quorum-Based Algorithms for Group Mutual Exclusion,
  pages 16-32.
• Paolo Boldi and Sebastiano Vigna : An Effective Characterization of Computability in Anonymous Networks,
  pages 33-47.
• John R. Douceur and Roger P. Wattenhofer : Competitive Hill-Climbing Strategies for Replica Placement in a Distributed File System,
  pages 48-62.
• Dahlia Malkhi and Elan Pavlov and Yaron Sella : Optimal Unconditional Information Diffusion,
  pages 63-77.
• Neeraj Mittal and Vijay K. Garg : Computation Slicing: Techniques and Theory,
  pages 78-92.
• R. Jiménez and Peris, M. Patino-Martínez and G. Alonso and S. Arévalo : A Low-Latency Non-blocking Commit Service,
  pages 93-107.
• Marcos K. Aguilera and Carole Delporte-Gallet and Hugues Fauconnier and Sam Toueg : Stable Leader Election,
  pages 108-122.
• Michiko Inoue and Shinya Umetani and Toshimitsu Masuzawa and Hideo Fujiwara : Adaptive Long-Lived O(k2)-Renaming with O(k2) Steps,
  pages 123-135.
• Maurice Herlihy and ergio Rajsbaum and Mark Tuttle : A New Synchronous Lower Bound for Set Agreement,
  pages 136-150.
• Chryssis Georgiou and Alexander Russell and Alex A. Shvartsman : The Complexity of Synchronous Iterative Do-All with Crashes,
  pages 151-165.
• Stefan Dobrev and Paola Flocchini and Giuseppe Prencipe and Nicola Santoro : Mobile Search for a Black Hole in an Anonymous Ring,
  pages 166-179.
• Jaap-Henk Hoepman : Randomised Mutual Search for k > 2 Agents,
  pages 180-193.
• Lisa Higham and Hiying Liang : Self-Stabilizing Minimum Spanning Tree Construction on Message-Passing Networks,
  pages 194-208.
• Maurice Herlihy and Srikanta Tirthapura : Self Stabilizing Distributed Queuing,
  pages 209-223.
• Faith E. Fich and Colette Johnen : A Space Optimal, Deterministic, Self-Stabilizing, Leader Election Algorithm for Unidirectional Rings,
  pages 224-239.
• Marie Duflot and Laurent Fribourg and Claudine Picaronny : Randomized Finite-State Distributed Algorithms as Markov Chains,
  pages 240-254.
• David Peleg and Uri Pincas : The Average Hop Count Measure for Virtual Path Layouts,
  pages 255-269.
• Lali Barrière and Pierre Fraigniaud and Evangelos Kranakis and Danny Krizanc : Efficient Routing in Networks with Long Range Contacts,
  pages 270-284.
• I. Chatzigiannakis and S. Nikoletseas and P. Spirakis : An Efficient Communication Strategy for Ad-hoc Mobile Networks,
  pages 285-299.
• Timothy L. Harris : A Pragmatic Implementation of Non-blocking Linked-Lists,
  pages 300-314.
• Ted Herman and Toshimitsu Masuzawa : Stabilizing Replicated Search Trees,
  pages 315-329.
• Panagiota Fatourou and Maurice Herlihy : Adding Networks,
  pages 330-342.

Winner of Best Student Paper Award

• Yong-Jik Kim and James H. Anderson : A Time Complexity Bound for Adaptive Mutual Exclusion,
  pages 1-15.