The asymmetric leader election algorithm: another approach

DOI10.1007/S00026-009-0004-2MaRDI QIDQ659767zbMATH OpenOpenAlexFDO

Authors Guy Louchard, Helmut Prodinger

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

zbMATH Keywords

Mellin transformleader electionGumbel distributionurn model

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Combinatorial probability (60C05)

Recommendations

• Analysis of an asymmetric leader election algorithm
• The asymmetric leader election algorithm: number of survivors near the end of the game
• Asymptotic and numerical studies of the leader election algorithm
• Asymptotic analysis of a leader election algorithm
• Asymptotic properties of a leader election algorithm

Cites work

• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• A probabilistic analysis of a leader election algorithm
• Analysis of an asymmetric leader election algorithm
• Asymptotic and numerical studies of the leader election algorithm
• Asymptotics of the moments of extreme-value related distribution functions
• How to select a loser
• On gaps and unoccupied urns in sequences of geometrically distributed random variables
• On the distribution for the duration of a randomized leader election algorithm
• On the multiplicity of the maximum in a discrete random sample
• Periodic oscillations in the analysis of algorithms and their cancellations
• Rounding of continuous random variables and oscillatory asymptotics
• The number of distinct values of some multiplicity in sequences of geometrically distributed random variables

Cited in

(13)

• A probabilistic analysis of a leader election algorithm
• 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
• Perpetuities in fair leader election algorithms
• Descents following maximal values in samples of geometric random variables
• The truncated geometric election algorithm: duration of the election
• The multiplicity of left-to-right maxima in geometrically distributed words
• Asymptotic and numerical studies of the leader election algorithm
• Asymptotic analysis of a leader election algorithm
• Survivors in leader election algorithms
• On a leader election algorithm: truncated geometric case study
• Geometric random variables: descents following maxima
• The asymmetric leader election algorithm with Swedish stopping: a probabilistic analysis

This page was built for publication: The asymmetric leader election algorithm: another approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659767)