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
110
The round complexity of secure protocols
Donald Beaver, Silvio Micali, Phillip Rogaway · 1990 · 721 citations · Full text
On the Composition of Zero-Knowledge Proof Systems
Oded Goldreich, Hugo Krawczyk · SIAM Journal on Computing · 1996 · 427 citations
On Randomized One-round Communication Complexity
Ilan Kremer, Noam Nisan, Dorit Ron · Computational Complexity · 1999 · 174 citations
Rounds in Communication Complexity Revisited
Noam Nisan, Avi Wigderson · SIAM Journal on Computing · 1993 · 169 citations
1–5 of 110
214
7
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 214
129
Massachusetts Institute of Technology
Cambridge, United States
9 h-index
9 publications
1.8K citations

Tel Aviv University
Tel Aviv, Israel
7 h-index
11 publications
506 citations
Technion – Israel Institute of Technology
Haifa, Israel
6 h-index
10 publications
268 citations
University of Maryland, College Park
College Park, United States
5 h-index
7 publications
231 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
9 publications
264 citations

Weizmann Institute of Science
Rehovot, Israel
5 h-index
7 publications
466 citations
ETH Zurich
Zurich, Switzerland
5 h-index
5 publications
73 citations
Microsoft (United States)
Redmond, United States
4 h-index
5 publications
122 citations
1–8 of 129
Repository · 7 publications · 103 citations
7
h-index
5 publications · 681 citations
5
h-index
Repository · 5 publications · 67 citations
5
h-index
TPDS · 4 publications · 103 citations
4
h-index
PoPETs · 3 publications · 106 citations
4
h-index
1–5