{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:33:14Z","timestamp":1725485594171},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540651420"},{"type":"electronic","value":"9783540495437"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49543-6_27","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T22:58:05Z","timestamp":1181170685000},"page":"346-356","source":"Crossref","is-referenced-by-count":1,"title":["Quicksort Again Revisited"],"prefix":"10.1007","author":[{"given":"Charles","family":"Knessl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"volume-title":"Handbook of Mathematical Functions","year":"1962","key":"27_CR1","unstructured":"Abramowitz, M. and Stegun, I., eds. Handbook of Mathematical Functions. Wiley, New York, 1962."},{"key":"27_CR2","volume-title":"Advanced Mathematical Methods for Scientists and Engineers","author":"C. Bender","year":"1978","unstructured":"C. Bender and S. Orszag, Advanced Mathematical Methods for Scientists and Engineers, McGrew-Hill, New York 1978."},{"key":"27_CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1051\/ita\/1996300301951","volume":"30","author":"M. Cramer","year":"1996","unstructured":"M. Cramer, A Note Concerning the Limit Distribution of the Quicksort Algorithm, Theoretical Informatics and Applications, 30, 195\u2013207, 1996.","journal-title":"Theoretical Informatics and Applications"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1145\/5925.5930","volume":"33","author":"L. Devroye","year":"1986","unstructured":"L. Devroye, A Note on the Height of binary Search Trees, J. ACM, 33, 489\u2013498, 1986.","journal-title":"J. ACM"},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1006\/jagm.1995.1044","volume":"19","author":"W. Eddy","year":"1995","unstructured":"W. Eddy and M. Schervish, How Many Comparisons Does Quicksort Use, J. Algorithms, 19, 402\u2013431, 1995.","journal-title":"J. Algorithms"},{"key":"27_CR6","volume-title":"JWKB Approximation","author":"N. Froman","year":"1965","unstructured":"N. Froman and P. Froman, JWKB Approximation, North-Holland, Amsterdam 1965."},{"key":"27_CR7","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, Theoretical Informatics and Applications, 23, 317\u2013333, 1989.","journal-title":"Theoretical Informatics and Applications"},{"key":"27_CR8","volume-title":"Applied and Computational Complex Analysis","author":"P. Henrici","year":"1977","unstructured":"P. Henrici, Applied and Computational Complex Analysis, John Wiley&Sons, New York 1977."},{"key":"27_CR9","doi-asserted-by":"publisher","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, Comput. J., 5, 10\u201315, 1962.","journal-title":"Comput. J."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0304-3975(94)00298-W","volume":"144","author":"P. Jacquet","year":"1995","unstructured":"P. Jacquet and W. Szpankowski, Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees, Theoretical Computer Science, 144, 161\u2013197, 1995.","journal-title":"Theoretical Computer Science"},{"key":"27_CR11","unstructured":"C. Knessl and W. Szpankowski, Quicksort Algorithm Again Revisited, Purdue University CSD-TR-97-015, 1997."},{"key":"27_CR12","unstructured":"D. Knuth, The Art of Computer Programming. Sorting and Searching, Addison-Wesley (1973)."},{"key":"27_CR13","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1006\/jagm.1996.0055","volume":"21","author":"C.J. McDiarmid","year":"1996","unstructured":"C.J. McDiarmid and R. Hayward, Large Deviations for Quicksort, J. Algorithms, 21, 476\u2013507, 1996.","journal-title":"J. Algorithms"},{"key":"27_CR14","volume-title":"Evolution of Random Search Trees","author":"H. Mahmoud","year":"1992","unstructured":"H. Mahmoud, Evolution of Random Search Trees, John Wiley & Sons, New York (1992)."},{"key":"27_CR15","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1051\/ita\/1989230303351","volume":"23","author":"M. R\u00e9gnier","year":"1989","unstructured":"M. R\u00e9gnier, A Limiting Distribution for Quicksort, Theoretical Informatics and Applications, 23, 335\u2013343, 1989.","journal-title":"Theoretical Informatics and Applications"},{"key":"27_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1051\/ita\/1991250100851","volume":"25","author":"U. R\u00f6sler","year":"1991","unstructured":"U. R\u00f6sler, A Limit Theorem for Quicksort, Theoretical Informatics and Applications, 25, 85\u2013100, 1991.","journal-title":"Theoretical Informatics and Applications"},{"key":"27_CR17","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0304-4149(92)90035-O","volume":"42","author":"U. R\u00f6sler","year":"1992","unstructured":"U. R\u00f6sler, A Fixed Point Theorem for Distributions, Stochastic Processes and Their Applications, 42, 195\u2013214, 1992.","journal-title":"Stochastic Processes and Their Applications"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0167-7152(94)00209-Q","volume":"25","author":"K.H. Tan","year":"1995","unstructured":"K.H. Tan and P. Hadjicostas, Some Properties of a Limiting Distribution in Quicksort, Statistics & Probability Letters, 25, 87\u201394, 1995.","journal-title":"Statistics & Probability Letters"}],"container-title":["Lecture Notes in Computer Science","Randomization and Approximation Techniques in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49543-6_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T01:06:24Z","timestamp":1550365584000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49543-6_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540651420","9783540495437"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-49543-6_27","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1998]]}}}