{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:55:35Z","timestamp":1773410135798,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642330896","type":"print"},{"value":"9783642330902","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_71","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"825-836","source":"Crossref","is-referenced-by-count":13,"title":["Average Case Analysis of Java 7\u2019s Dual Pivot Quicksort"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"Wild","sequence":"first","affiliation":[]},{"given":"Markus E.","family":"Nebel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"71_CR1","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R.: Quicksort. The Computer Journal\u00a05(1), 10\u201316 (1962)\u00b8","journal-title":"The Computer Journal"},{"key":"71_CR2","unstructured":"Sedgewick, R.: Quicksort. Phd thesis, Stanford University (1975)"},{"key":"71_CR3","unstructured":"Hennequin, P.: Analyse en moyenne d\u2019algorithme, tri rapide et arbres de recherche. Ph.d. thesis, Ecole Politechnique, Palaiseau (1991)"},{"issue":"3","key":"71_CR4","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1145\/321592.321600","volume":"17","author":"W.D. Frazer","year":"1970","unstructured":"Frazer, W.D., McKellar, A.C.: Samplesort: A Sampling Approach to Minimal Storage Tree Sorting. Journal of the ACM\u00a017(3), 496\u2013507 (1970)","journal-title":"Journal of the ACM"},{"key":"71_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"784","DOI":"10.1007\/978-3-540-30140-0_69","volume-title":"Algorithms \u2013 ESA 2004","author":"P. Sanders","year":"2004","unstructured":"Sanders, P., Winkel, S.: Super Scalar Sample Sort. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 784\u2013796. Springer, Heidelberg (2004)"},{"key":"71_CR6","doi-asserted-by":"crossref","unstructured":"Leischner, N., Osipov, V., Sanders, P.: GPU sample sort. In: 2010 IEEE International Symposium on Parallel Distributed Processing IPDPS, pp. 1\u201310. IEEE (2009)","DOI":"10.1109\/IPDPS.2010.5470444"},{"key":"71_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/113379.113380","volume-title":"Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA 1991","author":"G.E. Blelloch","year":"1991","unstructured":"Blelloch, G.E., Leiserson, C.E., Maggs, B.M., Plaxton, C.G., Smith, S.J., Zagha, M.: A comparison of sorting algorithms for the connection machine CM-2. In: Proceedings of the Third Annual ACM Symposium on Parallel Algorithms and Architectures - SPAA 1991, pp. 3\u201316. ACM Press, New York (1991)"},{"issue":"10","key":"71_CR8","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1145\/359619.359631","volume":"21","author":"R. Sedgewick","year":"1978","unstructured":"Sedgewick, R.: Implementing Quicksort programs. Comm. ACM\u00a021(10), 847\u2013857 (1978)","journal-title":"Comm. ACM"},{"issue":"2","key":"71_CR9","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/0206018","volume":"6","author":"R. Sedgewick","year":"1977","unstructured":"Sedgewick, R.: Quicksort with Equal Keys. SIAM Journal on Computing\u00a06(2), 240\u2013267 (1977)","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"71_CR10","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/BF00289467","volume":"7","author":"R. Sedgewick","year":"1977","unstructured":"Sedgewick, R.: The analysis of Quicksort programs. Acta Inf.\u00a07(4), 327\u2013355 (1977)","journal-title":"Acta Inf."},{"issue":"7","key":"71_CR11","first-page":"321","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"Hoare, C.A.R.: Algorithm 63: Partition. Comm.\u00a04(7), 321 (1961)","journal-title":"Comm."},{"issue":"11","key":"71_CR12","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1002\/spe.4380231105","volume":"23","author":"J.L.J. Bentley","year":"1993","unstructured":"Bentley, J.L.J., McIlroy, M.D.: Engineering a sort function. Software: Practice and Experience\u00a023(11), 1249\u20131265 (1993)","journal-title":"Software: Practice and Experience"},{"issue":"3","key":"71_CR13","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1051\/ita\/1989230303171","volume":"23","author":"P. Hennequin","year":"1989","unstructured":"Hennequin, P.: Combinatorial analysis of Quicksort algorithm. Informatique Th\u00e9orique et Applications\u00a023(3), 317\u2013333 (1989)","journal-title":"Informatique Th\u00e9orique et Applications"},{"issue":"1","key":"71_CR14","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.tcs.2009.09.025","volume":"411","author":"U. Laube","year":"2010","unstructured":"Laube, U., Nebel, M.E.: Maximum likelihood analysis of algorithms and data structures. Theoretical Computer Science\u00a0411(1), 188\u2013212 (2010)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_71.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:09Z","timestamp":1620129309000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_71"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_71","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}