Font Size:
Site Colors:
Accesskey
S - Skip navigation
1 - Home page
4 - Search
Accessibility Statement

Distributed Algorithms, WDAG '92, Springer Verlag, Lecture Notes in Computer Science Series, No. 647

Researchers
A. Segal , Prof. Shmuel Zaks
Cite As:
Segal A. , Zaks Shmuel . Distributed Algorithms, WDAG '92, Springer Verlag, Lecture Notes in Computer Science Series, No. 647 Haifa Israel: Samuel Neaman Institute, 1992. https://www.neaman.org.il/EN/Distributed-Algorithms-WDAG-92-Springer-Verlag-Lecture-Notes-Computer-Science-Series-No647
Download files:
1-072.pdf(14227KB)

WDAG is intended to provide a forum for researchers and other parties interested in distributed algorithms 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 were solicited describing 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.

The S. Neaman Institute selected WDAG 92 as the first workshop to receive sponsorship under the newly-established program to support scientific meetings related to research carried out at the Technion.

Publications that might interest you