Deterministic Leader Election
Deterministic Leader Election is a leader election protocol that belongs to the class of distributed algorithms, specifically characterized by its use of predetermined rules and system states to guarantee a unique and predictable outcome in selecting a leader without reliance on randomness or probabilistic choices.
19
Publications
848
Citations
42
Authors
43
Institutions
Publications per year
2017–2026
6
Parents
19
1–5 of 19
42
2
h-index
2
h-index
2
h-index
2
h-index
2
h-index
1–5 of 42
43
University of Michigan
Ann Arbor, United States
2 h-index
5 publications
126 citations
Institut national de recherche en sciences et technologies du numérique
Le Chesnay-Rocquencourt, France
2 h-index
3 publications
90 citations
The University of Osaka
Osaka, Japan
2 h-index
4 publications
65 citations
Yale University
New Haven, United States
2 h-index
3 publications
384 citations
University of California, Riverside
Riverside, United States
2 h-index
2 publications
99 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
5 publications
85 citations
University of Nevada, Las Vegas
Las Vegas, United States
2 h-index
4 publications
58 citations

Wrocław University of Science and Technology
Wroclaw, Poland
2 h-index
3 publications
140 citations
1–8 of 43
2 publications · 206 citations
2
h-index
TALG · 2 publications · 48 citations
2
h-index
Conference · 1 publications · 43 citations
1
h-index
1 publications · 56 citations
1
h-index
1 publications · 18 citations
1
h-index
1–5