10. WDAG 1996: Bologna, Italy

Invited Papers

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

Regular Papers

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