Abstract is missing.
- Distributed Priority Algorithms Under One-Bit-Delay ConstraintsReuven Cohen, Adrian Segall. 1-12
- Connection-Based Communication in Dynamic Networks (Extended Abstract)Amir Herzberg. 13-24
- Requirements for Deadlock-Free, Adaptive Packet RoutingRobert Cypher, Luis Gravano. 25-33
- The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract)Yehuda Afek, Eli Gafni, Adi Rosén. 35-46
- Computing with Faulty Shared Memory (Extended Abstract)Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld. 47-58
- Concurrent Counting (Extended Abstract)Shlomo Moran, Gadi Taubenfeld, Irit Yadin. 59-70
- Optimal Multi-Writer Multi-Reader Atomic RegisterAmos Israeli, Amnon Shaham. 71-82
- Tolerating Linear Number of Faults in Networks of Bounded DegreeEli Upfal. 83-89
- Performing Work Efficiently in the Presence of FaultsCynthia Dwork, Joseph Y. Halpern, Orli Waarts. 91-102
- On the Complexity of Global Computation in the Presence of Link Failures: The Case of Uni-Directional FaultsOded Goldreich, Dror Sneh. 103-111
- Observing Self-StabilizationChengdian Lin, Janos Simon. 113-123
- Performance Issues in Non-blocking Synchronization on Shared-memory MultiprocessorsJuan Alemany, Edward W. Felten. 125-134
- Robust, Distributed References and Acyclic Garbage CollectionMarc Shapiro, Peter Dickman, David Plainfossé. 135-146
- The Weakest Failure Detector for Solving ConsensusTushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg. 147-158
- Improving Fast Mutual ExclusionEugene Styer. 159-168
- Fast Network Decomposition (Extended Abstract)Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg. 169-177
- Leader Election in Complete NetworksGurdip Singh. 179-190
- The Impact of Time on the Session ProblemInjong Rhee, Jennifer L. Welch. 191-202
- The Possibility and the Complexity of Achieving Fault-Tolerant CoordinationRida A. Bazzi, Gil Neiger. 203-214
- From Sequential Layers to Distributed Processes: Deriving a Distributed Minimum Weight Spanning Tree Algorithm (Extended Anstract)Wil Janssen, Job Zwiers. 215-227
- Progress Measures and Stack Assertions for Fair TerminationNils Klarlund. 229-240
- A Tradeoff Between Safety and Liveness for Randomized Coordinated Attack ProtocolsGeorge Varghese, Nancy A. Lynch. 241-250
- Fast Randomized Algorithms for Distributed Edge Coloring (Extended Abstract)Alessandro Panconesi, Aravind Srinivasan. 251-262
- Proving Probabilistic Correctness Statements: the Case of Rabin s Algorithm for Mutual ExclusionIsaac Saias. 263-274
- Randomized Mutual Exclusion Algorithms RevisitedEyal Kushilevitz, Michael O. Rabin. 275-283