The asymmetric leader election algorithm: another approach
From MaRDI portal
Publication:659767
DOI10.1007/s00026-009-0004-2zbMath1233.68175OpenAlexW2026023515MaRDI QIDQ659767
Guy Louchard, Prodinger, Helmut
Publication date: 24 January 2012
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-009-0004-2
Related Items (9)
The multiplicity of left-to-right maxima in geometrically distributed words ⋮ Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution ⋮ The truncated geometric election algorithm: duration of the election ⋮ Survivors in leader election algorithms ⋮ On a leader election algorithm: truncated geometric case study ⋮ Geometric random variables: descents following maxima ⋮ Perpetuities in Fair Leader Election Algorithms ⋮ The asymmetric leader election algorithm: Number of survivors near the end of the game ⋮ Descents following maximal values in samples of geometric random variables
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- How to select a loser
- Rounding of continuous random variables and oscillatory asymptotics
- 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
- On the multiplicity of the maximum in a discrete random sample
- On gaps and unoccupied urns in sequences of geometrically distributed random variables
- Asymptotic and numerical studies of the leader election algorithm
This page was built for publication: The asymmetric leader election algorithm: another approach
