{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,30]],"date-time":"2023-08-30T20:53:25Z","timestamp":1693428805885},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2001,2,1]],"date-time":"2001-02-01T00:00:00Z","timestamp":980985600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2001,2]]},"DOI":"10.1007\/bf02679613","type":"journal-article","created":{"date-parts":[[2007,7,29]],"date-time":"2007-07-29T04:42:49Z","timestamp":1185684169000},"page":"44-69","source":"Crossref","is-referenced-by-count":10,"title":["Transitional behaviors of the average cost of quicksort with median-of-(2t + 1)"],"prefix":"10.1007","volume":"29","author":[{"given":"H. -H.","family":"Chern","sequence":"first","affiliation":[]},{"given":"H. -K.","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02679613_CR1","volume-title":"Asymptotic Expansions of Integrals","author":"N. Bleistein","year":"1985","unstructured":"N. Bleistein and R. A. Handelsman,Asymptotic Expansions of Integrals, Dover, New York, 1985."},{"key":"BF02679613_CR2","doi-asserted-by":"crossref","unstructured":"H. E. Daniels, Tail probability approximations,International Statistical Review,55, 37\u201348.","DOI":"10.2307\/1403269"},{"key":"BF02679613_CR3","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/BF01210596","volume":"30","author":"L. Devroye","year":"1993","unstructured":"L. Devroye, On the expected height of fringe-balanced trees,Acta Informatica,30, 459\u2013466, 1993.","journal-title":"Acta Informatica"},{"key":"BF02679613_CR4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1137\/0403019","volume":"3","author":"P. Flajolet","year":"1990","unstructured":"P. Flajolet and A. M. Odlyzko, Singularity analysis of generating function,SIAM Journal on Discrete Mathematics,3, 216\u2013240, 1990.","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"BF02679613_CR5","volume-title":"Handbook of Algorithms and Data Structures","author":"G. H. Gonnet","year":"1991","unstructured":"G. H. Gonnet and R. Baeza-Yates,Handbook of Algorithms and Data Structures, second edition, Addison-Wesley, Reading, Massachusetts, 1991.","edition":"second edition"},{"key":"BF02679613_CR6","unstructured":"D. H. Greene, Labelled formal languages and their uses, Ph.D. Thesis, Stanford University, 1983."},{"key":"BF02679613_CR7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF00289612","volume":"4","author":"L. J. Guibas","year":"1975","unstructured":"L. J. Guibas, A principle of independence for binary tree searching,Acta Informatica,4, 293\u2013298, 1975.","journal-title":"Acta Informatica"},{"key":"BF02679613_CR8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1051\/ita\/1989230303171","volume":"23","author":"P. Hennequin","year":"1989","unstructured":"P. Hennequin, Combinatorial analysis of quicksort algorithm,RAIRO Informatique th\u00e9orique et Applications,23, 317\u2013333, 1989.","journal-title":"RAIRO Informatique th\u00e9orique et Applications"},{"key":"BF02679613_CR9","unstructured":"P. Hennequin, Analyse en moyenne d\u2019algorithmes, tri rapide et arbres de recherche, Ph.D. Thesis, Ecole Polytechnique, 1991."},{"key":"BF02679613_CR10","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C. A. R. Hoare","year":"1962","unstructured":"C. A. R. Hoare, Quicksort,Computer Journal,5, 10\u201315, 1962.","journal-title":"Computer Journal"},{"key":"BF02679613_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1002\/(SICI)1098-2418(199808)13:1<17::AID-RSA2>3.0.CO;2-V","volume":"13","author":"H.-K. Hwang","year":"1998","unstructured":"H.-K. Hwang, A Possion * negative binomial convolution law for random polynomials over finite fields,Random Structures and Algorithms,13, 17\u201347, 1998.","journal-title":"Random Structures and Algorithms"},{"key":"BF02679613_CR12","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1006\/jnth.1997.2216","volume":"69","author":"H.-K. Hwang","year":"1998","unstructured":"H.-K. Hwang, Sur la r\u00e9partition des valeurs des fonctions arithm\u00e9tiques: le nombre de facteurs premiers d\u2019un entier,Journal of Number Theory,69, 135\u2013152, 1998.","journal-title":"Journal of Number Theory"},{"key":"BF02679613_CR13","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0304-3975(98)00181-9","volume":"242","author":"H.-K. Hwang","year":"2000","unstructured":"H.-K. Hwang, B.-Y. Yang, and Y.-N. Yeh, Presorting algorithms: an average-case point of view,Theoretical Computer Science,242, 29\u201340, 2000.","journal-title":"Theoretical Computer Science"},{"key":"BF02679613_CR14","volume-title":"Ordinary Differential Equations","author":"E. L. Ince","year":"1926","unstructured":"E. L. Ince,Ordinary Differential Equations, Dover, New York, 1926."},{"key":"BF02679613_CR15","volume-title":"The Art of Computer Programming, Volume III: Sorting and Searching","author":"D. E. Knuth","year":"1998","unstructured":"D. E. Knuth,The Art of Computer Programming, Volume III: Sorting and Searching, second edition, Addison-Wesley, Reading, Massachusetts, 1998.","edition":"second edition"},{"key":"BF02679613_CR16","volume-title":"Mathematical Foundations of Computer Science (Bratislave, 1986)","author":"\u013d. Koll\u00e1r","year":"1986","unstructured":"\u013d. Koll\u00e1r, Optimal sorting of seven element sets,Mathematical Foundations of Computer Science (Bratislave, 1986), Lecture Notes in Computer Science, Vol. 233, No. 449\u2013457, Springer-Verlag, Berlin, 1986."},{"key":"BF02679613_CR17","doi-asserted-by":"crossref","first-page":"475","DOI":"10.2307\/1426607","volume":"12","author":"R. Lugannani","year":"1980","unstructured":"R. Lugannani and S. O. Rice, Saddlepoint approximation for the distribution of the sum of independent random variables,Advances in Applied Probability,12, 475\u2013490, 1980.","journal-title":"Advances in Applied Probability"},{"key":"BF02679613_CR18","volume-title":"Evolution of Random Search Trees","author":"H. M. Mahmoud","year":"1992","unstructured":"H. M. Mahmoud,Evolution of Random Search Trees, Wiley, New York, 1992."},{"key":"BF02679613_CR19","doi-asserted-by":"crossref","unstructured":"C. Mart\u00ednez, A. Panholzer, and H. Prodinger, On the number of descendants and ascendants in random search trees,Electronic Journal on Combinatorics,5, # R20, 1998.","DOI":"10.37236\/1358"},{"key":"BF02679613_CR20","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BFb0055064","volume-title":"Automata, Languages, and Programming (Aalborg, 1998)","author":"C. Mart\u00ednez","year":"1998","unstructured":"C. Mart\u00ednez and S. Roura, Optimal sampling strategies in quicksort,Automata, Languages, and Programming (Aalborg, 1998). Lecture Notes in Computer Science, Vol. 1443, pp. 327\u2013338, Springer-Verlag, Berlin, 1998."},{"key":"BF02679613_CR21","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1002\/rsa.3240070403","volume":"7","author":"C. C. McGeoch","year":"1995","unstructured":"C. C. McGeoch and J. D. Tygar, Optimal sampling strategies for Quicksort,Random Structures and Algorithms,7, 287\u2013300, 1995.","journal-title":"Random Structures and Algorithms"},{"key":"BF02679613_CR22","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0095-8956(87)90052-9","volume":"42","author":"A. M. Odlyzko","year":"1987","unstructured":"A. M. Odlyzko and H. S. Wilf, Bandwidths and profiles of trees,Journal of Combinatorial Theory, Series B,42, 348\u2013370, 1987.","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"BF02679613_CR23","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/0196-6774(85)90003-3","volume":"6","author":"P. V. Poblete","year":"1985","unstructured":"P. V. Poblete and J. I. Munro, The analysis of a fringe heuristic for binary search trees,Journal of Algorithms,6, 336\u2013350, 1985.","journal-title":"Journal of Algorithms"},{"key":"BF02679613_CR24","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF00289467","volume":"7","author":"R. Sedgewick","year":"1977","unstructured":"R. Sedgewick, The analysis of Quicksort programs,Acta Informatica,7, 327\u2013355, 1977.","journal-title":"Acta Informatica"},{"key":"BF02679613_CR25","volume-title":"Quicksort","author":"R. Sedgewick","year":"1978","unstructured":"R. Sedgewick,Quicksort, Garland, New York, 1978."},{"key":"BF02679613_CR26","volume-title":"Algorithms in C","author":"R. Sedgewick","year":"1997","unstructured":"R. Sedgewick,Algorithms in C, third edition, Addison-Wesley, Reading, Massachusetts, 1997.","edition":"third edition"},{"key":"BF02679613_CR27","volume-title":"An Introduction to the Analysis of Algorithms","author":"R. Sedgewick","year":"1996","unstructured":"R. Sedgewick and P. Flajolet,An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, Massachusetts, 1996."},{"key":"BF02679613_CR28","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1093\/comjnl\/19.4.322","volume":"19","author":"A. Walker","year":"1976","unstructured":"A. Walker and D. Wood, Locally balanced binary search trees,Computer Journal,19, 322\u2013325, 1976.","journal-title":"Computer Journal"},{"key":"BF02679613_CR29","volume-title":"Asymptotic Approximations of Integrals","author":"R. Wong","year":"1989","unstructured":"R. Wong,Asymptotic Approximations of Integrals, Academic Press, Boston, 1989."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02679613.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02679613\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02679613","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T12:42:43Z","timestamp":1587818563000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02679613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,2]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2001,2]]}},"alternative-id":["BF02679613"],"URL":"https:\/\/doi.org\/10.1007\/bf02679613","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2001,2]]}}}