Survivors in leader election algorithms
From MaRDI portal
Publication:2439651
DOI10.1016/j.spl.2013.09.011zbMath1285.68211MaRDI QIDQ2439651
Hosam M. Mahmoud, Ravi Kalpathy, Walter A. Rosenkrantz
Publication date: 14 March 2014
Published in: Statistics \& Probability Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.spl.2013.09.011
68W40: Analysis of algorithms
60F05: Central limit and other weak theorems
60E05: Probability distributions: general theory
68W20: Randomized algorithms
Related Items
The asymmetric leader election algorithm: Number of survivors near the end of the game, Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution, On a leader election algorithm: truncated geometric case study
Cites Work
- The asymmetric leader election algorithm: another approach
- How to select a loser
- On distributional properties of perpetuities
- Some asymptotic theory for the bootstrap
- 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
- Asymptotic Properties of a Leader Election Algorithm
- On a stochastic difference equation and a representation of non–negative infinitely divisible random variables
- Convergence of some leader election algorithms
- Perpetuities in Fair Leader Election Algorithms
- Unnamed Item
- Unnamed Item