On a leader election algorithm: truncated geometric case study

DOI10.1016/J.SPL.2013.12.020zbMATH Open1296.60012OpenAlexW2098440802MaRDI QIDQ2452871FDOQ2452871

Authors: Ravi Kalpathy, Mark Daniel Ward 

Publication date: 5 June 2014

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.spl.2013.12.020

Recommendations

• The truncated geometric election algorithm: duration of the election
• On the distribution for the duration of a randomized leader election algorithm
• Convergence of some leader election algorithms
• Analysis of an asymmetric leader election algorithm
• Perpetuities in fair leader election algorithms

zbMATH Keywords

analysis of algorithms\(q\)-seriesleader electionrecurrence

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial probability (60C05)

Cites Work

• On the distribution for the duration of a randomized leader election algorithm
• Analysis of an asymmetric leader election algorithm
• Number of survivors in the presence of a demon
• Survivors in leader election algorithms
• Asymptotic properties of a leader election algorithm
• Convergence of some leader election algorithms
• Perpetuities in fair leader election algorithms
• The asymmetric leader election algorithm: another approach
• How to select a loser
• A probabilistic analysis of a leader election algorithm

Cited In (5)

• Perpetuities in fair leader election algorithms
• Bivariate issues in leader election algorithms with Marshall-Olkin limit distribution
• The truncated geometric election algorithm: duration of the election
• Perpetuities in fair leader election algorithms
• The route to synchrony via drum head mode and mixed oscillatory state in star coupled Hindmarsh-Rose neural network

This page was built for publication: On a leader election algorithm: truncated geometric case study

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