References
- J.A. Fill, H. Mahmoud and W. Szpankowski, On the distribution for the duration of a randomized leader election algorithm, Annals of Applied Probability 6 (1996), 1260–1283. doi: 10.1214/aoap/1035463332
- P. Flajolet, X. Gourdon and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science 144 (1995), 3–58. doi: 10.1016/0304-3975(95)00002-E
- P. Hitczenko and G. Louchard, Distinctness of compositions of an integer: a probabilistic analysis, Random Structures and Algorithms 19(3,4) (2001), 407–437. doi: 10.1002/rsa.10008
- S. Janson, C. Lavault and G. Louchard, Convergence of some leader election algorithms, Discrete Mathematics and Theoretical Computer Science 10(3) (2008), 171–196.
- S. Janson and W. Szpankowski, Analysis of an asymmetric leader election algorithm, Electronic Journal of Combinatorics 4(R17) (1997), 1–16.
- R. Kalpathy, Perpetuities in fair leader election algorithms, Ph.D. Dissertation, Technical report, Department of Statistics, The George Washington University, Washington, D.C., 2013.
- R. Kalpathy and H. Mahmoud, Perpetuities in fair leader election algorithms, Advances in Applied Probability 46(1) (2014), 203–216. doi: 10.1017/S000186780000700X
- R. Kalpathy, H. Mahmoud and W. Rosenkrantz, Survivors in leader election algorithms, Statistics and Probability Letters, 83 (2013), 2743–2749. doi: 10.1016/j.spl.2013.09.011
- R. Kalpathy, H.M. Mahmoud and M.D. Ward, Asymptotic properties of a leader election algorithm, Journal of Applied Probability 48 (2011), 569–575. doi: 10.1239/jap/1308662645
- C. Knessl, Asymptotics and numerical studies of the leader election algorithm, European Journal of Applied Mathematics 12 (2001), 645–664. doi: 10.1017/S0956792501004508
- C. Lavault and G. Louchard, Asymptotic analysis of a leader election algorithm, Theoretical Computer Science 359(1,3) (2006), 239–254. doi: 10.1016/j.tcs.2006.03.027
- G. Louchard, C. Martinez and H. Prodinger, The swedish leader election protocol: Analysis and variations, In: Proceedings ANALCO 2011, pp. 127–134, 2011.
- G. Louchard and H. Prodinger, Asymptotics of the moments of extreme-value related distribution functions, Algorithmica 46 (2006), 431–467. Long version: http://www.ulb.ac.be/di/mcs/louchard/moml.ps. doi: 10.1007/s00453-006-0106-8
- G. Louchard and H. Prodinger, On gaps and unoccupied urns in sequences of geometrically distributed random variables, Discrete Mathematics 308(9) (2008), 1538–1562. Long version: http://www.ulb.ac.be/di/mcs/louchard/gaps18.ps. doi: 10.1016/j.disc.2007.04.012
- G. Louchard and H. Prodinger, The asymmetric leader election algorithm: Another approach, Annals of Combinatorics 12 (2009), 449–478. doi: 10.1007/s00026-009-0004-2
- G. Louchard and H. Prodinger, The asymmetric leader election algorithm with swedish stopping: A probabilistic analysis, Discrete Mathematics and Theoretical Computer Science 14(2) (2012), 91–128.
- G. Louchard and H. Prodinger and M.D. Ward, Number of survivors in the presence of a demon, Periodica Mathematica Hungarica 64(1) (2012), 101–117. doi: 10.1007/s10998-012-9101-9
- G. Louchard and H. Prodinger and M.D. Ward, The number of distinct values of some multiplicity in sequences of geometrically distributed random variables, Discrete Mathematics and Theoretical Computer Science AD (2005), 231–256. 2005 International Conference on Analysis of Algorithms.
- H. Prodinger, How to select a loser, Discrete Mathematics 120 (1993), 149–159. doi: 10.1016/0012-365X(93)90572-B