15. DISC 2001: Lisbon, Portugal

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