The asymmetric leader election algorithm: Number of survivors near the end of the game
DOI10.2989/16073606.2015.1023987zbMath1430.68443OpenAlexW2182485025MaRDI QIDQ5233905
Publication date: 9 September 2019
Published in: Quaestiones Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2989/16073606.2015.1023987
Gumbel distributionanalytic combinatoricsurn modellimiting distribution functionsasymmetric leader election algorithmMellin-Laplace technique for harmonic sumsnumber of rounds until leader has been identifiednumber of survivors near end of game
Analysis of algorithms (68W40) Combinatorics in computer science (68R05) Combinatorial probability (60C05) Distributed systems (68M14) Randomized algorithms (68W20) Probabilistic games; gambling (91A60)
Cites Work
- Unnamed Item
- Unnamed Item
- The asymmetric leader election algorithm: another approach
- Mellin transforms and asymptotics: Harmonic sums
- How to select a loser
- Asymptotics of the moments of extreme-value related distribution functions
- On the distribution for the duration of a randomized leader election algorithm
- Analysis of an asymmetric leader election algorithm
- Number of survivors in the presence of a demon
- Survivors in leader election algorithms
- On gaps and unoccupied urns in sequences of geometrically distributed random variables
- Asymptotic analysis of a leader election algorithm
- Distinctness of compositions of an integer: A probabilistic analysis
- Asymptotic Properties of a Leader Election Algorithm
- Convergence of some leader election algorithms
- Asymptotic and numerical studies of the leader election algorithm
- The Swedish Leader Election Protocol: Analysis and Variations
- Perpetuities in Fair Leader Election Algorithms
This page was built for publication: The asymmetric leader election algorithm: Number of survivors near the end of the game
