Sorting algorithms for broadcast communications: mathematical analysis
- 23 October 2002
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 289 (1) , 51-67
- https://doi.org/10.1016/s0304-3975(01)00114-1
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- A Fast Sorting Algorithm and Its Generalization on Broadcast CommunicationsPublished by Springer Nature ,2000
- An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communicationInformation Processing Letters, 1998
- Special Functions, 𝑞-Series and Related TopicsPublished by American Mathematical Society (AMS) ,1997
- On the distribution for the duration of a randomized leader election algorithmThe Annals of Applied Probability, 1996
- A fast maximum finding algorithm on broadcast communicationInformation Processing Letters, 1996
- Mellin transforms and asymptotics: Finite differences and Rice's integralsTheoretical Computer Science, 1995
- Compared to what? An introduction to the analysis of algorithmsScience of Computer Programming, 1995
- How to select a loserDiscrete Mathematics, 1993
- Searching for losersRandom Structures & Algorithms, 1993
- Q-ary collision resolution algorithms in random-access systems with free or blocked channel accessIEEE Transactions on Information Theory, 1985