{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T16:59:15Z","timestamp":1725728355835},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642385353"},{"type":"electronic","value":"9783642385360"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38536-0_3","type":"book-chapter","created":{"date-parts":[[2013,6,3]],"date-time":"2013-06-03T01:03:04Z","timestamp":1370221384000},"page":"24-35","source":"Crossref","is-referenced-by-count":2,"title":["QuickHeapsort: Modifications and Improved Analysis"],"prefix":"10.1007","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[]},{"given":"Armin","family":"Wei\u00df","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"3_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":"3_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., Cincotti, G.: Quickheapsort, an efficient mix of classical sorting algorithms. Theor. Comput. Sci.\u00a0285(1), 25\u201342 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/3-540-58325-4_192","volume-title":"Algorithms and Computation","author":"S. Carlsson","year":"1994","unstructured":"Carlsson, S., Chen, J., Mattsson, C.: Heaps with Bits. In: Du, D.-Z., Zhang, X.-S. (eds.) ISAAC 1994. LNCS, vol.\u00a0834, pp. 288\u2013296. Springer, Heidelberg (1994)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-57568-5_241","volume-title":"Algorithms and Computation","author":"J. Chen","year":"1993","unstructured":"Chen, J.: A Framework for Constructing Heap-like structures in-place. In: Ng, K.W., Balasubramanian, N.V., Raghavan, P., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol.\u00a0762, pp. 118\u2013127. Springer, Heidelberg (1993)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/978-3-642-32589-2_25","volume-title":"Mathematical Foundations of Computer Science 2012","author":"J. Chen","year":"2012","unstructured":"Chen, J., Edelkamp, S., Elmasry, A., Katajainen, J.: In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol.\u00a07464, pp. 259\u2013270. Springer, Heidelberg (2012)"},{"key":"3_CR6","unstructured":"Diekert, V., Weiss, A.: Quickheapsort: Modifications and improved analysis. ArXiv e-prints, abs\/1209.4214 (2012)"},{"issue":"3","key":"3_CR7","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":"3_CR8","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/944618.944623","volume":"7","author":"S. Edelkamp","year":"2002","unstructured":"Edelkamp, S., Stiegeler, P.: Implementing HEAPSORT with n logn\u2009\u2212\u20090.9n and QUICKSORT with n logn\u2009+\u20090.2n comparisons. ACM Journal of Experimental Algorithmics\u00a07, 5 (2002)","journal-title":"ACM Journal of Experimental Algorithmics"},{"issue":"12","key":"3_CR9","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R.W. Floyd","year":"1964","unstructured":"Floyd, R.W.: Algorithm 245: Treesort. Commun. ACM\u00a07(12), 701 (1964)","journal-title":"Commun. ACM"},{"issue":"4","key":"3_CR10","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0215068","volume":"15","author":"G.H. Gonnet","year":"1986","unstructured":"Gonnet, G.H., Munro, J.I.: Heaps on Heaps. SIAM J. Comput.\u00a015(4), 964\u2013971 (1986)","journal-title":"SIAM J. Comput."},{"key":"3_CR11","unstructured":"Katajainen, J.: The Ultimate Heapsort. In: Lin, X. (ed.) CATS. Australian Computer Science Communications, vol.\u00a020, pp. 87\u201396. Springer-Verlag Singapore Pte. Ltd. (1998)"},{"issue":"3","key":"3_CR12","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":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/0196-6774(89)90033-3","volume":"10","author":"C. McDiarmid","year":"1989","unstructured":"McDiarmid, C., Reed, B.A.: Building Heaps Fast. J. Algorithms\u00a010(3), 352\u2013365 (1989)","journal-title":"J. Algorithms"},{"key":"3_CR14","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., Inagaki, Y., Iwama, K., Nishizeki, T., Yamashita, M. (eds.) ISAAC 1992. LNCS, vol.\u00a0650, pp. 489\u2013498. Springer, Heidelberg (1992)"},{"key":"3_CR15","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1007\/s11390-007-9106-7","volume":"22","author":"X.-D. Wang","year":"2007","unstructured":"Wang, X.-D., Wu, Y.-J.: An Improved HEAPSORT Algorithm with nlogn\u2009\u2212\u20090.788928n Comparisons in the Worst Case. Journal of Computer Science and Technology\u00a022, 898\u2013903 (2007), doi:10.1007\/s11390-007-9106-7","journal-title":"Journal of Computer Science and Technology"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/BFb0020794","volume-title":"STACS 91","author":"I. Wegener","year":"1991","unstructured":"Wegener, I.: The Worst Case Complexity of McDiarmid and Reed\u2019s Variant of Bottom-Up-Heap Sort is Less Than n logn\u2009+\u20091.1n. In: Jantzen, M., Choffrut, C. (eds.) STACS 1991. LNCS, vol.\u00a0480, pp. 137\u2013147. Springer, Heidelberg (1991)"},{"issue":"1","key":"3_CR17","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 \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38536-0_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T16:33:58Z","timestamp":1557765238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38536-0_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642385353","9783642385360"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38536-0_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}