Asynchronous Distributed Algorithms
Asynchronous Distributed Algorithms is a subclass of distributed algorithms characterized by the absence of a global clock and reliance on local timing, where processes operate at arbitrary speeds and message delays are unbounded, thereby requiring coordination mechanisms that do not depend on time-based assumptions.
380
Publications
23.1K
Citations
796
Authors
340
Institutions
Publications per year
2017–2026
84
Parents
380
Complexity of network synchronization
Baruch Awerbuch · Journal of the ACM · 1985 · 691 citations · Full text
Another advantage of free choice (Extended Abstract)
Michael Ben-Or · 1983 · 575 citations · Full text
1–5 of 380
796
Massachusetts Institute of Technology, United States
9 publications · 2.9K citations
9
h-index
7
h-index
Franche-Comté Électronique Mécanique Thermique et Optique - Sciences et Technologies, France
6 publications · 148 citations
6
h-index
6
h-index
6
h-index
1–5 of 796
340
Massachusetts Institute of Technology
Cambridge, United States
17 h-index
33 publications
9.3K citations
University of Illinois Urbana-Champaign
Urbana, United States
13 h-index
26 publications
1.6K citations
Technion – Israel Institute of Technology
Haifa, Israel
12 h-index
21 publications
944 citations
University of California, Los Angeles
Los Angeles, United States
11 h-index
26 publications
1.2K citations
Tsinghua University
Beijing, China
9 h-index
25 publications
1.1K citations
Stanford University
Stanford, United States
8 h-index
19 publications
3.6K citations
Iowa State University
Ames, United States
7 h-index
8 publications
510 citations

Centre National de la Recherche Scientifique
Paris, France
7 h-index
11 publications
344 citations
1–8 of 340
20 publications · 3.8K citations
19
h-index
Repository · 26 publications · 862 citations
17
h-index
8 publications · 523 citations
8
h-index
JACM · 8 publications · 957 citations
8
h-index
8 publications · 552 citations
8
h-index
1–5