Communication Complexity Upper Bounds is a theoretical construct in computational complexity theory that specifies the maximum amount of communication required between distributed parties to compute a function, serving as an upper limit on the minimum number of bits that must be exchanged to solve a given problem.
403
Publications
19.8K
Citations
545
Authors
234
Institutions
Publications per year
2017–2026
29
Parents
Publications
403
The round complexity of secure protocols
Donald Beaver, Silvio Micali, Phillip Rogaway · 1990 · 721 citations · Full text
Perfectly secure message transmission
Danny Dolev, Cynthia Dwork, Orli Waarts et al. · Journal of the ACM · 1993 · 421 citations · Full text
1–5 of 403
Authors
545
- AW
17
h-index
- NN
12
h-index
- HK
10
h-index
- DP
10
h-index
- TP
10
h-index
1–5 of 545
Institutions
234
Hebrew University of Jerusalem
Jerusalem, Israel
21 h-index
39 publications
2.8K citations
Weizmann Institute of Science
Rehovot, Israel
16 h-index
20 publications
1K citations
Princeton University
Princeton, United States
16 h-index
32 publications
2.4K citations
Stanford University
Stanford, United States
14 h-index
21 publications
1.2K citations
Massachusetts Institute of Technology
Cambridge, United States
13 h-index
26 publications
2.8K citations
Institute for Advanced Study
Princeton, United States
13 h-index
19 publications
1.2K citations
Carnegie Mellon University
Pittsburgh, United States
13 h-index
18 publications
813 citations
Technion – Israel Institute of Technology
Haifa, Israel
13 h-index
29 publications
1.1K citations
1–8 of 234
Venues
- SIAM Journal on Computing
23 publications · 1.2K citations
18
h-index
- IEEE Transactions on Information Theory
16 publications · 924 citations
15
h-index
- Journal of the ACM
JACM · 14 publications · 1.1K citations
12
h-index
- Journal of Computer and System Sciences
13 publications · 803 citations
12
h-index
- arXiv (Cornell University)
Repository · 12 publications · 314 citations
11
h-index
1–5