Multi-party Communication Complexity
Multi-Party Communication Complexity is a model of communication complexity in which more than two parties, each holding a part of the input, must collaboratively compute a function while minimizing the total number of bits communicated across all parties, thereby extending the standard two-party communication paradigm to distributed settings with multiple participants.
51
Publications
3.5K
Citations
97
Authors
59
Institutions
Publications per year
2017–2026
2
Parents
51
Quantum vs. classical communication and computation
Harry Buhrman, Richard Cleve, Avi Wigderson · 1998 · 345 citations · Full text
Ashok Chandra, Merrick L. Furst, Richard J. Lipton · 1983 · 269 citations
Communication complexity of secure computation (extended abstract)
Matthew Franklin, Moti Yung · 1992 · 262 citations · Full text
1–5 of 51
97
6
h-index
4
h-index
3
h-index
3
h-index
2
h-index
1–5 of 97
59

Institute for Advanced Study
Princeton, United States
5 h-index
7 publications
552 citations
Centrum Wiskunde & Informatica
Amsterdam, The Netherlands
4 h-index
5 publications
722 citations
University of Chicago
Chicago, United States
3 h-index
3 publications
221 citations

Weizmann Institute of Science
Rehovot, Israel
3 h-index
4 publications
167 citations

University of Toronto
Toronto, Canada
3 h-index
4 publications
97 citations

McGill University
Montreal, Canada
3 h-index
3 publications
94 citations
Stanford University
Stanford, United States
3 h-index
5 publications
196 citations
University of Washington
Seattle, United States
3 h-index
5 publications
128 citations
1–8 of 59
5 publications · 302 citations
5
h-index
PRA · 3 publications · 148 citations
3
h-index
CC · 3 publications · 135 citations
3
h-index
2 publications · 195 citations
2
h-index
Repository · 2 publications · 149 citations
2
h-index
1–5