A probabilistic analysis of a leader election algorithm
From MaRDI portal
Publication:3574995
zbMATH Open1191.68897MaRDI QIDQ3574995FDOQ3574995
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
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)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On greedy trie execution
- Cost distribution of the Chang-Roberts leader election algorithm and related problems
- The asymmetric leader election algorithm: another approach
- Title not available (Why is that?)
- 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)
