An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication

Information Processing Letters

Volumn 65, Issue 2, 1998, Pages 89-93

  Grabner, Peter J ^a   Prodinger, Helmut ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b VIENNA UNIVERSITY OF TECHNOLOGY   (Austria)

Author keywords

Bernoulli numbers; Broadcast communication; Mellin Perron formula; Recursion; Rice's method

Indexed keywords

EID: 0010529924     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00225-1     Document Type: Article

References (10)

1. M. Abramowitz, I.A. Stegun, Handbook of Mathematical Functions Dover, 1973 (reprint of the 10th National Bureau of Standards edition, 1964).
2. M. Abramowitz, I.A. Stegun, Handbook of Mathematical Functions Dover, 1973 (reprint of the 10th National Bureau of Standards edition, 1964).
3. P. Flajolet, P. Grabner, P. Kirschenhofer, H. Prodinger, R.F. Tichy, Mellin transforms and asymptotics: Digital sums, Theoret. Comput. Sci. 123 (1994) 291-314.
4. P. Flajolet, R. Sedgewick, Mellin transforms and asymptotics: Finite differences and Rice's integrals, Theoret. Comput. Sci. 144 (1995) 101-124.
5. D.E. Knuth, The Art of Computer Programming, vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1973.
6. H. Prodinger, How to select a loser, Discrete Math. 120 (1993) 149-159.
7. R. Sedgewick, P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA, 1996.
8. S.-H. Shiau, C.-B. Yang, A fast maximum finding algorithm on broadcast communication, Inform. Process. Lett. 60 (1996) 81-89.
9. W. Szpankowski, The evaluation of an alternating sum with applications to the analysis of algorithms, Inform. Process. Lett. 28 (1988) 13-19.
10. G. Tenenbaum, Introduction to Analytic and Probabilistic Number Theory, Cambridge University Press, Cambridge, 1995.