Analysis of an asymmetric leader election algorithm
From MaRDI portal
Publication:1378508
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
Related Items
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, A binomial splitting process in connection with corner parking problems, Perpetuities in Fair Leader Election Algorithms, Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution, The asymmetric leader election algorithm: another approach, 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, Gap-free compositions and gap-free samples of geometric random variables, Sorting algorithms for broadcast communications: mathematical analysis., Block size in geometric(\(p\))-biased permutations, 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, Gaps in samples of geometric random variables, A probabilistic analysis of some tree algorithms, Asymptotic Properties of a Leader Election Algorithm, Leader election using random walks
