Message Complexity In Distributed Computation
Message Complexity in Distributed Computation is a metric in theoretical computer science that quantifies the total number of messages required by a distributed algorithm to solve a problem, distinguishing it from other complexity measures by focusing exclusively on inter-process communication overhead rather than time or computational resources.
175
Publications
9.9K
Citations
379
Authors
189
Institutions
Publications per year
2017–2026
20
Parents
175
The round complexity of secure protocols
Donald Beaver, Silvio Micali, Phillip Rogaway · 1990 · 721 citations · Full text
1–5 of 175
379
9
h-index
6
h-index
6
h-index
5
h-index
5
h-index
1–5 of 379
189
Technion – Israel Institute of Technology
Haifa, Israel
11 h-index
26 publications
914 citations
Massachusetts Institute of Technology
Cambridge, United States
10 h-index
19 publications
3K citations

Weizmann Institute of Science
Rehovot, Israel
7 h-index
9 publications
450 citations

Pennsylvania State University
State College, United States
6 h-index
12 publications
1.9K citations
ETH Zurich
Zurich, Switzerland
5 h-index
7 publications
192 citations
The Ohio State University
Columbus, United States
5 h-index
9 publications
187 citations

Université du Québec en Outaouais
Gatineau, Canada
4 h-index
4 publications
74 citations
Stanford University
Stanford, United States
4 h-index
6 publications
211 citations
1–8 of 189
TPDS · 9 publications · 437 citations
9
h-index
JACM · 7 publications · 232 citations
7
h-index
5 publications · 393 citations
5
h-index
4 publications · 67 citations
4
h-index
TSE · 4 publications · 185 citations
4
h-index
1–5