On the distribution for the duration of a randomized leader election algorithm

Annals of Applied Probability

Volumn 6, Issue 4, 1996, Pages 1260-1283

  Fill, James Allen ^a   Mahmoud, Hosam M ^b   Szpankowski, Wojciech ^c  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b GEORGE WASHINGTON UNIVERSITY   (United States)

^c Purdue University   (United States)

Author keywords

Asymptotic distribution; de Poissonization; Distributed computing; Height; Leader election; Poissonization; Random trees; Tries

Indexed keywords

EID: 0030364144     PISSN: 10505164     EISSN: None     Source Type: Journal    
DOI: 10.1214/aoap/1035463332     Document Type: Article

References (37)

1. ABRAMOWITZ, M. and STEGUN, I., eds. (1972). Handbook of Mathematical Functions. Wiley, New York.
2. ALDOUS, D. (1989). Probability Approximations via the Poisson Clumping Heuristic. Springer, New York.
3. ANDERSON, C. (1970). Extreme value theory for a class of discrete distributions with applications to some stochastic processes. J. Appl. Probab. 7 99-113.
4. ARRATIA, R. and TAVARÉ, S. (1994). Independent processes approximations for random combinatorial structures. Adv. in Math. 104 90-154.
5. BERNDT, B. (1985). Ramanujan's Notebook, Part I. Springer, New York.
6. BRASSARD, G. and BRATLEY, P. (1988). Algorithmics: Theory and Practice. Prentice-Hall, Englewood Cliffs, NJ.
7. D'ARISTOTILE, A., DIACONIS, P. and FREEDMAN, D. (1988). On merging of probabilities. Sankhyā Ser. A 50 363-380.
8. DEVROYE, L. (1986). Non-Uniform Random Variate Generation. Springer, New York.
9. DEVROYE, L. (1992). A study of trie-like structures under the density model. Ann. Appl. Probab. 2 402-434.
10. FILL, J. A., MAHMOUD, H. M. and SZPANKOWSKI, W. (1996). On the distribution for the duration of a randomized leader election algorithm. Technical Report 544, Dept. Math. Sci., Johns Hopkins Univ.
11. FLAJOLET, P. (1983). On the performance evaluation of extendable hashing and trie search. Acta Inform. 20 345-369.
12. FLAJOLET, P., GOURDON, X. and DUMAS, P. (1995). Mellin transforms and asymptotics: harmonic sums. Theoret. Comput. Sci. 144 3-58.
13. FLAJOLET, P. and MARTIN, G. (1985). Probabilistic counting algorithms for data base applications. J. Comput. System Sci. 31 182-209.
14. FLAJOLET, P. and SEDGEWICK, R. (1995). Mellin transforms and asymptotics: finite differences and Rice's integrals. Theoret. Comput. Sci. 144 101-124.
15. GALAMBOS, H. (1987). The Asymptotic Theory of Extreme Order Statistics. Krieger, Malabar, FL.
16. GONNET, G. and MUNRO, J. (1984). The analysis of linear probing sort by the use of a new mathematical transform. J. Algorithms 5 451-470.
17. GRABNER, P. (1993). Searching for losers. Random Structures and Algorithms 4 99-110.
18. HOLST, L. (1986). On birthday, collector's, occupancy and other classical urn problems. Internat. Statist. Rev. 54 15-27.
19. JACQUET, P. and RÉGNIER, M. (1986). Trie Partitioning Process: Limiting Distributions. Lecture Notes in Comput. Sci. 214 196-210. Springer, New York.
20. JACQUET, P. and SZPANKOWSKI, W. (1989). Ultimate characterizations of the burst response of an interval searching algorithm. SIAM J. Comput. 18 777-791.
21. JACQUET, P. and SZPANKOWSKI, W. (1991). Analysis of tries with Markovian dependency. IEEE Trans. Inform. Theory 37 1470-1475.
22. JACQUET, P. and SZPANKOWSKI, W. (1995). Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees. Theoret. Comput. Sci. 144 161-197.
23. KAC, M. (1949). On the deviations between theoretical and empirical distributions. Proc. Nat. Acad. Sci. U.S.A. 35 252-257.
24. KNUTH, D. (1973a). The Art of Computer Programming 1: Fundamentals of Algorithms. Addison-Wesley, Reading, MA.
25. KNUTH, D. (1973b). The Art of Computer Programming 3: Sorting and Searching. Addison-Wesley, Reading, MA.
26. KUIPERS, L. and NIEDERREITER, H. (1974). Uniform Distribution of Sequences. Wiley, New York.
27. MAHMOUD, H. (1992). Evolution of Random Search Trees. Wiley, New York.
28. MENDELSON, H. (1982). Analysis of extendible hashing. IEEE Trans. Software Engrg. SE8 611-619.
29. PITTEL, B. (1985). Asymptotical growth of a class of random trees. Ann. Probab. 13 414-427.
30. PITTEL, B. (1986). Paths in a random digital tree: limiting distributions. Adv. in Appl. Probab. 18 139-155.
31. PITTEL, B. and RUBIN, H. (1992). How many random questions are necessary to identify n distinct objects? J. Combin. Theory Ser. A 55 292-312.
32. POBLETE, P. (1987). Approximating functions by their Poisson transform. Inform. Process. Lett. 23 127-130.
33. PRODINGER, H. (1993). How to select a loser. Discrete Math. 120 149-159.
34. RAIS, B., JACQUET, P. and SZPANKOWSKI, W. (1993). Limiting distribution for the depth in PATRICIA tries. SIAM J. Discrete Math. 3 355-362.
35. RÉGNIER, M. and JACQUET, P. (1989). New results on the size of tries. IEEE Trans. Inform. Theory 35 203-205.
36. RÉNYI, A. (1961). On random subsets of a finite set. Mathematica (Cluj) 3 355-362.
37. SZPANKOWSKI, W. (1987). Solution to a linear recurrence equation arising in the analysis of some algorithms. SIAM J. Algebraic Discrete Methods 8 233-250.