Phase changes in random m-ary search trees and generalized quicksort

Random Structures and Algorithms

Volumn 19, Issue 3-4, 2001, Pages 316-358

  Chern, Hua Huai ^a   Hwang, Hsien Kuei ^b  

^a Taipei Municipal Teachers College   (Taiwan)

^b INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035539863     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.10005     Document Type: Article

References (42)

1. R.A. Baeza-Yates, Some average measures in m-ary search trees, Information Processing Letters, 25 (1987), 375-381.
2. C.M. Bender and S.A. Orszag, Advanced mathematical methods for scientists and engineers, McGraw-Hill, New York, 1978.
3. J.L. Bentley and M.D. McIlroy, Engineering a sort function, Software-Practice and Experience, 23 (1993), 1249-1265.
4. L. Comtet, Advanced combinatorics. The art of finite and infinite expansions, revised and enlarged edition, D. Reidel, Dordrecht, 1974.
5. W. Cunto and J.L. Gascon, Improving time and space efficiency in generalized binary search trees, Acta Informatica, 24 (1987), 583-594.
6. E.A. Coddington and N. Levinson, Theory of ordinary differential equations, McGraw-Hill, New York, 1955.
7. L. Devroye, Universal limit laws for depths in random trees, SIAM Journal on Computing, 28 (1999), 409-432.
8. P. Flajolet and A. Odlyzko, Singularity analysis of generating functions, SIAM Journal on Discrete Mathematics, 3 (1990), 216-240.
9. G.H. Gonnet and R. Baeza-Yates, Handbook of algorithms and data structures, Addison-Wesley, Workingham, 1991.
10. D.H. Greene, Labelled formal languages and their uses, Ph.D. Thesis, Stanford University, 1983.
11. P. Hennequin, Combinatorial analysis of quicksort algorithm, RAIRO Informatique Théorique et Applications, 23 (1989), 317-333.
12. P. Hennequin, Analyse en moyenne d'algorithme, tri rapide et arbres de recherche, Ph.D. Thesis, Ecole Polytechnique, 1991.
13. E. Hille, Ordinary differential equations in the complex domain, Wiley-Interscience, New York, 1976 (reprinted by Dover Publications, 1997).
14. H.-K. Hwang, Large deviations for combinatorial distributions. I. Central limit theorems, Annals of Applied Probability, 6 (1996), 297-319.
15. H.-K. Hwang, On convergence rates in the central limit theorems for combinatorial structures, European Journal of Combinatorics, 19 (1998), 329-343.
16. H.-K. Hwang, Large deviations of combinatorial distributions. II. Local limit theorems, Annals of Applied Probability, 8 (1998), 163-181.
17. H.-K. Hwang, Second phase changes in random m-ary search trees and generalized quicksort, submitted (2001).
18. H.-K. Hwang and R. Neininger, Phase changes of the limit laws in the quicksort recurrence under varying toll functions, submitted (2001).
19. E.L. Ince, Ordinary differential equations, Dover, New York, 1926.
20. J. JaJa, "A perspective on quicksort," Computing in science & engineering, January/February, 43-49, 2000.
21. D.E. Knuth, The art of computer programming, volume III - Sorting and searching, 2nd ed., Addison-Wesley, Reading, MA, 1998.
22. R. Kemp, Binary search trees constructed from nondistinct keys with/without specified probabilities, Theoretical Computer Science, 156 (1996), 39-70.
23. W. Lew and H.M. Mahmoud, The joint distribution of elastic buckets in multiway search trees, SIAM Journal on Computing, 23 (1994), 1050-1074.
24. M. Loève, Probability theory. I, 4th ed., Graduate Texts in Mathematics, Vol. 45, Springer-Verlag, New York, 1977.
25. H.M. Mahmoud, On the average internal path length of m-ary search trees, Acta Informatica, 23 (1986), 111-117.
26. H.M. Mahmoud, Evolution of random search trees, Wiley, New York, 1992.
27. H.M. Mahmoud, On rotations in fringe-balanced binary trees, Information Processing Letters, 65 (1998), 41-46.
28. H.M. Mahmoud, The size of random bucket trees via urn models, manuscript (2001).
29. H.M. Mahmoud and B. Pittel, Analysis of the space of search trees under the random insertion algorithm, Journal of Algorithms, 10 (1989), 52-75.
30. H.M. Mahmoud and R.T Smythe, Probabilistic analysis of bucket recursive trees, Theoretical Computer Science, 144 (1995), 221-249.
31. R. Neininger, On the internal path length of d-dimensional quad trees, Random Structures and Algorithms, 15 (1999), 25-41.
32. R. Neininger and L. Rüschendorf, A general contraction theorem and asymptotic normality in combinatorial structures, preprint (2001).
33. R.K. Nagle, E.B. Saff and A.D. Snider, Fundamentals of differential equations and boundary value problems, 3rd ed., Addison-Wesley, Reading, MA, 2000.
34. A.M. Odlyzko, Periodic oscillations of coefficients of power series that satisfy functional equations, Advances in Mathematics, 44 (1982), 180-205.
35. A. Panholzer and H. Prodinger, An analytic approach for the analysis of rotations in fringe-balanced binary search trees, Annals of Combinatorics, 2 (1998), 173-184.
36. W.W. Peterson, Variance of storage requirements for B+-trees, Acta Informatica, 32 (1995), 611-625.
37. B. Pittel, Normal convergence problem? Two moments and a recurrence may be the clues, Annals of Applied Probability, 9 (1999), 1260-1302.
38. A.D. Polyanin and V.F. Zaitsev, Handbook of exact solutions for ordinary differential equations, CRC Press, Boca Raton, FL, 1995.
39. U. Rösler, The analysis of stochastic divide and conquer algorithms, Algorithmica, 29 (2001), 238-261.
40. R. Sedgewick, Quicksort with equal keys, SIAM Journal on Computing, 6 (1977), 240-269.
41. R. Sedgewick, Quicksort, Garland, NY, 1980.
42. R.T. Smythe, Central limit theorems for urn models, Stochastic Processes and Applications, 65 (1996), 115-137.