Asynchronous Leader Election
Asynchronous Leader Election is a distributed computing problem concerning the design of algorithms that enable a network of processes operating without global time or message delivery guarantees to converge on a single, unique process as the leader.
40
Publications
1.6K
Citations
83
Authors
51
Institutions
Publications per year
2017–2026
1
Parents
40
Symmetry breaking in distributive networks
Alon Itai, Michael Rodeh · 1981 · 96 citations
An asynchronous leader election algorithm for dynamic networks
Rebecca Ingram, Patrick Shields, Jennifer E. Walter et al. · 2009 · 73 citations
1–5 of 40
83
Institut de Recherche en Informatique et Systèmes Aléatoires, France
6 publications · 148 citations
6
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 83
51
Institut de Recherche en Informatique et Systèmes Aléatoires
Rennes, France
6 h-index
9 publications
233 citations
Université de Rennes
Rennes, France
5 h-index
8 publications
221 citations
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
12 publications
567 citations
Universidad Rey Juan Carlos
Madrid, Spain
3 h-index
3 publications
73 citations
Texas A&M University
College Station, United States
3 h-index
4 publications
183 citations

University of Ottawa
Ottawa, Canada
2 h-index
2 publications
72 citations

University of Victoria
Victoria, Canada
2 h-index
5 publications
189 citations
University of Southern California
Los Angeles, United States
2 h-index
2 publications
81 citations
1–8 of 51
3 publications · 65 citations
3
h-index
2 publications · 59 citations
2
h-index
2 publications · 73 citations
2
h-index
2 publications · 29 citations
2
h-index
TPDS · 2 publications · 52 citations
2
h-index
1–5