Distributed Algorithms

1. Membership algorithms for multicast communication groups

   • Yair Amir, Danny Dolev, Shlomo Kramer, Dalia Malki

   Pages 292-312

2. The granularity of waiting (extended Abstract)

   • James H. Anderson, Jae-Heon Yang, Mohamed G. Gouda

   Pages 313-328

3. The cost of order in asynchronous systems

   • Aleta Ricciardi, Kenneth Birman, Patrick Stephenson

   Pages 329-345

4. Efficient, strongly consistent implementations of shared memory

   • Marios Mavronicolas, Dan Roth

   Pages 346-361

5. Optimal primary-backup protocols

   • Navin Budhiraja, Keith Marzullo, Fred B. Schneider, Sam Toueg

   Pages 362-378

6. Back Matter

   PDF

This volume presents the proceedings of the Sixth Workshop on Distributed Algorithms (WDAG 92), held in Haifa, Israel, November 2-4, 1992. WDAG provides a forum for researchers and other parties interested in distributedalgorithms and their applications. The aim is to present recent research results, explore directions for future research, and identify common fundamental techniques that serve as building blocks in many distributed algorithms. Papers in the volume describe original results in all areas of distributed algorithms and their applications, including distributed graph algorithms, distributed combinatorial algorithms, design of network protocols, routing and flow control, communication complexity, fault-tolerant distributed algorithms, distributed data structures, distributed database techniques, replica control protocols, distributed optimization algorithms, mechanisms for safety and security in distributed systems, and protocols for real-time distributed systems.

• Algorithms
• Routing
• algorithm
• complexity
• data structure
• distributed systems
• optimization
• real-time
• security
• algorithm analysis and problem complexity

Policies and ethics