Communication Complexity
Communication Complexity is a theoretical framework in computational complexity theory that quantifies the minimum amount of communication required between distributed parties to compute a function whose inputs are partitioned among them.
2.6K
Publications
139.7K
Citations
4.3K
Authors
1.1K
Institutions
Publications per year
2017–2026
444
Children
Boolean Formula SizeCommunication Complexity In StreamingCommunication Complexity Lower BoundsCommunication Complexity Of Boolean FunctionsCommunication Complexity Of Graph ProblemsCommunication Complexity Upper BoundsCommunication MatrixCommunication ProtocolsCommunication-efficient Data StructuresCorrelation Complexity
2.6K
Harry Buhrman, Richard Cleve, John Watrous et al. · Physical Review Letters · 2001 · 1.2K citations · Full text
Computing, Computer Science, Physics +12
1–5 of 2.6K
4.3K
20
h-index
19
h-index
18
h-index
17
h-index
17
h-index
1–5 of 4.3K
1.1K
Massachusetts Institute of Technology
Cambridge, United States
46 h-index
152 publications
15.5K citations
University of California, Berkeley
Berkeley, United States
33 h-index
121 publications
8.5K citations
Technion – Israel Institute of Technology
Haifa, Israel
32 h-index
100 publications
7.8K citations
Stanford University
Stanford, United States
32 h-index
95 publications
6K citations

Weizmann Institute of Science
Rehovot, Israel
31 h-index
69 publications
4.3K citations

Tel Aviv University
Tel Aviv, Israel
31 h-index
70 publications
4.1K citations
Princeton University
Princeton, United States
31 h-index
89 publications
7.3K citations
Hebrew University of Jerusalem
Jerusalem, Israel
29 h-index
62 publications
4.1K citations
1–8 of 1.1K
179 publications · 14.1K citations
56
h-index
73 publications · 5.1K citations
40
h-index
74 publications · 4.9K citations
32
h-index
40 publications · 5.3K citations
30
h-index
Repository · 115 publications · 3.2K citations
28
h-index
1–5