Abstract is missing.
- How to Build a Highly Available System Using ConsensusButler W. Lampson. 1-17
- Distributed Admission Control Algorithms for Real-Time CommunicationDomenico Ferrari. 18-28
- Randomization and Failure Detection: A Hybrid Approach to Solve ConsensusMarcos Kawazoe Aguilera, Sam Toueg. 29-39
- Levels of Authentication in Distributed AgreementMalte Borderding. 40-55
- Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract)Hagit Attiya. 56-70
- Plausible Clocks: Constant Size Logical Clocks for Distributed SystemsFrancisco J. Torres-Rojas, Mustaque Ahamad. 71-88
- Abstracting Communication to Reason about Distributed AlgorithmsMichel Charpentier, Mamoun Filali, Philippe Mauran, Gérard Padiou, Philippe Quéinnec. 89-104
- Simulating Reliable Links with Unreliable Links in the Presence of Process CrashesAnindya Basu, Bernadette Charron-Bost, Sam Toueg. 105-122
- A Cyclic Distributed Garbage Collector for Network ObjectsHelena Rodrigues, Richard E. Jones. 123-140
- Incremental, Distributed Orphan Detection and Actor Garbage Collection Using Graph Partitioning and Euler CyclesPeter Dickman. 141-158
- A Framework for the Analysis of Non-Deterministic Clock Synchronisation AlgorithmsPedro Fonseca, Zoubir Mammeri. 159-174
- Optimal Time Broadcasting in Faulty Star NetworksAohan Mei, Feng Bao, Yukihiro Hamada, Yoshihide Igarashi. 175-190
- A Lower Bound for Linear Interval RoutingTamar Eilam, Shlomo Moran, Shmuel Zaks. 191-205
- Topological Routing SchemesGiorgio Gambosi, Paola Vocca. 206-219
- Maintaining a Dynamic Set of Processors in a Distributed SystemSatoshi Fujita, Masafumi Yamashita. 220-233
- Collective ConsistencyCynthia Dwork, Ching-Tien Ho, H. Raymond Strong. 234-250
- Planar QuorumsRida A. Bazzi. 251-268
- Gamma-Accurate Failure DetectorsRachid Guerraoui, André Schiper. 269-286
- Fast, Long-Lived Renaming Improved and SimplifiedMark Moir, Juan A. Garay. 287-303
- A Timestamp Based Transformation of Self-Stabilizing Programs for Distributed Computing EnvironmentsMasaaki Mizuno, Hirotsugu Kakugawa. 304-321
- The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract)Hagit Attiya, Sergio Rajsbaum. 322-343
- On the Robustness of h^r_mShlomo Moran, Lihu Rappoport. 344-361
- Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract)Soma Chaudhuri, Paul Reiners. 362-379