{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:52:39Z","timestamp":1725493959805},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671596"},{"type":"electronic","value":"9783540465218"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46521-9_13","type":"book-chapter","created":{"date-parts":[[2007,11,3]],"date-time":"2007-11-03T22:47:16Z","timestamp":1194130036000},"page":"150-162","source":"Crossref","is-referenced-by-count":1,"title":["QuickHeapsort, an Efficient Mix of Classical Sorting Algorithms"],"prefix":"10.1007","author":[{"given":"Domenico","family":"Cantone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianluca","family":"Cincotti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,2,14]]},"reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0020-0190(87)90142-6","volume":"24","author":"S. Carlsson","year":"1987","unstructured":"S. Carlsson, A variant of heapsort with almost optimal number of comparisons, Information Processing Letters, Vol. 24, pp. 247\u2013250, 1987.","journal-title":"Information Processing Letters"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/S0019-9958(84)80053-4","volume":"61","author":"E.E. Doberkat","year":"1984","unstructured":"E.E. Doberkat, An average analysis of Floyd\u2019s algorithm to construct heaps, Information and Control, Vol.61, pp.114\u2013131, 1984.","journal-title":"Information and Control"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"B. Durian, Quicksort without a stack, Lect. Notes Comp. Sci. Vol. 233, pp.283\u2013289, Proc. of MFCS 1986.","DOI":"10.1007\/BFb0016252"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R.W. Floyd","year":"1964","unstructured":"R.W. Floyd, Treesort 3 (alg. 245), Comm. of ACM, Vol. 7, p. 701,1964.","journal-title":"Comm. of ACM"},{"key":"13_CR5","volume-title":"Handbook of algorithms and data structures","author":"G. Gonnet","year":"1991","unstructured":"G. Gonnet, R. Baeza-Yates, Handbook of algorithms and data structures, Addison-Wesley, Reading, MA, 1991."},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"G. Gonnet, J. Munro, Heaps on Heaps, Lect. Notes Comp. Sci. Vol. 140, Proc. of ICALP\u201982, 1982.","DOI":"10.1007\/BFb0012776"},{"issue":"7","key":"13_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1145\/366622.366644","volume":"4","author":"C.A.R. Hoare","year":"1961","unstructured":"C.A.R. Hoare, Algorithm 63(partition) and algorithm 65(find), Comm. of ACM, Vol. 4(7), pp. 321\u2013322, 1961.","journal-title":"Comm. of ACM"},{"key":"13_CR8","volume-title":"Analysis of Algorithms: Computational Methods & Mathematical Tools","author":"M. Hofri","year":"1995","unstructured":"M. Hofri, Analysis of Algorithms: Computational Methods & Mathematical Tools, Oxford University Press, New York, 1995."},{"key":"13_CR9","unstructured":"J. Katajainen, The Ultimate Heapsort, DIKU Report 96\/42, Department of Computer Science, Univ. of Copenhagen, 1996."},{"key":"13_CR10","unstructured":"J. Katajainen, T. Pasanen, J. Tehuola, Top-down not-up heapsort, Proc. of The Algorithm Day in Copenhagen, Dept. of Comp. Sci., University of Copenhagen, pp. 7\u20139, 1997."},{"key":"13_CR11","unstructured":"D.E. Knuth, The Art of Computer Programming, Volume 3: Sorting and Searching, Addison-Wesley, 1973."},{"key":"13_CR12","unstructured":"LEDA, Library of Efficient Data structures and Algorithms, http:\/\/www.mpi-sb.mpg.de\/LEDA\/leda.html ."},{"key":"13_CR13","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/0196-6774(89)90033-3","volume":"10","author":"C.J. McDiarmid","year":"1989","unstructured":"C.J. McDiarmid, B.A. Reed, Building Heaps Fast, Journal of algorithms, Vol. 10, pp. 352\u2013365, 1989.","journal-title":"Journal of algorithms"},{"key":"13_CR14","unstructured":"B.M.E. Moret, H.D. Shapiro, Algorithms from P to NP, Volume 1: Design and Efficiency, The Benjamin Cummings Publishing Company, 1990."},{"key":"13_CR15","unstructured":"T. Pasanen, Elementary average case analysis of Floyd\u2019s algorithms to construct heaps, TUCS Technical Report N. 64, 1996."},{"key":"13_CR16","series-title":"Technical Report","volume-title":"Improving Katajainen\u2019s Ultimate Heapsort","author":"L. Rosaz","year":"1997","unstructured":"L. Rosaz, Improving Katajainen\u2019s Ultimate Heapsort, Technical Report N.1115, Laboratoire de Recherche en Informatique, Universit\u00e9 de Paris Sud, Orsay, 1997."},{"key":"13_CR17","volume-title":"Quicksort","author":"R. Sedgewick","year":"1980","unstructured":"R. Sedgewick, Quicksort, Garland Publishing, New York, 1980."},{"issue":"10","key":"13_CR18","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1145\/359619.359631","volume":"21","author":"R. Sedgewick","year":"1978","unstructured":"R. Sedgewick, Implementing quicksort programs, Comm. of ACM 21(10) pp.847\u2013857, 1978.","journal-title":"Comm. of ACM"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0304-3975(93)90364-Y","volume":"118","author":"I. Wegener","year":"1993","unstructured":"I. Wegener, Bottom-Up-Heapsort, a new variant of Heapsort beating, on an average, Quicksort (if n is not very small), Theorical Comp. Sci., Vol. 118, pp. 81\u201398, 1993.","journal-title":"Theorical Comp. Sci."},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/0890-5401(92)90005-Z","volume":"97","author":"I. Wegener","year":"1992","unstructured":"I. Wegener, The worst case complexity of McDiarmid and Reed\u2019s variant of Bottom-Up heap sort is less than nlogn+1.1n, Information and Computation, Vol. 97, pp. 86\u201396, 1992.","journal-title":"Information and Computation"},{"key":"13_CR21","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W. Williams","year":"1964","unstructured":"J.W. Williams, Heapsort (alg.232), Comm. of ACM, Vol. 7, pp. 347\u2013348, 1964.","journal-title":"Comm. of ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46521-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,26]],"date-time":"2021-08-26T17:47:22Z","timestamp":1630000042000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46521-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671596","9783540465218"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-46521-9_13","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}