Two-Party Communication Complexity is a theoretical framework in computational complexity theory that quantifies the minimum amount of communication required between two parties, each holding a portion of the input, to compute a joint function of their inputs.
47
Publications
2.7K
Citations
68
Authors
45
Institutions
Publications per year
2017–2026
2
Parents
Publications
47
Quantum vs. classical communication and computation
Harry Buhrman, Richard Cleve, Avi Wigderson · 1998 · 345 citations · Full text
Rounds in Communication Complexity Revisited
Noam Nisan, Avi Wigderson · SIAM Journal on Computing · 1993 · 169 citations
Privacy and communication complexity
Eyal Kushilevitz · 1989 · 161 citations
1–5 of 47
Authors
68
- MB
6
h-index
- AW
5
h-index
- OW
4
h-index
- RJ
4
h-index
- HB
4
h-index
1–5 of 68
Institutions
45
University of Washington
Seattle, United States
7 h-index
8 publications
374 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
5 h-index
10 publications
762 citations
Princeton University
Princeton, United States
5 h-index
8 publications
446 citations
Institute for Advanced Study
Princeton, United States
3 h-index
3 publications
98 citations
University of Toronto
Toronto, Canada
3 h-index
3 publications
187 citations
Stanford University
Stanford, United States
3 h-index
5 publications
204 citations
University of Chicago
Chicago, United States
3 h-index
3 publications
165 citations
National University of Singapore
Singapore, Singapore
3 h-index
6 publications
165 citations
1–8 of 45
Venues
- arXiv (Cornell University)
Repository · 5 publications · 75 citations
5
h-index
- IEEE Transactions on Information Theory
2 publications · 71 citations
2
h-index
- Physical Review Letters
PRL · 2 publications · 208 citations
2
h-index
- Symposium on Discrete Algorithms
Conference · 2 publications · 65 citations
2
h-index
- ArXiv.org
Repository · 2 publications · 96 citations
2
h-index
1–5