{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:36:22Z","timestamp":1759638982910},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319066851"},{"type":"electronic","value":"9783319066868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06686-8_11","type":"book-chapter","created":{"date-parts":[[2014,6,2]],"date-time":"2014-06-02T05:30:40Z","timestamp":1401687040000},"page":"139-152","source":"Crossref","is-referenced-by-count":8,"title":["QuickXsort: Efficient Sorting with n logn\u2009\u2212\u20091.399n\u2009+\u2009o(n) Comparisons on Average"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[]},{"given":"Armin","family":"Wei\u00df","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1016\/S0022-0000(73)80033-9","volume":"7","author":"M. Blum","year":"1973","unstructured":"Blum, M., Floyd, R.W., Pratt, V., Rivest, R.L., Tarjan, R.E.: Time bounds for selection. J. Comput. Syst. Sci.\u00a07(4), 448\u2013461 (1973)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"11_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/S0304-3975(01)00288-2","volume":"285","author":"D. Cantone","year":"2002","unstructured":"Cantone, D., Cinotti, G.: QuickHeapsort, an efficient mix of classical sorting algorithms. Theoretical Computer Science\u00a0285(1), 25\u201342 (2002)","journal-title":"Theoretical Computer Science"},{"key":"11_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-38536-0_3","volume-title":"Computer Science \u2013 Theory and Applications","author":"V. Diekert","year":"2013","unstructured":"Diekert, V., Wei\u00df, A.: Quickheapsort: Modifications and improved analysis. In: Bulatov, A.A., Shur, A.M. (eds.) CSR 2013. LNCS, vol.\u00a07913, pp. 24\u201335. Springer, Heidelberg (2013)"},{"issue":"3","key":"11_CR4","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/BF01990520","volume":"33","author":"R.D. Dutton","year":"1993","unstructured":"Dutton, R.D.: Weak-heap sort. BIT\u00a033(3), 372\u2013381 (1993)","journal-title":"BIT"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Stiegeler, P.: Implementing HEAPSORT with n logn\u2009\u2212\u20090.9n and QUICKSORT with n logn\u2009+\u20090.2 n comparisons. ACM Journal of Experimental Algorithmics\u00a010(5) (2002)","DOI":"10.1145\/944618.944623"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/3-540-46541-3_21","volume-title":"STACS 2000","author":"S. Edelkamp","year":"2000","unstructured":"Edelkamp, S., Wegener, I.: On the performance of WEAK\u2009\u2212\u2009HEAPSORT. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 254\u2013266. Springer, Heidelberg (2000)"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Wei\u00df, A.: QuickXsort: Efficient Sorting with n logn\u2009\u2212\u20091.399n\u2009+\u2009o(n) Comparisons on Average. ArXiv e-prints, abs\/1307.3033 (2013)","DOI":"10.1007\/978-3-319-06686-8_11"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-642-30850-5_15","volume-title":"Experimental Algorithms","author":"A. Elmasry","year":"2012","unstructured":"Elmasry, A., Katajainen, J., Stenmark, M.: Branch mispredictions don\u2019t affect mergesort. In: Klasing, R. (ed.) SEA 2012. LNCS, vol.\u00a07276, pp. 160\u2013171. Springer, Heidelberg (2012)"},{"issue":"5","key":"11_CR9","doi-asserted-by":"publisher","first-page":"387","DOI":"10.2307\/2308750","volume":"66","author":"J. Ford","year":"1959","unstructured":"Ford, J., Lester, R., Johnson, S.M.: A tournament problem. The American Mathematical Monthly\u00a066(5), 387\u2013389 (1959)","journal-title":"The American Mathematical Monthly"},{"key":"11_CR10","unstructured":"Katajainen, J.: The Ultimate Heapsort. In: CATS, pp. 87\u201396 (1998)"},{"issue":"1","key":"11_CR11","first-page":"27","volume":"3","author":"J. Katajainen","year":"1996","unstructured":"Katajainen, J., Pasanen, T., Teuhola, J.: Practical in-place mergesort. Nord. J. Comput.\u00a03(1), 27\u201340 (1996)","journal-title":"Nord. J. Comput."},{"key":"11_CR12","unstructured":"Knuth, D.E.: Sorting and Searching, 2nd edn. The Art of Computer Programming, vol.\u00a03. Addison Wesley Longman (1998)"},{"issue":"3","key":"11_CR13","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1137\/S0097539700382108","volume":"31","author":"C. Mart\u00ednez","year":"2001","unstructured":"Mart\u00ednez, C., Roura, S.: Optimal Sampling Strategies in Quicksort and Quickselect. SIAM J. Comput.\u00a031(3), 683\u2013705 (2001)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"11_CR14","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1002\/(SICI)1097-024X(199708)27:8<983::AID-SPE117>3.0.CO;2-#","volume":"27","author":"D.R. Musser","year":"1997","unstructured":"Musser, D.R.: Introspective sorting and selection algorithms. Software\u2014Practice and Experience\u00a027(8), 983\u2013993 (1997)","journal-title":"Software\u2014Practice and Experience"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/3-540-56279-6_101","volume-title":"Algorithms and Computation","author":"K. Reinhardt","year":"1992","unstructured":"Reinhardt, K.: Sorting in-place with a worst case complexity of n logn\u2009\u2212\u20091.3 n\u2009+\u2009o(logn) comparisons and \u03b5n logn\u2009+\u2009o(1) transports. In: Ibaraki, T., Iwama, K., Yamashita, M., Inagaki, Y., Nishizeki, T. (eds.) ISAAC 1992. LNCS, vol.\u00a0650, pp. 489\u2013498. Springer, Heidelberg (1992)"},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0304-3975(93)90364-Y","volume":"118","author":"I. Wegener","year":"1993","unstructured":"Wegener, I.: Bottom-up-Heapsort, a new variant of Heapsort beating, on an average, Quicksort (if n is not very small). Theoretical Computer Science\u00a0118(1), 81\u201398 (1993)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Computer Science - Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06686-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:05:11Z","timestamp":1558915511000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-06686-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319066851","9783319066868"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06686-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}