Archives
1985-2009

11th International Workshop on Distributed Algorithms

Saarbrücken, Germany, September 24-26, 1997

The proceedings of the conference is edited by
Marios Mavronicolas and Philippas Tsigas
In: Lecture Notes in Computer Science Vol. 1320, Springer, 1997,
ISBN ISBN 3-540-63575-0.

List of papers:

Keynote Lectures

• Fred B. Schneider : Towards Fault-Tolerant and Secure Agentry,
  pages 1-14.
• Andreas Reuter : Workflow Management - An Exercise in Distributed Computing,
  pages 15-19.

Invited Paper in Memory of Anya Pogosyants

• Nancy A. Lynch : In Memory of Anna Pogosyants,
  pages 20-21.
• Anna Pogosyants and Roberto Segala and Nancy A. Lynch : Verification of the Randomized Consensus Algorithms of Aspnes and Herlihy: A Case Study,
  pages 22-36.

Contributed Papers

• Tamar Eilam and Shlomo Moran and Shmuel Zaks : A Simple DFS-Based Algorithm for Linear Interval Routing,
  pages 37-51.
• Michele Flammini and Enrico Nardelli and Guido Proietti : ATM Layouts with Bounded Hop Count and Congestion,
  pages 52-65.
• King-Shan Lui and Shmuel Zaks : Scheduling in Synchronous Networks and the Greedy Algorithm (Extended Abstract),
  pages 66-80.
• Johannes Gehrke and C. Greg Plaxton and Rajmohan Rajaraman : Rapid Convergence of a Local Load Balancing Algorithm for Asynchronous Rings,
  pages 81-95.
• Bogdan S. Chlebus and Roberto De Prisco and Alexander A. Shvartsman : Performing Tasks on Restartable Message-Passing Processors,
  pages 96-110.
• Roberto De Prisco and Butler W. Lampson and Nancy A. Lynch : Revisiting the Paxos Algorithm,
  pages 111-125.
• Marcos Kawazoe Aguilera and Wei Chen and Sam Toueg : Heartbeat: A Timeout-Free Failure Detector for Quiescent Reliable Communication,
  pages 126-140.
• Rachid Guerraoui and André Schiper : Genuine Atomic Multicast,
  pages 141-154.
• Shmuel Katz and Patrick Lincoln and John M. Rushby : Low-Overhead Time-Triggered Group Membership,
  pages 155-169.
• Jean-Michel Hélary and Achour Mostéfaoui and Michel Raynal : Virtual Precedence in Asynchronous Systems: Cencept and Applications,
  pages 170-184.
• Scott D. Stoller : Detecting Global Predicates in Distributed Systems with Clocks,
  pages 185-199.
• Jerry James and Ambuj K. Singh : Fault Tolerance Bounds for Memory Consistency,
  pages 200-214.
• Victor Luchangco : Precedence-Based Memory Models,
  pages 215-229.
• Yuh-Jzer Joung and Jen-Yi Liao : Strong Interaction Fairness in a Fully Distributed System with Unbounded Speed Variability,
  pages 230-244.
• Amos Beimel and Matthew K. Franklin : Reliable Communication over Partially Authenticated Networks,
  pages 245-259.
• Colette Johnen and Gianluigi Alari and Joffroy Beauquier and Ajoy Kumar Datta : Self-Stabilizing Depth-First Token Passing on Rooted Networks,
  pages 260-274.
• Juan A. Garay and Rosario Gennaro and Charanjit S. Jutla and Tal Rabin : Secure Distributed Storage and Retrieval,
  pages 275-289.
• Michiko Inoue and Sen Moriya and Toshimitsu Masuzawa and Hideo Fujiwara : Optimal Wait-Free Clock Synchronisation Protocol on a Shared-Memory Multi-processor System,
  pages 290-304.
• Mark Moir : Transparent Support for Wait-Free Transactions,
  pages 305-319.
• Prasad Jayanti and Sanjay Khanna : On the Power of Multi-objects,
  pages 320-332.