{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T06:08:53Z","timestamp":1648879733907},"reference-count":27,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00387-5","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T16:25:18Z","timestamp":1034007918000},"page":"649-703","source":"Crossref","is-referenced-by-count":3,"title":["The height of a binary search tree: the limiting distribution perspective"],"prefix":"10.1016","volume":"289","author":[{"given":"Charles","family":"Knessl","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00387-5_BIB1","series-title":"Handbook of Mathematical Functions","author":"Abramowitz","year":"1962"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB2","series-title":"Special Functions","author":"Andrews","year":"1999"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB3","series-title":"Differential Difference Equations","author":"Bellman","year":"1963"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB4","series-title":"Advanced Mathematical Methods for Scientists and Engineers","author":"Bender","year":"1978"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB5","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1145\/5925.5930","article-title":"A note on the height of binary search trees","volume":"33","author":"Devroye","year":"1986","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0304-3975(01)00387-5_BIB6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/BF00265991","article-title":"Branching processes in the analysis of the height of trees","volume":"24","author":"Devroye","year":"1987","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(01)00387-5_BIB7","doi-asserted-by":"crossref","first-page":"1157","DOI":"10.1137\/S0097539792237541","article-title":"On the variance of the height of random binary search trees","volume":"24","author":"Devroye","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00387-5_BIB8","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF02679615","article-title":"An analytic approach to the height of binary search trees","volume":"29","author":"Drmota","year":"2001","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB9","unstructured":"M. Drmota, An analytic approach to the height of binary search trees. II, preprint."},{"key":"10.1016\/S0304-3975(01)00387-5_BIB10","series-title":"Asymptotic Analysis","author":"Fedoryuk","year":"1993"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB11","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 Methods"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB12","series-title":"Ordinary Differential Equations","author":"Ince","year":"1956"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB13","series-title":"The Art of Computer Programming. Sorting and Searching","author":"Knuth","year":"1998"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB14","first-page":"43","article-title":"Quicksort Algorithm Again Revisited","volume":"3","author":"Knessl","year":"1999","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00387-5_BIB15","unstructured":"C. Knessl, W. Szpankowski, Limit laws for heights in generalized tries and PATRICIA tries, Proc. LATIN\u20192000, Punta del Este, Uruguay, Lecture Notes in Computer Science, No. 1776, 2000, pp. 298\u2013307."},{"key":"10.1016\/S0304-3975(01)00387-5_BIB16","doi-asserted-by":"crossref","first-page":"923","DOI":"10.1137\/S0097539799356812","article-title":"Asymptotic behavior of the height in a digital search tree and the longest phrase of the Lempel\u2013Ziv scheme","volume":"30","author":"Knessl","year":"2000","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(01)00387-5_BIB17","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1137\/S0036139992228120","article-title":"Singular perturbation analysis of boundary value Problems for differential-difference equations. V. Small shifts with layer behavior","volume":"54","author":"Lange","year":"1994","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/S0304-3975(01)00387-5_BIB18","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1051\/ita\/1987210404791","article-title":"Exact and asymptotic distributions in digital and binary search trees","volume":"21","author":"Louchard","year":"1987","journal-title":"RAIRO Theoret. Inform. Appl."},{"key":"10.1016\/S0304-3975(01)00387-5_BIB19","series-title":"Evolution of Random Search Trees","author":"Mahmoud","year":"1992"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB20","series-title":"Perturbations: Theory and Methods","author":"Murdock","year":"1999"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB21","series-title":"Introduction to Perturbation Techniques","author":"Nayfeh","year":"1981"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB22","series-title":"Handbook of Combinatorics, Vol. II","first-page":"1063","article-title":"Asymptotic enumeration","author":"Odlyzko","year":"1995"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB23","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/0022-247X(84)90141-0","article-title":"On growing random binary trees","volume":"103","author":"Pittel","year":"1984","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/S0304-3975(01)00387-5_BIB24","doi-asserted-by":"crossref","unstructured":"B. Reed, How tall is a tree, Proc. STOC, Portland, 2000, pp. 479\u2013483.","DOI":"10.1145\/335305.335360"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB25","first-page":"151","article-title":"The height of binary search trees","volume":"11","author":"Robson","year":"1979","journal-title":"Austral. Comput. J."},{"key":"10.1016\/S0304-3975(01)00387-5_BIB26","series-title":"Average Case Analysis of Algorithms on Sequences","author":"Szpankowski","year":"2001"},{"key":"10.1016\/S0304-3975(01)00387-5_BIB27","series-title":"Asymptotic Approximations of Integrals","author":"Wong","year":"1989"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003875?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501003875?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T02:57:41Z","timestamp":1556852261000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501003875"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501003875"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00387-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}