Asymptotic analysis of a leader election algorithm
From MaRDI portal
Publication:2503299
Recommendations
- Analysis of an asymmetric leader election algorithm
- The asymmetric leader election algorithm: another approach
- Asymptotic and numerical studies of the leader election algorithm
- The asymmetric leader election algorithm: number of survivors near the end of the game
- Asymptotic properties of a leader election algorithm
Cites work
- Asymptotics of the moments of extreme-value related distribution functions
- How to select a loser
- scientific article; zbMATH DE number 3649136 (Why is no real title available?)
- scientific article; zbMATH DE number 3176961 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3437452 (Why is no real title available?)
- On the distribution for the duration of a randomized leader election algorithm
- Symmetry breaking in distributed networks
Cited in
(11)- On the distribution for the duration of a randomized leader election algorithm
- Leader election in the presence of n-1 initial failures
- Configuration symmetry and performance upper bound of one-dimensional cellular automata for the leader election problem
- A probabilistic analysis of a leader election algorithm
- Asymptotic and numerical studies of the leader election algorithm
- Exponential Separations in the Energy Complexity of Leader Election
- The asymmetric leader election algorithm: number of survivors near the end of the game
- Leader election: a Markov chain approach
- The asymmetric leader election algorithm: another approach
- Cost distribution of the Chang-Roberts leader election algorithm and related problems
- The truncated geometric election algorithm: duration of the election
This page was built for publication: Asymptotic analysis of a leader election algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503299)