{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:27:21Z","timestamp":1759336041038},"reference-count":117,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,7,1]],"date-time":"2002-07-01T00:00:00Z","timestamp":1025481600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[2002,7]]},"DOI":"10.1016\/s0196-6774(02)00208-0","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T19:37:24Z","timestamp":1034105844000},"page":"177-225","source":"Crossref","is-referenced-by-count":27,"title":["An asymptotic theory for Cauchy\u2013Euler differential equations with applications to the analysis of algorithms"],"prefix":"10.1016","volume":"44","author":[{"given":"Hua-Huai","family":"Chern","sequence":"first","affiliation":[]},{"given":"Hsien-Kuei","family":"Hwang","sequence":"additional","affiliation":[]},{"given":"Tsung-Hsi","family":"Tsai","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0196-6774(02)00208-0_BIB001","series-title":"The Life and Times of the Central Limit Theorem","author":"Adams","year":"1974"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB002","first-page":"1","article-title":"Leapfrogging samplesort","volume":"1023","author":"Albacea","year":"1995"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB003","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jagm.1998.0967","article-title":"General balanced trees","volume":"30","author":"Andersson","year":"1999","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB004","series-title":"Proceedings of the 9th SIAM Conference on Parallel Processing for Scientific Computing 1999, San Antonio, TX","first-page":"10","article-title":"SPOOLES: an object-oriented sparse matrix library","author":"Ashcraft","year":"1999"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB005","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1109\/32.24711","article-title":"Improving quicksort performance with a codeword data structure","volume":"15","author":"Baer","year":"1989","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB006","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0020-0190(87)90215-8","article-title":"Some average measures in m-ary search trees","volume":"25","author":"Baeza-Yates","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB007","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0020-0190(91)90005-3","article-title":"Height balance distribution of search trees","volume":"39","author":"Baeza-Yates","year":"1991","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB008","series-title":"Proceedings of the Fourth Italian Conference","first-page":"226","article-title":"An efficient algorithm for the approximate median selection problem","volume":"1767","author":"Battiato","year":"2000"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB009","series-title":"Advanced Mathematical Methods for Scientists and Engineers","author":"Bender","year":"1999"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB010","doi-asserted-by":"crossref","first-page":"1249","DOI":"10.1002\/spe.4380231105","article-title":"Engineering a sort function","volume":"23","author":"Bentley","year":"1993","journal-title":"Software\u2013Pract. Exper."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB011","series-title":"Proceedings of the Eighth Annual ACM\u2013SIAM Symposium on Discrete Algorithms","first-page":"360","article-title":"Fast algorithms for sorting and searching strings","author":"Bentley","year":"1997"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB012","first-page":"24","article-title":"Varieties of increasing trees","volume":"581","author":"Bergeron","year":"1992"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB013","series-title":"Probability and Measure","author":"Billingsley","year":"1995"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB014","series-title":"First USA\u2013JAPAN Computer Conference Proceedings","first-page":"372","article-title":"Analysis of a tree sorting method and some properties of a set of trees","author":"Burge","year":"1972"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB015","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0378-3758(93)90075-H","article-title":"The asymptotic distributions of the remedians","volume":"37","author":"Chao","year":"1993","journal-title":"J. Statist. Plann. Inference"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB016","volume":"II","author":"Chebyshev","year":"1962"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB017","unstructured":"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"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB018","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BF02679613","article-title":"Transitional behaviors of the average cost of quicksort with median-of-(2t+1)","volume":"29","author":"Chern","year":"2001","journal-title":"Algorithmica"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB019","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1002\/rsa.10005","article-title":"Phase changes in random m-ary search trees and generalized quicksort","volume":"19","author":"Chern","year":"2001","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB020","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<169::AID-RSA1>3.0.CO;2-K","article-title":"Distribution of the number of consecutive records","volume":"17","author":"Chern","year":"2000","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB021","series-title":"Advanced Combinatorics. The Art of Finite and Infinite Expansions, revised and enlarged edition","author":"Comtet","year":"1974"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB022","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1145\/359024.359026","article-title":"Best sorting algorithms for nearly sorted lists","volume":"23","author":"Cook","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB023","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB024","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1127\/zfg\/36\/1992\/491","article-title":"The ninther and its relatives: summary measures useful in geomorphology","volume":"36","author":"Cox","year":"1992","journal-title":"Z. Geomorph."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB025","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1007\/BF00263296","article-title":"Improving time and space efficiency in generalized binary search trees","volume":"24","author":"Cunto","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB026","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1016\/0022-314X(91)90041-9","article-title":"On the use of the method of moments for the study of additive functions","volume":"39","author":"Delange","year":"1991","journal-title":"J. Number Theory"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB027","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF02280782","article-title":"Moment inequalities for random variables in computational geometry","volume":"30","author":"Devroye","year":"1983","journal-title":"Computing"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB028","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1137\/S0097539795283954","article-title":"Universal limit laws for depths in random trees","volume":"28","author":"Devroye","year":"1999","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB029","doi-asserted-by":"crossref","DOI":"10.1137\/S0097539701383923","article-title":"Limit laws for sums of functions of subtrees of random binary search trees","author":"Devroye","year":"2002","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB030","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1214\/ECP.v5-1024","article-title":"Perfect simulation from the quicksort limit distribution","volume":"5","author":"Devroye","year":"2000","journal-title":"Electron. Comm. Probab."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB031","series-title":"Moments in Mathematics","first-page":"125","article-title":"Application of the method of moments in probability and statistics","author":"Diaconis","year":"1987"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB032","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1111\/j.1365-2621.1999.tb15095.x","article-title":"Supercritical CO2 extraction for total fat analysis of food products","volume":"64","author":"Dionisi","year":"1999","journal-title":"J. Food Sci."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB033","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1002\/spe.4380140603","article-title":"Exploiting partial order with quicksort","volume":"14","author":"Dromey","year":"1984","journal-title":"Software\u2014Pract. Exp."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB034","volume":"265","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB035","unstructured":"M. Durand, Holonomie et applications en l'analyse d'algorithmes et combinatoire, DEA M\u00e9moire, LIX, \u00c9cole Polytechnique, 2000; available via http:\/\/algo.inria.fr\/durand"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB036","series-title":"Proceedings of the 12th Symposium on Mathematical Foundations of Computer Science","first-page":"283","article-title":"Quicksort without a stack","volume":"233","author":"Durian","year":"1986"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB037","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/(SICI)1098-2418(199601)8:1<1::AID-RSA1>3.0.CO;2-1","article-title":"On the distribution of binary search trees under the random permutation model","volume":"8","author":"Fill","year":"1996","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB038","unstructured":"J.A. Fill, Transfer theorems and asymptotic distributional results for m-ary search trees, manuscript, 2001"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB039","unstructured":"J.A. Fill, S. Janson, Quicksort asymptotics, preprint, 2001; available via http:\/\/www.mts.jhu.edu\/~fill"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB040","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF01891833","article-title":"Analytic variations on quadtrees","volume":"10","author":"Flajolet","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB041","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0022-0000(82)90004-6","article-title":"The average height of binary trees and other simple trees","volume":"25","author":"Flajolet","year":"1982","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB042","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","article-title":"Singularity analysis of generating functions","volume":"3","author":"Flajolet","year":"1990","journal-title":"SIAM J. Discrete Math."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB043","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1007\/PL00009236","article-title":"On the analysis of linear probing hashing","volume":"22","author":"Flajolet","year":"1998","journal-title":"Algorithmica"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB044","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/5383.5453","article-title":"Partial match retrieval of multidimensional data","volume":"33","author":"Flajolet","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB045","first-page":"35","article-title":"Arbres binaires de recherche: propri\u00e9t\u00e9s combinatoires et application","volume":"10","author":"Fran\u00e7on","year":"1976","journal-title":"RAIRO Inform. Th\u00e9or."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB046","doi-asserted-by":"crossref","first-page":"533","DOI":"10.2307\/1989421","article-title":"A proof of the generalized second-limit theorem in the theory of probability","volume":"33","author":"Fr\u00e9chet","year":"1931","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB047","series-title":"Handbook of Algorithms and Data Structures","author":"Gonnet","year":"1991"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB048","article-title":"Sorting algorithms for broadcast communications: Mathematical analysis","author":"Grabner","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB049","unstructured":"D.H. Greene, Labelled Formal Languages and Their Uses, PhD thesis, Stanford University, 1983"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB050","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1017\/S030500410003646X","article-title":"Generalization of the fundamental theorem on sub-additive functions","volume":"58","author":"Hammersley","year":"1962","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB051","series-title":"Stochastic Geometry","first-page":"270","article-title":"Maximal solutions of the generalized subadditive inequality","author":"Hammersley","year":"1974"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB052","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1051\/ita\/1989230303171","article-title":"Combinatorial analysis of quicksort algorithm","volume":"23","author":"Hennequin","year":"1989","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB053","unstructured":"P. Hennequin, Analyse en moyenne d'algorithme, tri rapide et arbres de recherche, PhD thesis, \u00c9cole Polytechnique, 1991"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB054","volume":"I","author":"Hille","year":"1959"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB055","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1145\/366622.366644","article-title":"Algorithm 64: Quicksort","volume":"4","author":"Hoare","year":"1961","journal-title":"Comm. ACM"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB056","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","article-title":"Quicksort","volume":"5","author":"Hoare","year":"1962","journal-title":"Comput. J."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB057","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01939369","article-title":"A one-way, stackless quicksort algorithm","volume":"26","author":"Huang","year":"1986","journal-title":"BIT"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB058","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0196-6774(02)00210-9","article-title":"A multivariate view of random bucket digital search trees","volume":"44","author":"Hubalek","year":"2002","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB059","first-page":"311","article-title":"Low-storage quantile estimation","volume":"10","author":"Hurley","year":"1995","journal-title":"Comput. Statist."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB060","article-title":"Second phase changes in random m-ary search trees and generalized quicksort","author":"Hwang","year":"2002","journal-title":"Ann. Probab."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB061","doi-asserted-by":"crossref","DOI":"10.1137\/S009753970138390X","article-title":"Phase changes of the limit laws in the quicksort recurrence under varying toll functions","author":"Hwang","year":"2002","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB062","doi-asserted-by":"crossref","DOI":"10.1017\/S0963548302005138","article-title":"Quickselect and Dickman function","author":"Hwang","year":"2002","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB063","unstructured":"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"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB064","series-title":"Ordinary Differential Equations","author":"Ince","year":"1926"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB065","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/5992.814657","article-title":"A perspective on quicksort","author":"JaJa","year":"2000","journal-title":"Comput. Sci. Engrg."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB066","series-title":"Random Graphs","author":"Janson","year":"2000"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB067","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/S0898-1221(98)00158-8","article-title":"3 is a more promising algorithmic parameter than 2","volume":"36","author":"Kaykobad","year":"1998","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB068","doi-asserted-by":"crossref","first-page":"708","DOI":"10.1109\/91.811239","article-title":"Fuzzy order statistics and their applications to fuzzy clustering","volume":"7","author":"Kersten","year":"1999","journal-title":"IEEE Trans. Fuzzy Systems"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB069","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<143::AID-RSA7>3.0.CO;2-V","article-title":"Analysis of Hoare's FIND algorithm with median-of-three partition","volume":"10","author":"Kirschenhofer","year":"1997","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB070","first-page":"43","article-title":"Quicksort algorithm again revisited","volume":"3","author":"Knessl","year":"1999","journal-title":"Discrete Math. Theor. Comput. Sci."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB071","series-title":"Sorting and Searching","volume":"III","author":"Knuth","year":"1998"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB072","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1016\/0020-0190(77)90035-7","article-title":"Sorting tree, nestling tree and inverse permutation","volume":"6","author":"Kundu","year":"1977","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB073","unstructured":"J.N. Larsson, K. Sadakane, Faster suffix sorting, Technical Report, LU-CS-TR:99-214, LUNDFD6\/(NFCS-3140)\/1\u201320\/(1999), Department of Computer Science, Lund University; available via http:\/\/www.cs.lth.se\/~jesper\/ssrev-tr.pdf"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB074","doi-asserted-by":"crossref","first-page":"1050","DOI":"10.1137\/S009753979223023X","article-title":"The joint distribution of elastic buckets in multiway search trees","volume":"23","author":"Lew","year":"1994","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB075","series-title":"Probability Theory. I","volume":"45","author":"Lo\u00e8ve","year":"1977"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB076","series-title":"Evolution of Random Search Trees","author":"Mahmoud","year":"1992"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB077","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0020-0190(97)00184-1","article-title":"On rotations in fringe-balanced binary trees","volume":"65","author":"Mahmoud","year":"1998","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB078","unstructured":"H.M. Mahmoud, The size of random bucket trees via urn models, manuscript, 2001"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB079","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1016\/0196-6774(89)90023-0","article-title":"Analysis of the space of search trees under the random insertion algorithm","volume":"10","author":"Mahmoud","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB080","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/0304-3975(94)00308-6","article-title":"Probabilistic analysis of bucket recursive trees","volume":"144","author":"Mahmoud","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB081","series-title":"Proceedings, 1998","first-page":"426","article-title":"Approximate medians and other quantiles in one pass and with limited memory","volume":"27","author":"Manku","year":"1998"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB082","doi-asserted-by":"crossref","first-page":"683","DOI":"10.1137\/S0097539700382108","article-title":"Optimal sampling strategies in quicksort and quickselect","volume":"31","author":"Mart\u0131&#x0301;nez","year":"2001","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB083","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1006\/jagm.1996.0055","article-title":"Large deviations for quicksort","volume":"21","author":"McDiarmid","year":"1996","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB084","series-title":"Proceedings of the Workshop on Algorithms and Data Structures, Kingston, Ontario","first-page":"393","article-title":"In-place calculation of minimum-redundancy codes","author":"Moffat","year":"1995"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB085","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1002\/spe.4380110604","article-title":"A stable quicksort","volume":"11","author":"Motzkin","year":"1981","journal-title":"Software\u2013Pract. Exp."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB086","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1002\/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-#","article-title":"Introspective sorting and selection algorithms","volume":"27","author":"Musser","year":"1997","journal-title":"Software\u2013Pract. Exp."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB087","series-title":"Fundamentals of Differential Equations and Boundary Value Problems, third edition","author":"Nagle","year":"2000"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB088","unstructured":"R. Neininger, L. R\u00fcschendorf, A general contraction theorem and asymptotic normality in combinatorial structures, preprint, 2001; available via http:\/\/www.stochastik.uni-freiburg.de\/homepages\/neininger"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB089","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF01608487","article-title":"An analytic approach for the analysis of rotations in fringe-balanced binary search trees","volume":"2","author":"Panholzer","year":"1998","journal-title":"Ann. Comb."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB090","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1016\/0196-6774(81)90017-1","article-title":"A space-efficient on-line method of computing quantile estimates","volume":"2","author":"Pearl","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB091","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1214\/aoap\/1029962872","article-title":"Normal convergence problem? Two moments and a recurrence may be the clues","volume":"9","author":"Pittel","year":"1999","journal-title":"Ann. Appl. Probab."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB092","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1007\/BF01179372","article-title":"The analysis of heuristics for search trees","volume":"30","author":"Poblete","year":"1993","journal-title":"Acta Inform."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB093","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0196-6774(85)90003-3","article-title":"The analysis of a fringe heuristic for binary search trees","volume":"6","author":"Poblete","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB094","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1142\/S0129054196000208","article-title":"Depth and path length of heap ordered trees","volume":"7","author":"Prodinger","year":"1996","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB095","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0020-0190(82)90067-9","article-title":"A hybrid of quicksort with O(nlogn) worst case complexity","volume":"14","author":"R\u00f6hrich","year":"1982","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB096","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02679611","article-title":"The contraction method for recursive algorithms","volume":"29","author":"R\u00f6sler","year":"2001","journal-title":"Algorithmica"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB097","doi-asserted-by":"crossref","first-page":"97","DOI":"10.2307\/2289530","article-title":"The remedian: A robust averaging method for large data sets","volume":"85","author":"Rousseeuw","year":"1990","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB098","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0096-0551(96)00005-7","article-title":"Engineering quicksort","volume":"22","author":"Sarwar","year":"1996","journal-title":"Comput. Lang."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB099","doi-asserted-by":"crossref","first-page":"428","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<428::AID-RSA12>3.0.CO;2-6","article-title":"Limiting distribution of the costs of partial match retrievals in multidimensional tries","volume":"17","author":"Schachinger","year":"2000","journal-title":"Random Structures Algorithms"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB100","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1137\/0206018","article-title":"Quicksort with equal keys","volume":"6","author":"Sedgewick","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB101","series-title":"Quicksort","author":"Sedgewick","year":"1980"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB102","series-title":"Proceedings of the Second International Conference on Parallel Computing Systems (PCS99), Ensenada, Mexico, August 16\u201320","first-page":"87","article-title":"A fast sorting algorithm on broadcast communications","author":"Shiau","year":"1999"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB103","unstructured":"W.D. Smith, Fixed point for negamaxing probability distributions on regular trees, preprint, 1995, available via http:\/\/citeseer.nj.nec.com\/67965.html"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB104","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0304-4149(96)00094-4","article-title":"Central limit theorems for urn models","volume":"65","author":"Smythe","year":"1996","journal-title":"Stochastic Process. Appl."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB105","first-page":"1","article-title":"A survey of recursive trees","volume":"51","author":"Smythe","year":"1996","journal-title":"Theory Probab. Math. Statist."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB106","volume":"1","author":"Stanley","year":"1997"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB107","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00995807","article-title":"A method of constructing binary search trees by making insertions at the root","volume":"9","author":"Stephenson","year":"1980","journal-title":"Int. J. Comput. Inform. Sci."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB108","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1093\/comjnl\/21.1.66","article-title":"Some properties of ternary trees","volume":"21","author":"Szwarcfiter","year":"1978","journal-title":"Comput. J."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB109","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1006\/jctb.1994.1041","article-title":"On the total heights of random rooted binary trees","volume":"61","author":"Tak\u00e1cs","year":"1994","journal-title":"J. Comb. Theory Ser. B"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB110","unstructured":"K.-H. Tan, An Asymptotic Analysis of the Number of Comparisons in Multipartition Quicksort, PhD dissertation, Carnegie-Mellon University, 1993"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB111","series-title":"Contributions to Survey Sampling and Applied Statistics in Honor of H.O. Hartley","first-page":"251","article-title":"The ninther, a technique for low-effort robust (resistant) location in large samples","author":"Tukey","year":"1978"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB112","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1002\/(SICI)1097-024X(200005)30:6<617::AID-SPE311>3.0.CO;2-A","article-title":"Introspective sorting and selection revisited","volume":"30","author":"Valois","year":"2000","journal-title":"Software\u2013Pract. Exp."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB113","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1145\/358841.358852","article-title":"A unifying look at data structures","volume":"23","author":"Vuillemin","year":"1980","journal-title":"Comm. ACM"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB114","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1145\/3341.3348","article-title":"A class of sorting algorithms based on quicksort","volume":"28","author":"Wainwright","year":"1984","journal-title":"Comm. ACM"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB115","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1109\/TC.1985.5009387","article-title":"Quicksort for equal keys","volume":"34","author":"Wegner","year":"1985","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0196-6774(02)00208-0_BIB116","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BF01937353","article-title":"A generalized, one-way, stackless quicksort","volume":"27","author":"Wegner","year":"1987","journal-title":"BIT"},{"key":"10.1016\/S0196-6774(02)00208-0_BIB117","unstructured":"B.W. Weide, Statistical Methods in Algorithm Design and Analysis, PhD dissertation, Carnegie-Mellon University, 1978"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402002080?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677402002080?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,28]],"date-time":"2021-05-28T05:12:06Z","timestamp":1622178726000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677402002080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,7]]},"references-count":117,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,7]]}},"alternative-id":["S0196677402002080"],"URL":"https:\/\/doi.org\/10.1016\/s0196-6774(02)00208-0","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[2002,7]]}}}