Tree-based Leader Election
Tree-Based Leader Election is a distributed leader election protocol in which processes are organized into a tree topology and election proceeds via hierarchical message passing from leaves to root or vice versa, distinguishing it from general graph-based or ring-based election algorithms by exploiting the tree structure for efficient coordination.
10
Publications
292
Citations
32
Authors
19
Institutions
Publications per year
2017–2026
5
Parents
10
Ray Neiheiser, Miguel Matos · 2021 · 65 citations · Full text
Improved algorithms for leader election in distributed systems
MohammadReza EffatParvar, Nasser Yazdani, Mehdi Effatparvar et al. · 2010 · 44 citations
Efficient elections in chordal ring networks
Hagit Attiya, Jan Van Leeuwen, Nicola Santoro et al. · Algorithmica · 1989 · 41 citations
1–5 of 10
32
3
h-index
3
h-index
3
h-index
2
h-index
Institute of Electronics, Computer and Telecommunication Engineering, Italy
1 publications · 27 citations
1
h-index
1–5 of 32
19

Université de Bretagne Occidentale
Brest, France
3 h-index
8 publications
138 citations

University of Boumerdes
Boumerdas, Algeria
3 h-index
3 publications
53 citations
École nationale supérieure de techniques avancées Bretagne
Brest, France
2 h-index
2 publications
37 citations
Laboratoire des Sciences et Techniques de l’Information de la Communication et de la Connaissance
Brest, France
2 h-index
7 publications
132 citations
University of Béjaïa
Béjaïa, Algeria
2 h-index
3 publications
48 citations

Manchester Metropolitan University
Manchester, United Kingdom
1 h-index
2 publications
32 citations

Carleton University
Ottawa, Canada
1 h-index
1 publications
41 citations
Antalya Bilim University
Antalya, Türkiye
1 h-index
1 publications
16 citations
1–8 of 19
TALG · 1 publications · 27 citations
1
h-index
MONET · 1 publications · 16 citations
1
h-index
1 publications · 41 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 34 citations
1
h-index
1–5