Communication Complexity

Communication Complexity is a theoretical framework in computational complexity theory that quantifies the minimum amount of communication required between distributed parties to compute a function whose inputs are partitioned among them.

2.6K

Publications

139.7K

Citations

4.3K

Authors

1.1K

Institutions

Publications per year

2017–2026

444

Authors

4.3K

  1. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    23 publications · 1.8K citations

    20

    h-index

  2. DP
    David Peleg

    Weizmann Institute of Science, Israel

    27 publications · 1.8K citations

    19

    h-index

  3. HK
    Hartmut Klauck

    Centre for Quantum Technologies, Singapore

    20 publications · 919 citations

    18

    h-index

  4. HB
    Harry Buhrman

    Centrum Wiskunde & Informatica, Netherlands

    20 publications · 3.6K citations

    17

    h-index

  5. SA
    Syed A. Jafar

    University of California, Irvine, United States

    18 publications · 1.5K citations

    17

    h-index

1–5 of 4.3K

Venues

  1. IEEE Transactions on Information Theory

    179 publications · 14.1K citations

    56

    h-index

  2. SIAM Journal on Computing

    73 publications · 5.1K citations

    40

    h-index

  3. IEEE Transactions on Communications

    74 publications · 4.9K citations

    32

    h-index

  4. IEEE Transactions on Signal Processing

    40 publications · 5.3K citations

    30

    h-index

  5. arXiv (Cornell University)

    Repository · 115 publications · 3.2K citations

    28

    h-index

1–5