Communication Complexity Of Boolean Functions

The Communication Complexity of Boolean Functions is a computational complexity measure that quantifies the minimum amount of communication required between two or more parties to compute a Boolean function whose input is distributed among them, distinguishing it from other complexity measures by focusing specifically on the information exchange necessary to evaluate the function correctly.

70

Publications

3.7K

Citations

97

Authors

59

Institutions

Publications per year

2017–2026

2

Authors

97

  1. EK
    Eyal Kushilevitz

    Technion – Israel Institute of Technology, Israel

    5 publications · 194 citations

    5

    h-index

  2. AW
    Avi Wigderson

    Hebrew University of Jerusalem, Israel

    5 publications · 331 citations

    5

    h-index

  3. HK
    Hartmut Klauck

    Centre for Quantum Technologies, Singapore

    5 publications · 219 citations

    5

    h-index

  4. SL
    Shachar Lovett

    University of California San Diego, United States

    5 publications · 191 citations

    5

    h-index

  5. AA
    Alexander A. Sherstov

    The University of Texas at Austin, United States

    4 publications · 164 citations

    4

    h-index

1–5 of 97

Venues

  1. SIAM Journal on Computing

    9 publications · 992 citations

    9

    h-index

  2. ArXiv.org

    Repository · 4 publications · 131 citations

    4

    h-index

  3. arXiv (Cornell University)

    Repository · 3 publications · 83 citations

    3

    h-index

  4. 2

    h-index

  5. Information and Computation

    2 publications · 61 citations

    2

    h-index

1–5