Synchronous Distributed Algorithms
Synchronous Distributed Algorithms is a class of distributed algorithms in which processes execute in lockstep rounds, coordinated by a global clock, such that message transmission and reception occur within predictable time bounds, thereby ensuring that all actions in each round are synchronized across the network.
53
Publications
4K
Citations
158
Authors
87
Institutions
Publications per year
2017–2026
12
Parents
53
Complexity of network synchronization
Baruch Awerbuch · Journal of the ACM · 1985 · 691 citations · Full text
Michael O. Rabin · 1983 · 585 citations
Weighted Gossip: Distributed Averaging using non-doubly stochastic matrices
Florence Bénézit, Vincent D. Blondel, Patrick Thiran et al. · 2010 · 237 citations · Full text
1–5 of 53
158
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 158
87
University of California, Los Angeles
Los Angeles, United States
4 h-index
12 publications
656 citations
Massachusetts Institute of Technology
Cambridge, United States
4 h-index
5 publications
1.1K citations

TU Wien
Vienna, Austria
3 h-index
6 publications
233 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
3 h-index
6 publications
530 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
2 publications
296 citations

University of Padua
Padua, Italy
2 h-index
4 publications
280 citations
IBM (United States)
Armonk, United States
2 h-index
2 publications
231 citations
Georgia Institute of Technology
Atlanta, United States
1 h-index
1 publications
44 citations
1–8 of 87
Repository · 3 publications · 207 citations
3
h-index
TPDS · 2 publications · 156 citations
2
h-index
TSE · 2 publications · 78 citations
2
h-index
JACM · 2 publications · 735 citations
2
h-index
2 publications · 159 citations
2
h-index
1–5