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

Authors

97

  1. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    6 publications · 718 citations

    6

    h-index

  2. PB
    Paul Beame

    University of Washington, United States

    4 publications · 96 citations

    4

    h-index

  3. HB
    Harry Buhrman

    Centrum Wiskunde & Informatica, Netherlands

    3 publications · 546 citations

    3

    h-index

  4. TP
    Toniann Pitassi

    University of Toronto, Canada

    3 publications · 81 citations

    3

    h-index

  5. AC
    Arkadev Chattopadhyay

    McGill University, Canada

    2 publications · 78 citations

    2

    h-index

1–5 of 97

Venues

  1. SIAM Journal on Computing

    5 publications · 302 citations

    5

    h-index

  2. Physical Review A

    PRA · 3 publications · 148 citations

    3

    h-index

  3. Computational Complexity

    CC · 3 publications · 135 citations

    3

    h-index

  4. SIAM Journal on Discrete Mathematics

    2 publications · 195 citations

    2

    h-index

  5. ArXiv.org

    Repository · 2 publications · 149 citations

    2

    h-index

1–5