Randomized Distributed Algorithms
Randomized Distributed Algorithms is a class of distributed algorithms that incorporates randomness as a fundamental mechanism to achieve coordination, fault tolerance, or efficiency in a decentralized computational environment where processes operate concurrently and communicate through message passing.
195
Publications
13.7K
Citations
370
Authors
189
Institutions
Publications per year
2017–2026
41
195
Stephen Boyd, Aritra Ghosh, Balaji Prabhakar et al. · IEEE Transactions on Information Theory · 2006 · 2.5K citations
Akshay Kashyap, Tamer Başar, R. Srikant · Automatica · 2007 · 756 citations
A Scheme for Fast Parallel Communication
Leslie G. Valiant · SIAM Journal on Computing · 1982 · 649 citations
Michael O. Rabin · 1983 · 585 citations
1–5 of 195
370
12
h-index
9
h-index
8
h-index
7
h-index
6
h-index
1–5 of 370
189
Massachusetts Institute of Technology
Cambridge, United States
15 h-index
29 publications
5.3K citations
Politecnico di Torino
Turin, Italy
13 h-index
21 publications
1.5K citations
ETH Zurich
Zurich, Switzerland
10 h-index
17 publications
911 citations
Tokyo Institute of Technology
Tokyo, Japan
10 h-index
11 publications
464 citations
Technion – Israel Institute of Technology
Haifa, Israel
10 h-index
16 publications
523 citations
Institute of Electronics, Computer and Telecommunication Engineering
Turin, Italy
8 h-index
9 publications
419 citations
University of California, Berkeley
Berkeley, United States
7 h-index
14 publications
1.3K citations
Nanyang Technological University
Singapore, Singapore
7 h-index
12 publications
600 citations
1–8 of 189
Repository · 7 publications · 154 citations
7
h-index
5 publications · 297 citations
5
h-index
5 publications · 789 citations
5
h-index
JACM · 4 publications · 285 citations
4
h-index
TPDS · 3 publications · 146 citations
3
h-index
1–5