A probabilistic analysis of a leader election algorithm

MaRDI QIDQ3574995zbMATH OpenFDO

Authors Hanene Mohamed

Publication date 5 July 2010

Full work available at URL https://www.dmtcs.org/dmtcs-ojs/index.php/proceedings/article/view/dmAG0115/0.html

zbMATH Keywords

election algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40)

Recommendations

• Analysis of an asymmetric leader election algorithm
• Asymptotic and numerical studies of the leader election algorithm
• Asymptotic analysis of a leader election algorithm
• Cost distribution of the Chang-Roberts leader election algorithm and related problems
• The asymmetric leader election algorithm: another approach

Cited in

(10)

• scientific article; zbMATH DE number 1456964 (Why is no real title available?)
• scientific article; zbMATH DE number 1256745 (Why is no real title available?)
• On greedy trie execution
• Cost distribution of the Chang-Roberts leader election algorithm and related problems
• The asymmetric leader election algorithm: another approach
• scientific article; zbMATH DE number 1696668 (Why is no real title available?)
• On a leader election algorithm: truncated geometric case study
• Leader election in the presence of n-1 initial failures
• On the Complexity of Universal Leader Election
• Leader election: a Markov chain approach

This page was built for publication: A probabilistic analysis of a leader election algorithm

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