Analysis of an asymmetric leader election algorithm

Electronic Journal of Combinatorics

Volumn 4, Issue 1 R, 1997, Pages 1-16

  Janson, Svante ^a   Szpankowski, Wojciech ^b  

^a UPPSALA UNIVERSITY   (Sweden)

^b Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010529060     PISSN: 10778926     EISSN: 10778926     Source Type: Journal    
DOI: 10.37236/1302     Document Type: Article

References (22)

1. Abramowitz, M. and Stegun, I., eds. Handbook of Mathematical Functions. Wiley-Interscience, New York, 1972.
2. Brassard, G. and Bratley, P. Algorithmics: Theory and Practice. Prentice Hall, Englewood Cliffs, New Jersey 1988.
3. Devroye, L. A Study of Trie-Like Structures Under the Density Model. Annals of Applied Probability, 2, 402-434, 1992.
4. Fayolle, G., Flajolet, P., and Hofri, M. On a Functional Equation Arising in the Analysis of a Protocol for a Multiaccess Broadcast Channel, Adv. Appl. Probab., 18, 441-472, 1984.
5. Fill, J. A., Mahmoud, H. M., and Szpankowski, W. On the Distribution for the Duration of a Randomized Leader Election Algorithm. Ann. Appl. Probab., 6, 1260-1283, 1996.
6. Fill, J. Personal Communication.
7. Flajolet, P., Régnier, M. and Sotteau, D. Algebraic Methods for Trie Statistics, Annals of Discrete Mathematics, 25, 145-188, 1985.
8. Flajolet, P., Gourdon, X., and Dumas, P. Mellin Transforms and Asymptotics: Harmonic Sums. Theoretical Computer Science, 144, 3-58, 1995.
9. Gonnet, G. and Munro, J. The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform, Journal of Algorithms, 5, 451-470, 1984.
10. Grabner, P. Searching for Losers. Random Structures and Algorithms, 4, 99-110, 1993.
11. Jacquet, P. and Régnier, M. Trie Partitioning Process: Limiting Distributions. Lecture Notes in Computer Science, 214, 196-210, Springer, New York, 1986.
12. Jacquet, P. and Régnier, M. Normal Limiting Distribution of the Size of Tries, Proc. Performance '87, 209-223, North Holland, Amsterdam 1987
13. Jacquet, P. and Szpankowski, W. Ultimate Characterizations of the Burst Response of an Interval Searching Algorithm. SIAM J. Computing, 18, 777-791, 1989.
14. Jacquet, P. and Szpankowski, W. Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees. Theoretical Computer Science, 144, 161-197, 1995.
15. Jacquet, P. and Szpankowski, W. Analytical Depoissonization and Its Applications, Theoretical Computer Science, to appear.
16. Knuth, D. The Art of Computer Programming, Vol. 3: Sorting and Searching. Addison-Wesley, Reading, Massachusetts, 1973.
17. Kuipers, L. and Niederreiter, H. Uniform Distribution of Sequences. Wiley, New York, 1974.
18. Mahmoud, H. Evolution of Random Search Trees. Wiley, New York, 1992.
19. Prodinger, H. How to Select a Loser. Discrete Math., 120, 149-159, 1993.
20. Rais, B., Jacquet, P. and Szpankowski, W. Limiting Distribution for the Depth in PATRICIA Tries. SIAM J. on Discrete Math., 3, 355-362, 1993.
21. Schmid, U. The Average CRI-length of a Tree Collision Resolution Algorithm in Presence of Multiplicity-Dependent Capture Effects, Proc. ICALP 92, Vienna, 223-234, 1992.
22. Szpankowski, W. Solution to a Linear Recurrence Equation Arising in the Analysis of Some Algorithms. SIAM J. Alg. Disc. Meth., 8, 233-250, 1987.