Informing
Policy
for Progress

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

A. Segal, Shmuel Zaks
Report /
January 1992

SHARE

READ ONLINE

CITATION

Segal, A., & Zaks, S. (1992). Distributed Algorithms, WDAG ’92, Springer Verlag, Lecture Notes in Computer Science Series, No. 647. Samuel Neaman Institute.
https://www.neaman.org.il/en/distributed-algorithms-wdag-92-springer-verlag-lecture-notes-computer-science-series-no647/

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 Samuel 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.

Download files:

Upcoming Events