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