Deterministic Communication Complexity

Deterministic Communication Complexity is the minimum number of bits that must be exchanged between two deterministic parties in a communication model to compute a function whose inputs are distributed between them, distinguishing it from probabilistic or nondeterministic variants by requiring exact computation without randomness or error.

43

Publications

1.9K

Citations

63

Authors

36

Institutions

Publications per year

2017–2026

4

Authors

63

  1. EK
    Eyal Kushilevitz

    Technion – Israel Institute of Technology, Israel

    6 publications · 252 citations

    6

    h-index

  2. NN
    Noam Nisan

    Hebrew University of Jerusalem, Israel

    6 publications · 467 citations

    6

    h-index

  3. SL
    Shachar Lovett

    University of California San Diego, United States

    4 publications · 78 citations

    4

    h-index

  4. RK
    Robin Kothari

    University of Waterloo, Canada

    2 publications · 41 citations

    2

    h-index

  5. AE
    Abbas El Gamal

    Stanford University, United States

    2 publications · 74 citations

    2

    h-index

1–5 of 63

Venues

  1. SIAM Journal on Computing

    6 publications · 399 citations

    6

    h-index

  2. arXiv (Cornell University)

    Repository · 3 publications · 61 citations

    3

    h-index

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

    Repository · 2 publications · 32 citations

    2

    h-index

  4. Discrete Applied Mathematics

    1 publications · 12 citations

    1

    h-index

  5. Review of Communication Research

    1 publications · 35 citations

    1

    h-index

1–5