Sorting algorithms for broadcast communications: Mathematical analysis

Theoretical Computer Science

Volumn 289, Issue 1, 2002, Pages 51-67

  Grabner, Peter J ^a   Prodinger, Helmut ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF THE WITWATERSRAND   (South Africa)

Author keywords

Broadcast communication; Conflict resolution; Euler's summation formula; Sorting

Indexed keywords

ALGORITHMS; BROADCASTING; COMMUNICATION SYSTEMS; COMPUTATIONAL METHODS; FUNCTIONS; INTEGRAL EQUATIONS; SORTING;

CONFLICT RESOLUTION;

COMPUTER SCIENCE;

EID: 0037163972     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(01)00114-1     Document Type: Article

References (16)

1. Abramowitz M., Stegun I.A. Handbook of Mathematical Functions. 1965;Dover, New York.
2. Andrews G., Askey R., Roy R. Special Functions. Encyclopedia of Mathematics and its Applications. Number 71:1999;Cambridge University Press, Cambridge.
3. Fill J.A., Mahmoud H.M., Szpankowski W. On the distribution for the duration of a randomized leader election algorithm. Ann. Appl. Probab. 6:1996;1260-1283.
4. Flajolet P., Sedgewick R. Mellin transforms and asymptotics: finite differences and Rice's integrals. Theoret. Comput. Sci. 144(1-2):1995;101-124.
5. Grabner P., Prodinger H. An asymptotic study of a recursion occurring in the analysis of an algorithm on broadcast communication. Inform. Process. Lett. 65:1998;89-93.
6. Grabner P.J. Searching for losers. Random Structures Algorithms. 4:1993;99-110.
7. Ivić A. The Riemann Zeta-Function. 1985;Wiley, New York.
8. Janson S., Szpankowski W. Analysis of an asymmetric leader election algorithm. Electron. J. Combin. 4(# R17):1997;17pp.
9. Mathys P., Flajolet P. Q-ary collision resolution algorithms in random access systems with free or blocked channel access. IEEE Trans. Inform. Theory. IT-31(2):1985;217-243.
10. Nielsen N. Handbuch der Theorie der Gammafunktion. 1906;Teubner, Leipzig.
11. Prodinger H. How to select a loser. Discrete Math. 120:1993;149-159.
12. Sedgewick R., Flajolet P. Introduction to the Analysis of Algorithms. 1996;Addison-Wesley, Reading, MA.
13. Shiau S.-H., Yang C.-B. A fast maximum finding algorithm on broadcast communications. Inform. Process. Lett. 60:1996;81-89.
14. S.-H. Shiau, C.-B. Yang, A fast sorting algorithm and its generalization on broadcast communications, In Proc. of Sixth Annual International Computing and Combinatorics Conference, COCOON2000. pp. 252-261, Sydney, Australia, July 26-28, 2000.
15. S.-H. Shiau, C.-B. Yang, Sorting algorithms on broadcast communications: algorithm and fundamental analysis, 2000, In Technical Report Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, Taiwan, R.O.C., 2000.
16. Titchmarsh E.C. The Theory of Functions. 1939;Oxford University Press, Oxford.