Abstract is missing.
- Self-Stabilizing Ring OrientationAmos Israeli, Marc Jalfon. 1-14
- Memory-Efficient Self Stabilizing Protocols for General NetworksYehuda Afek, Shay Kutten, Moti Yung. 15-28
- On the Computational Power Needed to Elect a Leader (Extended Abstract)Alon Atai. 29-40
- Spanning Tree Construction for Nameless NetworksIvan Lavallée, Christian Lavault. 41-56
- A Linear Fault-Tolerant Naming AlgorithmJoffroy Beauquier, Paul Gastin, Vincent Villain. 57-70
- Distributed Data Structures: A Complexity-Oriented ViewDavid Peleg. 71-89
- An Improved Algorithm to Detect Communication Deadlocks in Distributed SystemsBerthold Kröger, Reinhard Lüling, Burkhard Monien, Oliver Vornberger. 90-101
- On the Average Performance of Synchronized Programs in Distributed Networks (Preliminary Version)Sergio Rajsbaum, Moshe Sidi. 102-121
- Distributed Algorithms for Reconstructing MST after Topology ChangeJungho Park, Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura. 122-132
- Efficient Distributed Algorithms for Single-Source Shortest Paths and Related Problems on Plane NetworksRavi Janardan, Siu-Wing Cheng. 133-150
- Stepwise Development of a Distributed Load Balancing AlgorithmsPeter Grønning, Thomas Qvist Nielsen, Hans Henrik Løvengreen. 151-168
- Greedy Packet SchedulingIsrael Cidon, Shay Kutten, Yishay Mansour, David Peleg. 169-184
- Optimal Computation of Global Sensitive Functions in Fast NetworksIsrael Cidon, Inder S. Gopal, Shay Kutten. 185-191
- Efficient Mechanism for Fairness and Deadlock-Avoidance in High-Speed NetworksYoram Ofek, Moti Yung. 192-212
- Strong Verifiable Secret Sharing (Extended Abstract)Cynthia Dwork. 213-227
- Weak Consistency and Pessimistic Replica ControlAlain Sandoz, André Schiper. 228-244
- Localized-Access Protocols for Replicated DatabasesDivyakant Agrawal, Amr El Abbadi. 245-262
- Weighted Voting for Operation Dependent Management of Replicated DataMirjana Obradovic, Piotr Berman. 263-276
- Wakeup under Read/Write AtomicityPrasad Jayanti, Sam Toueg. 277-288
- Time and Message Efficient Reliable BroadcastsTushar Deepak Chandra, Sam Toueg. 289-303
- Early-Stopping Distributed Bidding and Applications (Preliminary Version)Navin Budhiraja, Ajei S. Gopal, Sam Toueg. 304-320
- Fast Consensus in Networks of Bounded Degree (Extended Abstract)Piotr Berman, Juan A. Garay. 321-333
- Common Knowledge and Consistent Simultaneous CoordinationGil Neiger, Mark R. Tuttle. 334-352
- Agreement on the Group Membership in Synchronous Distributed SystemsRogério de Lemos, Paul D. Ezhilchelvan. 353-372
- Tight Bounds on the Round Complexity of Distributed 1-Solvable TasksOfer Biran, Shlomo Moran, Shmuel Zaks. 373-389
- A Time-Randomness Tradeoff for Communication ComplexityRudolf Fleischer, Hermann Jung, Kurt Mehlhorn. 390-401
- Bounds on the Costs of Register ImplementationsSoma Chaudhuri, Jennifer L. Welch. 402-421
- A Bounded First-In, First-Enabled Solution to the 1-Exclusion ProblemYehuda Afek, Danny Dolev, Eli Gafni. 422-431