Randomized Consensus Algorithms
Randomized Consensus Algorithms is a class of distributed algorithms that achieve agreement among asynchronous processes in the presence of faults by employing randomization to circumvent deterministic impossibility results, distinguishing it from deterministic consensus protocols through its probabilistic termination and decision guarantees.
93
Publications
4.6K
Citations
169
Authors
97
Institutions
Publications per year
2017–2026
17
Variants
Randomized Consensus Algorithm
Parents
93
Akshay Kashyap, Tamer Başar, R. Srikant · Automatica · 2007 · 756 citations
Randomized protocols for asynchronous consensus
James Aspnes · Distributed Computing · 2003 · 171 citations
1–5 of 93
169
13
h-index
8
h-index
6
h-index
6
h-index
5
h-index
1–5 of 169
97
Yale University
New Haven, United States
10 h-index
13 publications
433 citations
Politecnico di Torino
Turin, Italy
9 h-index
16 publications
1.2K citations
Tokyo Institute of Technology
Tokyo, Japan
8 h-index
11 publications
421 citations
Technion – Israel Institute of Technology
Haifa, Israel
8 h-index
12 publications
392 citations
Institute of Electronics, Computer and Telecommunication Engineering
Turin, Italy
5 h-index
5 publications
231 citations

University of Liverpool
Liverpool, United Kingdom
4 h-index
4 publications
174 citations

University of Toronto
Toronto, Canada
4 h-index
4 publications
104 citations
University of Illinois Urbana-Champaign
Urbana, United States
4 h-index
12 publications
2.6K citations
1–8 of 97
8 publications · 381 citations
8
h-index
5 publications · 926 citations
5
h-index
5 publications · 203 citations
5
h-index
JACM · 4 publications · 218 citations
4
h-index
2 publications · 51 citations
2
h-index
1–5