An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms

Journal of Algorithms

Volumn 44, Issue 1, 2002, Pages 177-225

  Chern, Hua Huai ^a   Hwang, Hsien Kuei ^b   Tsai, Tsung Hsi ^b  

^a Taipei Municipal Teachers College   (Taiwan)

^b INSTITUTE OF STATISTICAL SCIENCE   (Taiwan)

Author keywords

Asymptotic transfers; Binary search trees; Cauchy Euler differential equations; Convergence in distributions; Method of moments; Phase changes; Quicksort

Indexed keywords

ASYMPTOTIC STABILITY; CONVERGENCE OF NUMERICAL METHODS; DIFFERENTIAL EQUATIONS; FUNCTIONS; METHOD OF MOMENTS; SORTING; TREES (MATHEMATICS);

BINARY SEARCH TREES;

ALGORITHMS;

EID: 0036660151     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0196-6774(02)00208-0     Document Type: Article

References (117)

1. W.J. Adams, The Life and Times of the Central Limit Theorem, Kaedmon, New York, 1974.
2. E.A. Albacea, Leapfrogging samplesort, in: Lecture Notes in Comput. Sci., Vol. 1023, 1995, pp. 1-9.
3. A. Andersson, General balanced trees, J. Algorithms 30 (1999) 1-28.
4. C. Ashcraft, R. Grimes, SPOOLES: an object-oriented sparse matrix library, in: Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing 1999, San Antonio, TX, SIAM, Philadelphia, PA, 1999, p. 10.
5. J.-L. Baer, Y.-B. Lin, Improving quicksort performance with a codeword data structure, IEEE Trans. Software Engrg. 15 (1989) 622-631.
6. R.A. Baeza-Yates, Some average measures in m-ary search trees, Inform. Process. Lett. 25 (1987) 375-381.
7. R.A. Baeza-Yates, Height balance distribution of search trees, Inform. Process. Lett. 39 (1991) 317-324.
8. S. Battiato, D. Cantone, D. Catalano, G. Cincotti, M. Hofri, An efficient algorithm for the approximate median selection problem, in: G. Bongiovanni, G. Gambosi, R. Petreschi (Eds.), Proceedings of the Fourth Italian Conference, CIAC 2000, Rome, in: Lecture Notes in Comput. Sci., Vol. 1767, 2000, pp. 226-238.
9. C.M. Bender, S.A. Orszag, Advanced Mathematical Methods for Scientists and Engineers, Springer, New York, 1999.
10. J.L. Bentley, M.D. McIlroy, Engineering a sort function, Software-Pract. Exper. 23 (1993) 1249-1265.
11. J.L. Bentley, R. Sedgewick, Fast algorithms for sorting and searching strings, in: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, January 5-7, 1997, ACM Press, 1997, pp. 360-369.
12. F. Bergeron, P. Flajolet, B. Salvy, Varieties of increasing trees, in: CAAP '92, Rennes, 1992, in: Lecture Notes in Comput. Sci., Vol. 581, Springer, Berlin, 1992, pp. 24-48, available via ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-1583.ps.gz.
13. P. Billingsley, Probability and Measure, third edition, Wiley, New York, 1995.
14. W.H. Burge, Analysis of a tree sorting method and some properties of a set of trees, in: First USA-JAPAN Computer Conference Proceedings, AFIPS and IPSJ, 1972, pp. 372-378.
15. M.T. Chao, G.D. Lin, The asymptotic distributions of the remedians, J. Statist. Plann. Inference 37 (1993) 1-11.
16. P.L. Chebyshev, in: A. Markov, N. Sonin (Eds.), in: (Euvres de P.L. Tchebychev, Tome II, Chelsea, New York, 1962.
17. W.-M. Chen, H.-K. Hwang, Analysis of two randomized algorithms for finding the maximum in a broadcast communication model, submitted, 2001; available via http://algo.stat.sinica.edu.tw.
18. H.-H. Chern, H.-K. Hwang, Transitional behaviors of the average cost of quicksort with median-of-(2t + 1), Algorithmica 29 (2001) 44-69.
19. H.-H. Chern, H.-K. Hwang, Phase changes in random m-ary search trees and generalized quicksort, Random Structures Algorithms 19 (2001) 316-358.
20. H.-H. Chern, H.-K. Hwang, Y.-N. Yeh, Distribution of the number of consecutive records, Random Structures Algorithms 17 (2000) 169-196.
21. L. Comtet, Advanced Combinatorics. The Art of Finite and Infinite Expansions, revised and enlarged edition, Reidel, Dordrecht, 1974.
22. C.R. Cook, D.J. Kim, Best sorting algorithms for nearly sorted lists, Comm. ACM 23 (1980) 620-624.
23. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, 1990.
24. N.J. Cox, The ninther and its relatives: summary measures useful in geomorphology, Z. Geomorph. 36 (1992) 491-495.
25. W. Cunto, J.L. Gascon, Improving time and space efficiency in generalized binary search trees, Acta Inform. 24 (1987) 583-594.
26. H. Delange, On the use of the method of moments for the study of additive functions, J. Number Theory 39 (1991) 144-161.
27. L. Devroye, Moment inequalities for random variables in computational geometry, Computing 30 (1983) 111-119.
28. L. Devroye, Universal limit laws for depths in random trees, SIAM J. Comput. 28 (1999) 409-432.
29. L. Devroye, Limit laws for sums of functions of subtrees of random binary search trees, SIAM J. Comput. (2002), accepted.
30. L. Devroye, J.A. Fill, R. Neininger, Perfect simulation from the quicksort limit distribution, Electron. Comm. Probab. 5 (2000) 95-99, (electronic); available via http://www.math.washington.edu/̃ejpecp/EcpVol5/paper12.pdf.
31. P. Diaconis, Application of the method of moments in probability and statistics, in: Moments in Mathematics, San Antonio, TX, 1987, AMS, Providence, RI, 1987, pp. 125-142.
32. 2 extraction for total fat analysis of food products, J. Food Sci. 64 (1999) 612-615.
33. R.G. Dromey, Exploiting partial order with quicksort, Software-Pract. Exp. 14 (1984) 509-518.
34. O. Dubois, R. Monasson, B. Selman, R. Zecchina (Eds.), Phase Transitions in Combinatorial Problems, Papers from the Conference on NP-Hardness and Phase Transitions, Trieste, September 1999, Theoret. Comput. Sci. 265 (2001).
35. M. Durand, Holonomie et applications en l'analyse d'algorithmes et combinatoire, DEA Mémoire, LIX, École Polytechnique, 2000; available via http://algo.inria.fr/durand.
36. B. Durian, Quicksort without a stack, in: Proceedings of the 12th Symposium on Mathematical Foundations of Computer Science, in: Lecture Notes in Comput. Sci., Vol. 233, Springer, 1986, pp. 283-289.
37. J.A. Fill, On the distribution of binary search trees under the random permutation model, Random Structures Algorithms 8 (1996) 1-25.
38. J.A. Fill, Transfer theorems and asymptotic distributional results for m-ary search trees, manuscript, 2001.
39. J.A. Fill, S. Janson, Quicksort asymptotics, preprint, 2001; available via http://www.mts.jhu.edu/̃fill.
40. P. Flajolet, G. Gonnet, C. Puech, J.M. Robson, Analytic variations on quadtrees, Algorithmica 10 (1993) 473-500.
41. P. Flajolet, A. Odlyzko, The average height of binary trees and other simple trees, J. Comput. System Sci. 25 (1982) 171-213.
42. P. Flajolet, A. Odlyzko, Singularity analysis of generating functions, SIAM J. Discrete Math. 3 (1990) 216-240.
43. P. Flajolet, P. Poblete, A. Viola, On the analysis of linear probing hashing, Algorithmica 22 (1998) 490-515.
44. P. Flajolet, C. Puech, Partial match retrieval of multidimensional data, J. ACM 33 (1986) 371-407.
45. J. Françon, Arbres binaires de recherche: propriétés combinatoires et application, RAIRO Inform. Théor. 10 (1976) 35-50.
46. M. Fréchet, J. Shohat, A proof of the generalized second-limit theorem in the theory of probability, Trans. Amer. Math. Soc. 33 (1931) 533-543.
47. G.H. Gonnet, R. Baeza-Yates, Handbook of Algorithms and Data Structures, Addison-Wesley, Workingham, 1991.
48. P. Grabner, H. Prodinger, Sorting algorithms for broadcast communications: Mathematical analysis, Theoret. Comput. Sci. (2001), to appear.
49. D.H. Greene, Labelled Formal Languages and Their Uses, PhD thesis, Stanford University, 1983.
50. J.M. Hammersley, Generalization of the fundamental theorem on sub-additive functions, Proc. Cambridge Philos. Soc. 58 (1962) 235-238.
51. J.M. Hammersley, G.R. Grimmett, Maximal solutions of the generalized subadditive inequality, in: E.F. Harding, D.G. Kendall (Eds.), Stochastic Geometry, Wiley, London, 1974, pp. 270-284.
52. P. Hennequin, Combinatorial analysis of quicksort algorithm, RAIRO Inform. Théor. Appl. 23 (1989) 317-333.
53. P. Hennequin, Analyse en moyenne d'algorithme, tri rapide et arbres de recherche, PhD thesis, École Polytechnique, 1991.
54. E. Hille, in: Analytic Function Theory, Vol. I, Gin, Boston, MA, 1959.
55. C.A.R. Hoare, Algorithm 64: Quicksort, Comm. ACM 4 (1961) 321.
56. C.A.R. Hoare, Quicksort, Comput. J. 5 (1962) 10-15.
57. B.-C. Huang, D.E. Knuth, A one-way, stackless quicksort algorithm, BIT 26 (1986) 127-130.
58. F. Hubalek, H.-K. Hwang, W. Lew, H.M. Mahmoud, H. Prodinger, A multivariate view of random bucket digital search trees, J. Algorithms 44 (2002) 121-158; available via http://algo.stat.sinica.edu.tw.
59. C. Hurley, R. Modarres, Low-storage quantile estimation, Comput. Statist. 10 (1995) 311-325.
60. H.-K. Hwang, Second phase changes in random m-ary search trees and generalized quicksort, Ann. Probab. (2002), accepted.
61. H.-K. Hwang, R. Neininger, Phase changes of the limit laws in the quicksort recurrence under varying toll functions, SIAM J. Comput. (2002), accepted; available via http://algo.stat.sinica.edu.tw.
62. H.-K. Hwang, T.-H. Tsai, Quickselect and Dickman function, Combin. Probab. Comput. (2002), accepted; available via http://algo.stat.sinica.edu.tw.
63. H.-K. Hwang, T.-H. Tsai, An asymptotic theory for recurrence relations based on minimization and maximization, submitted, 2001; available via http://algo.stat.sinica.edu.tw.
64. E.L. Ince, Ordinary Differential Equations, Dover, New York, 1926.
65. J. JaJa, A perspective on quicksort, Comput. Sci. Engrg. (2000) 43-49.
66. S. Janson, T. Łuczak, A. Ruciński, Random Graphs, Wiley Interscience, New York, 2000.
67. M. Kaykobad, Md.M. Islam, M.E. Amyeen, M.M. Murshed, 3 is a more promising algorithmic parameter than 2, Comput. Math. Appl. 36 (1998) 19-24.
68. P.R. Kersten, Fuzzy order statistics and their applications to fuzzy clustering, IEEE Trans. Fuzzy Systems 7 (1999) 708-712.
69. P. Kirschenhofer, H. Prodinger, C. Martínez, Analysis of Hoare's FIND algorithm with median-of-three partition, Random Structures Algorithms 10 (1997) 143-156.
70. C. Knessl, W. Szpankowski, Quicksort algorithm again revisited, Discrete Math. Theor. Comput. Sci. 3 (1999) 43-64, available via http://dmtcs.loria.fr/volumes/abstracts/dm030202.abs.html.
71. D.E. Knuth, Sorting and Searching, in: The Art of Computer Programming, Vol. III, second edition, Addison-Wesley, Reading, MA, 1998.
72. S. Kundu, Sorting tree, nestling tree and inverse permutation, Inform. Process. Lett. 6 (1977) 94-96.
73. J.N. Larsson, K. Sadakane, Faster suffix sorting, Technical Report, LU-CS-TR:99-214, LUNDFD6/(NFCS-3140)/1-20/(1999), Department of Computer Science, Lund University; available via http://www.cs.lth.se/̃jesper/ssrev-tr.pdf.
74. W. Lew, H.M. Mahmoud, The joint distribution of elastic buckets in multiway search trees, SIAM J. Comput. 23 (1994) 1050-1074.
75. M. Loève, Probability Theory. I, fourth edition, in: Grad. Texts in Math., Vol. 45, Springer-Verlag, New York, 1977.
76. H.M. Mahmoud, Evolution of Random Search Trees, Wiley, New York, 1992.
77. H.M. Mahmoud, On rotations in fringe-balanced binary trees, Inform. Process. Lett. 65 (1998) 41-46.
78. H.M. Mahmoud, The size of random bucket trees via urn models, manuscript, 2001.
79. H.M. Mahmoud, B. Pittel, Analysis of the space of search trees under the random insertion algorithm, J. Algorithms 10 (1989) 52-75.
80. H.M. Mahmoud, R.T. Smythe, Probabilistic analysis of bucket recursive trees, Theoret. Comput. Sci. 144 (1995) 221-249.
81. G.S. Manku, S. Rajagopalan, B.G. Lindsay, Approximate medians and other quantiles in one pass and with limited memory, in: Proceedings, 1998, in: ACM SIGMOD, Vol. 27, 1998, pp. 426-435.
82. C. Martínez, S. Roura, Optimal sampling strategies in quicksort and quickselect, SIAM J. Comput. 31 (2001) 683-705.
83. C.J.H. McDiarmid, R.B. Hayward, Large deviations for quicksort, J. Algorithms 21 (1996) 476-507.
84. A. Moffat, J. Katajainen, In-place calculation of minimum-redundancy codes, in: Proceedings of the Workshop on Algorithms and Data Structures, Kingston, Ontario, 1995, pp. 393-402.
85. D. Motzkin, A stable quicksort, Software-Pract. Exp. 11 (1981) 607-611.
86. D.R. Musser, Introspective sorting and selection algorithms, Software-Pract. Exp. 27 (1997) 983-993.
87. R.K. Nagle, E.B. Saff, A.D. Snider, Fundamentals of Differential Equations and Boundary Value Problems, third edition, Addison-Wesley, Reading, MA, 2000.
88. R. Neininger, L. Rüschendorf, A general contraction theorem and asymptotic normality in combinatorial structures, preprint, 2001; available via http://www.stochastik.uni-freiburg.de/homepages/ueininger.
89. A. Panholzer, H. Prodinger, An analytic approach for the analysis of rotations in fringe-balanced binary search trees, Ann. Comb. 2 (1998) 173-184.
90. J. Pearl, A space-efficient on-line method of computing quantile estimates, J. Algorithms 2 (1981) 164-177.
91. B. Pittel, Normal convergence problem? Two moments and a recurrence may be the clues, Ann. Appl. Probab. 9 (1999) 1260-1302.
92. P.V. Poblete, The analysis of heuristics for search trees, Acta Inform. 30 (1993) 233-248.
93. P.V. Poblete, J.I. Munro, The analysis of a fringe heuristic for binary search trees, J. Algorithms 6 (1985) 336-350.
94. H. Prodinger, Depth and path length of heap ordered trees, Int. J. Found. Comput. Sci. 7 (1996) 293-299.
95. J. Röhrich, A hybrid of quicksort with O(n log n) worst case complexity, Inform. Process. Lett. 14 (1982) 119-123.
96. U. Rösler, L. Rüschendorf, The contraction method for recursive algorithms, Algorithmica 29 (2001) 3-33.
97. P.J. Rousseeuw, G.W. Bassett, The remedian: A robust averaging method for large data sets, J. Amer. Statist. Assoc. 85 (1990) 97-104.
98. S.M. Sarwar, S.A. Sarwar, M.H.A. Jaragh, J. Brandeburg, Engineering quicksort, Comput. Lang. 22 (1996) 39-47.
99. W. Schachinger, Limiting distribution of the costs of partial match retrievals in multidimensional tries, Random Structures Algorithms 17 (2000) 428-459.
100. Quicksort with equal keys, SlAM J. Comput. 6 (1977) 240-269.
101. R. Sedgewick, Quicksort, Garland, New York, 1980.
102. S.-H. Shiau, C.-B. Yang, A fast sorting algorithm on broadcast communications, in: Proceedings of the Second International Conference on Parallel Computing Systems (PCS99), Ensenada, Mexico, August 16-20, 1999, pp. 87-92.
103. W.D. Smith, Fixed point for negamaxing probability distributions on regular trees, preprint, 1995, available via http://citeseer.nj.nec.com/67965.html.
104. R.T. Smythe, Central limit theorems for urn models, Stochastic Process. Appl. 65 (1996) 115-137.
105. R.T. Smythe, H.M. Mahmoud, A survey of recursive trees, Theory Probab. Math. Statist. 51 (1996) 1-27.
106. R.P. Stanley in: Enumerative Combinatorics, Vol. 1, Corrected reprint of the 1986 original, Cambridge University Press, Cambridge, 1997.
107. C.J. Stephenson, A method of constructing binary search trees by making insertions at the root, Int. J. Comput. Inform. Sci. 9 (1980) 15-29.
108. J.L. Szwarcfiter, L.B. Wilson, Some properties of ternary trees, Comput. J. 21 (1978) 66-72.
109. L. Takács, On the total heights of random rooted binary trees, J. Comb. Theory Ser. B 61 (1994) 155-166.
110. K.-H. Tan, An Asymptotic Analysis of the Number of Comparisons in Multipartition Quicksort, PhD dissertation, Carnegie-Mellon University, 1993.
111. J.W. Tukey, The ninther, a technique for low-effort robust (resistant) location in large samples, in: H.A. David (Ed.), Contributions to Survey Sampling and Applied Statistics in Honor of H.O. Hartley, Academic Press, New York, 1978, pp. 251-258.
112. J.D. Valois, Introspective sorting and selection revisited, Software-Pract. Exp. 30 (2000) 617-638.
113. J. Vuillemin, A unifying look at data structures, Comm. ACM 23 (1980) 229-239.
114. R.L. Wainwright, A class of sorting algorithms based on quicksort, Comm. ACM 28 (1984) 396-403.
115. L.M. Wegner, Quicksort for equal keys, IEEE Trans. Comput. 34 (1985) 362-367.
116. L.M. Wegner, A generalized, one-way, stackless quicksort, BIT 27 (1987) 44-48.
117. B.W. Weide, Statistical Methods in Algorithm Design and Analysis, PhD dissertation, Carnegie-Mellon University, 1978.