An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication
References (9)
- et al.
Mellin transforms and asymptotics: Digital sums
Theoret. Comput. Sci.
(1994) - et al.
Mellin transforms and asymptotics: Finite differences and Rice's integrals
Theoret. Comput. Sci.
(1995) How to select a loser
Discrete Math.
(1993)The evaluation of an alternating sum with applications to the analysis of algorithms
Inform. Process. Lett.
(1988)
There are more references available in the full text version of this article.
Cited by (4)
Sorting algorithms for broadcast communications: Mathematical analysis
2002, Theoretical Computer ScienceResolving Conflicts and Electing Leaders
2019, arXivA fast sorting algorithm and its generalization on broadcast communications
2000, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1998 Published by Elsevier B.V.