Randomized Parallel Algorithms
Randomized Parallel Algorithms is a computational method that belongs to the class of parallel algorithms and is distinguished by its incorporation of randomness in its operations to achieve efficiency and correctness guarantees in parallel computation.
127
Publications
9.7K
Citations
209
Authors
109
Institutions
Publications per year
2017–2026
10
127
A Simple Parallel Algorithm for the Maximal Independent Set Problem
Michael Luby · SIAM Journal on Computing · 1986 · 1.1K citations
A Scheme for Fast Parallel Communication
Leslie G. Valiant · SIAM Journal on Computing · 1982 · 649 citations
Universal schemes for parallel communication
Leslie G. Valiant, Gordon Brebner · 1981 · 631 citations
1–5 of 127
209
7
h-index
4
h-index
4
h-index
4
h-index
4
h-index
1–5 of 209
109
University of California, Berkeley
Berkeley, United States
10 h-index
17 publications
1.4K citations
Massachusetts Institute of Technology
Cambridge, United States
8 h-index
12 publications
1.2K citations
Duke University
Durham, United States
7 h-index
14 publications
594 citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
12 publications
412 citations
ETH Zurich
Zurich, Switzerland
6 h-index
11 publications
342 citations

Tel Aviv University
Tel Aviv, Israel
5 h-index
7 publications
1.6K citations
New York University
New York, United States
5 h-index
6 publications
1.1K citations
Courant Institute of Mathematical Sciences
New York, United States
5 h-index
5 publications
273 citations
1–8 of 109
14 publications · 2.5K citations
14
h-index
Repository · 5 publications · 112 citations
5
h-index
4 publications · 143 citations
4
h-index
4 publications · 968 citations
4
h-index
Conference · 2 publications · 25 citations
2
h-index
1–5