Survivors in Leader Election Algorithms

DOI10.1137/1.9781611973204.11MaRDI QIDQ5194763zbMATH OpenOpenAlexFDO

Authors Ravi Kalpathy, Hosam M. Mahmoud, Walter A. Rosenkrantz

Publication date 17 September 2019

Published in 2014 Proceedings of the Eleventh Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611973204.11

Mathematics Subject Classification ID

Probability distributions: general theory (60E05) Central limit and other weak theorems (60F05) Randomized algorithms (68W20) Analysis of algorithms (68W40)

Recommendations

• Survivors in leader election algorithms
• The asymmetric leader election algorithm: number of survivors near the end of the game
• Leader election in the presence of n-1 initial failures
• Perpetuities in fair leader election algorithms
• Perpetuities in fair leader election algorithms
• Leader Election in Complete Networks
• Leader election in complete networks
• Leader election in well-connected graphs
• Leader election in well-connected graphs
• Convergence of some leader election algorithms

Cited in

(3)

• Survivors in leader election algorithms
• Convergence of some leader election algorithms
• On leader green election

This page was built for publication: Survivors in Leader Election Algorithms

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