Archives
1985-2009

10th International Workshop on Distributed Algorithms

Bologna, Italy, October 9-11, 1996

The proceedings of the conference is edited by
Özalp Babaoglu and Keith Marzullo
In: Lecture Notes in Computer Science Vol. 1151, Springer, 1996,
ISBN 3-540-61769-8.

List of papers:

Invited Papers

• Butler W. Lampson : How to Build a Highly Available System Using Consensus,
  pages 1-17.
• Domenico Ferrari : Distributed Admission Control Algorithms for Real-Time Communication,
  pages 18-28.

Regular Papers

• Marcos Kawazoe Aguilera and Sam Toueg : Randomization and Failure Detection: A Hybrid Approach to Solve Consensus,
  pages 29-39.
• Malte Borderding : Levels of Authentication in Distributed Agreement,
  pages 40-55.
• Hagit Attiya : Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract),
  pages 56-70.
• Francisco J. Torres-Rojas and Mustaque Ahamad : Plausible Clocks: Constant Size Logical Clocks for Distributed Systems,
  pages 71-88.
• Michel Charpentier and Mamoun Filali and Philippe Mauran and Gérard Padiou and Philippe Quéinnec : Abstracting Communication to Reason about Distributed Algorithms,
  pages 89-104.
• Anindya Basu and Bernadette Charron-Bost and Sam Toueg : Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes,
  pages 105-122.
• Helena Rodrigues and Richard Jones : A Cyclic Distributed Garbage Collector for Network Objects,
  pages 123-140.
• Peter Dickman : Incremental, Distributed Orphan Detection and Actor Garbage Collection Using Graph Partitioning and Euler Cycles,
  pages 141-158.
• Pedro Fonseca and Zoubir Mammeri : A Framework for the Analysis of Non-Deterministic Clock Synchronisation Algorithms,
  pages 159-174.
• Aohan Mei and Feng Bao and Yukihiro Hamada and Yoshihide Igarashi : Optimal Time Broadcasting in Faulty Star Networks,
  pages 175-190.
• Tamar Eilam and Shlomo Moran and Shmuel Zaks : A Lower Bound for Linear Interval Routing,
  pages 191-205.
• Giorgio Gambosi and Paola Vocca : Topological Routing Schemes,
  pages 206-219.
• Satoshi Fujita and Masafumi Yamashita : Maintaining a Dynamic Set of Processors in a Distributed System,
  pages 220-233.
• Cynthia Dwork and Ching-Tien Ho and H. Raymond Strong : Collective Consistency,
  pages 234-250.
• Rida A. Bazzi : Planar Quorums,
  pages 251-268.
• Rachid Guerraoui and André Schiper : "Gamma-Accurate" Failure Detectors,
  pages 269-286.
• Mark Moir and Juan A. Garay : Fast, Long-Lived Renaming Improved and Simplified,
  pages 287-303.
• Masaaki Mizuno and Hirotsugu Kakugawa : A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing Environments,
  pages 304-321.
• Hagit Attiya and Sergio Rajsbaum : The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract),
  pages 322-343.
• Shlomo Moran and Lihu Rappoport : On the Robustness of h^r_m,
  pages 344-361.
• Soma Chaudhuri and Paul Reiners : Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract),
  pages 362-379.