Round Complexity

Round Complexity is the measure of the minimum number of communication rounds required by a protocol to solve a given problem in the context of Communication Complexity or Secure Multi-Party Computation, distinguishing it from other complexity measures by focusing specifically on the temporal structure of interactions.

110

Publications

5.2K

Citations

214

Authors

129

Institutions

Publications per year

2017–2026

37

Authors

214

  1. MG
    Mohsen Ghaffari

    ETH Zurich, Switzerland

    6 publications · 141 citations

    7

    h-index

  2. NN
    Noam Nisan

    Hebrew University of Jerusalem, Israel

    4 publications · 443 citations

    4

    h-index

  3. FK
    Fabian Kühn

    ETH Zurich, Switzerland

    4 publications · 119 citations

    4

    h-index

  4. BP
    Boaz Patt-Shamir

    Tel Aviv University, Israel

    4 publications · 123 citations

    4

    h-index

  5. BH
    Bernhard Haeupler

    Carnegie Mellon University, United States

    3 publications · 73 citations

    3

    h-index

1–5 of 214

Venues

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

    Repository · 7 publications · 103 citations

    7

    h-index

  2. SIAM Journal on Computing

    5 publications · 681 citations

    5

    h-index

  3. arXiv (Cornell University)

    Repository · 5 publications · 67 citations

    5

    h-index

  4. IEEE Transactions on Parallel and Distributed Systems

    TPDS · 4 publications · 103 citations

    4

    h-index

  5. Proceedings on Privacy Enhancing Technologies

    PoPETs · 3 publications · 106 citations

    4

    h-index

1–5