Analysis of an asymmetric leader election algorithm

zbMath0884.05004MaRDI QIDQ1378508

Svante Janson, Wojciech Szpankowski

Publication date: 12 February 1998

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/119211

zbMATH Keywords

limiting distributionleader election algorithmelection process

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial probability (60C05)

Related Items (21)

Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution ⋮ Rounding of continuous random variables and oscillatory asymptotics ⋮ Quasi-optimal energy-efficient leader election algorithms in radio networks ⋮ Analytical depoissonization and its applications ⋮ Profiles of PATRICIA tries ⋮ An analytic approach to the asymptotic variance of trie statistics and related structures ⋮ Survivors in leader election algorithms ⋮ On a leader election algorithm: truncated geometric case study ⋮ The asymmetric leader election algorithm: another approach ⋮ Gaps in samples of geometric random variables ⋮ Asymptotic Properties of a Leader Election Algorithm ⋮ Block size in geometric(\(p\))-biased permutations ⋮ Perpetuities in Fair Leader Election Algorithms ⋮ A probabilistic analysis of some tree algorithms ⋮ Gap-free compositions and gap-free samples of geometric random variables ⋮ From coin tossing to rock-paper-scissors and beyond: a log-exp gap theorem for selecting a leader ⋮ Asymmetric Rényi Problem ⋮ The asymmetric leader election algorithm: Number of survivors near the end of the game ⋮ Leader election using random walks ⋮ A binomial splitting process in connection with corner parking problems ⋮ Sorting algorithms for broadcast communications: mathematical analysis.

This page was built for publication: Analysis of an asymmetric leader election algorithm