Deterministic Communication Complexity
Deterministic Communication Complexity is the minimum number of bits that must be exchanged between two deterministic parties in a communication model to compute a function whose inputs are distributed between them, distinguishing it from probabilistic or nondeterministic variants by requiring exact computation without randomness or error.
43
Publications
1.9K
Citations
63
Authors
36
Institutions
Publications per year
2017–2026
4
Parents
43
Rounds in Communication Complexity Revisited
Noam Nisan, Avi Wigderson · SIAM Journal on Computing · 1993 · 169 citations
Communication complexity of common voting rules
Vincent Conitzer, Tüomas Sandholm · 2005 · 137 citations · Full text
Amortized Communication Complexity
Tomás Feder, Eyal Kushilevitz, Moni Naor et al. · SIAM Journal on Computing · 1995 · 119 citations
1–5 of 43
63
6
h-index
6
h-index
4
h-index
2
h-index
2
h-index
1–5 of 63
36
Technion – Israel Institute of Technology
Haifa, Israel
6 h-index
12 publications
509 citations
Hebrew University of Jerusalem
Jerusalem, Israel
5 h-index
7 publications
293 citations
Stanford University
Stanford, United States
3 h-index
4 publications
159 citations
University of California San Diego
San Diego, United States
3 h-index
6 publications
134 citations

McGill University
Montreal, Canada
2 h-index
4 publications
106 citations
Tsinghua University
Beijing, China
2 h-index
2 publications
52 citations

Sun Yat-sen University
Guangzhou, China
2 h-index
3 publications
74 citations
AT&T (United States)
Bedminster, United States
2 h-index
2 publications
46 citations
1–8 of 36
6 publications · 399 citations
6
h-index
Repository · 3 publications · 61 citations
3
h-index
Repository · 2 publications · 32 citations
2
h-index
1 publications · 12 citations
1
h-index
1 publications · 35 citations
1
h-index
1–5