Randomized Communication Complexity
Randomized Communication Complexity is a measure in computational complexity theory that quantifies the minimum amount of communication required between two parties to compute a function with high probability, using randomized protocols, where the randomness may depend on both inputs and public/private coins.
67
Publications
3.9K
Citations
96
Authors
68
Institutions
Publications per year
2017–2026
4
67
The discrepancy method: randomness and complexity
Choice Reviews Online · 2002 · 365 citations
On Randomized One-round Communication Complexity
Ilan Kremer, Noam Nisan, Dorit Ron · Computational Complexity · 1999 · 174 citations
Rounds in Communication Complexity Revisited
Noam Nisan, Avi Wigderson · SIAM Journal on Computing · 1993 · 169 citations
Randomized Byzantine Agreements
Sam Toueg · 1984 · 156 citations
1–5 of 67
96
5
h-index
5
h-index
5
h-index
5
h-index
4
h-index
1–5 of 96
68
University of Washington
Seattle, United States
8 h-index
10 publications
364 citations
Hebrew University of Jerusalem
Jerusalem, Israel
6 h-index
11 publications
757 citations
Université Paris Cité
Paris, France
5 h-index
7 publications
213 citations

University of Toronto
Toronto, Canada
5 h-index
6 publications
241 citations
Princeton University
Princeton, United States
4 h-index
6 publications
296 citations
National University of Singapore
Singapore, Singapore
4 h-index
10 publications
226 citations
Stanford University
Stanford, United States
4 h-index
5 publications
200 citations
Centre for Quantum Technologies
Singapore, Singapore
4 h-index
7 publications
307 citations
1–8 of 68
8 publications · 409 citations
8
h-index
CC · 4 publications · 368 citations
4
h-index
Repository · 4 publications · 60 citations
4
h-index
Repository · 3 publications · 44 citations
3
h-index
Repository · 2 publications · 87 citations
2
h-index
1–5