Message Complexity
Message Complexity is a metric in distributed computing that quantifies the total number of messages required by a leader election algorithm to achieve consensus, distinguishing it from other complexity measures by focusing exclusively on communication overhead.
374
Publications
19.3K
Citations
796
Authors
337
Institutions
Publications per year
2017–2026
40
Parents
374
Sensor relocation in mobile sensor networks
Guiling Wang, Guohong Cao, Thomas La Porta et al. · 2005 · 498 citations
1–5 of 374
796
8
h-index
7
h-index
7
h-index
7
h-index
7
h-index
1–5 of 796
337
Massachusetts Institute of Technology
Cambridge, United States
14 h-index
22 publications
2.1K citations
Technion – Israel Institute of Technology
Haifa, Israel
13 h-index
30 publications
1K citations
Hebrew University of Jerusalem
Jerusalem, Israel
10 h-index
13 publications
896 citations
The Ohio State University
Columbus, United States
10 h-index
21 publications
811 citations
University of Illinois Urbana-Champaign
Urbana, United States
9 h-index
9 publications
269 citations

Pennsylvania State University
State College, United States
9 h-index
23 publications
4K citations
ETH Zurich
Zurich, Switzerland
8 h-index
11 publications
323 citations

Illinois Institute of Technology
Chicago, United States
7 h-index
18 publications
6.2K citations
1–8 of 337
TPDS · 12 publications · 548 citations
12
h-index
JACM · 12 publications · 621 citations
11
h-index
Repository · 8 publications · 114 citations
8
h-index
TMCCI · 8 publications · 1.1K citations
8
h-index
6 publications · 208 citations
6
h-index
1–5