10. WDAG 1996: Bologna, Italy

Özalp Babaoglu, Keith Marzullo (Eds.): Distributed Algorithms, 10th International Workshop, WDAG '96, Bologna, Italy, October 9-11, 1996, Proceedings. Lecture Notes in Computer Science 1151 Springer 1996, ISBN 3-540-61769-8 BibTeX

@proceedings{DBLP:conf/wdag/1996,
  editor    = {{\"O}zalp Babaoglu and
               Keith Marzullo},
  title     = {Distributed Algorithms, 10th International Workshop, WDAG '96,
               Bologna, Italy, October 9-11, 1996, Proceedings},
  booktitle = {WDAG},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1151},
  year      = {1996},
  isbn      = {3-540-61769-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Papers

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

Regular Papers

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