Limit theorems for mergesort

Random Structures and Algorithms

Volumn 8, Issue 4, 1996, Pages 319-336

  Hwang, Hsien Kuei ^a  

^a INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030546175     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1098-2418(199607)8:4<319::AID-RSA3>3.3.CO;2-D     Document Type: Article

References (20)

1. P. Billingsley, Probability and Measure, 2nd ed., Wiley, New York, 1986.
2. 0 où tous les coefficients a sont réels et positifs, Tôhoku Math. J., 18, 34-36 (1920) (a translation based on his 1893 Swedish paper).
3. P. Flajolet and M. Golin, Mellin transforms and asymptotics: the mergesort recurrence, Acta Inf., 31, 673-696 (1994).
4. P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: harmonic sums, Theor. Comput. Sci., 144, 3-58 (1995).
5. M. Golin and R. Sedgewick, Queue mergesort, Inf. Process. Lett., 48 253-259 (1993).
6. P. Hennequin, Combinatorial analysis of quicksort algorithms, RAIRO Theor. Inf. Appl., 23, 317-333 (1989).
7. H. K. Hwang, Théorèmes limite pour les structures combinatoires et les fonctions arithmétiques, Ph.D. thesis, Ecole Polytechnique, 1994.
8. H. K. Hwang, Asymptotic expansions of mergesort recurrences, in Inf. Process. Lett., to appear.
9. H. K. Hwang and J.-M. Steyaert, On the number of heaps and the cost of heap construction, Theor. Comput. Sci., to appear.
10. J. L. Jensen, Saddlepoint approximations, Clarendon, Oxford, 1995.
11. D. E. Knuth, The Art of Computer Programming, Vol. III - Sorting and Searching, Addison-Wesley, 1973.
12. J. Kubilius, Probabilistic Methods in the Theory of Numbers, Translations of Mathematical Monographs, Vol. 11, AMS, Providence, RI, 1964.
13. M. Marden, Geometry of polynomials, 2nd ed., Mathematical Surveys No. 3, AMS, Providence, RI, 1966.
14. W. Panny and H. Prodinger, Bottom up mergesort - a detailed analysis, Algorithmica, 14, 340-354 (1995).
15. V. V. Petrov, Limit Theorems of Probability Theory, Sequences of Independent Random Variables, Clarendon, Oxford, 1995.
16. B. Rais, P. Jacquet, and W. Szpankowski, Limiting distribution for the depth in Patricia tries, SIAM J. Discrete Math. 6, 197-213 (1993).
17. M. Régnier, A limiting distribution for quicksort, RAIRO Theor. Inf. Appl., 23, 335-343 (1989).
18. U. Rösler, A limit theorem for "QUICKSORT," RAIRO Theor. Inf. Appl., 25, 85-100. (1991).
19. R. Sedgewick, Algorithms, 2nd ed., Addison-Wesley, Reading, MA, 1988.
20. E. C. Titchmarsh, The Theory of Functions, 2nd ed., Oxford University Press, London, 1939.