Archives
1985-2009

9th International Workshop on Distributed Algorihtms

Le Mont-Saint-Michel, France, September 13-15, 1995

The proceedings of the conference is edited by
Jean-Michel Hélary and Michel Raynal
In: Lecture Notes in Computer Science Vol. 972, Springer, 1995,
ISBN 3-540-60274-7.

List of papers:

Invited Papers

• Mohamed G. Gouda : The Triumph and Tribulation of System Stabilization,
  pages 1-18.
• Prasad Jayanti : Wait-free Computing,
  pages 19-50.
• Gerard Le Lann : On Real-Time and Non Real-Time Distributed Computing,
  pages 51-70.
• Danny Dolev : Theory and Practice in Distributed Systems (Abstract),
  pages 71-71.

Asynchronous Systems

• Özalp Babaoglu and Renzo Davoli and Luigi Giachini and Paolo Sabattini : The Inherent Cost of Strong-Partial View-Synchronous Communication,
  pages 72-86.
• Rachid Guerraoui : Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus,
  pages 87-100.
• Aleta Ricciardi : Dissecting Distributed Coordination,
  pages 101-115.

Networks

• Baruch Awerbuch and Shay Kutten and Yishay Mansour and David Peleg : Optimal Broadcast with Partial Knowledge (Extended Abstract),
  pages 116-130.
• Michele Flammini and Giorgio Gambosi and Umberto Nanni and Richard B. Tan : Multi-Dimensional Interval Routing Schemes,
  pages 131-144.
• Andreas Jakoby and Rüdiger Reischuk : Data Transmission in Processor Networks,
  pages 145-159.
• Paul G. Spirakis and Basil Tampakas and H. Antonopoulou : Distributed Protocols Against Mobile Eavesdroppers,
  pages 160-167.

Shared Memory

• James H. Anderson and Mark Moir : Universal Constructions for Large Objects,
  pages 168-182.
• Anish Arora and Mohamed G. Gouda : Load Balancing: An Exercise in Constrainted Convergence,
  pages 183-197.
• Marc Shapiro and Paulo Ferreira : Larchant-RDOSS: a Distributed Shared Persistent Memory and its Garbage Collector,
  pages 198-214.

Byzantine Failures

• Feng Bao and Yoshihide Igarashi and Keiko Katano : Broadcasting in Hypercubes with Randomly Distributed Byzantine Faults,
  pages 215-229.
• Malte Borcherding : On the Number of Authenticated Rounds in Byzantine Agreement,
  pages 230-241.
• Louise E. Moser and P. M. Melliar-Smith : Total Ordering Algorithms for Asynchronous Byzantine Systems,
  pages 242-256.

Self-Stabilization

• Franck Butelle and Christian Lavault and Marc Bui : A Uniform Self-Stabilizing Minimum Diameter Tree Algorithm (Extended Abstract),
  pages 257-272.
• Jaap-Henk Hoepman and Marina Papatriantafilou and Philippas Tsigas : Self-Stabilization of Wait-Free Shared Memory Objects,
  pages 273-287.
• Gene Itkis and Chengdian Lin and Janos Simon : Deterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings,
  pages 288-302.

Detection of Properties

• Craig M. Chase and Vijay K. Garg : Efficient Detection of Restricted Classes of Global Predicates,
  pages 303-317.
• Scott D. Stoller and Fred B. Schneider : Faster Possibility Detection by Combining Two Approaches,
  pages 318-332.