Randomized Communication Complexity

Randomized Communication Complexity is a measure in computational complexity theory that quantifies the minimum amount of communication required between two parties to compute a function with high probability, using randomized protocols, where the randomness may depend on both inputs and public/private coins.

67

Publications

3.9K

Citations

96

Authors

68

Institutions

Publications per year

2017–2026

4

Authors

96

  1. HK
    Hartmut Klauck

    Centre for Quantum Technologies, Singapore

    5 publications · 262 citations

    5

    h-index

  2. RJ
    Rahul Jain

    National University of Singapore, Singapore

    5 publications · 169 citations

    5

    h-index

  3. MB
    Mark Braverman

    Princeton University, United States

    5 publications · 292 citations

    5

    h-index

  4. TS
    T. S. Jayram

    IBM Research - Almaden, United States

    5 publications · 194 citations

    5

    h-index

  5. QZ
    Qin Zhang

    Indiana University Bloomington, United States

    4 publications · 168 citations

    4

    h-index

1–5 of 96

Venues

  1. SIAM Journal on Computing

    8 publications · 409 citations

    8

    h-index

  2. Computational Complexity

    CC · 4 publications · 368 citations

    4

    h-index

  3. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 4 publications · 60 citations

    4

    h-index

  4. arXiv (Cornell University)

    Repository · 3 publications · 44 citations

    3

    h-index

  5. ArXiv.org

    Repository · 2 publications · 87 citations

    2

    h-index

1–5