{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T00:48:13Z","timestamp":1742950093183,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425120"},{"type":"electronic","value":"9783540446910"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44691-5_4","type":"book-chapter","created":{"date-parts":[[2007,6,2]],"date-time":"2007-06-02T22:32:07Z","timestamp":1180823527000},"page":"39-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Pushing the Limits in Sequential Sorting"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Edelkamp","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick","family":"Stiegeler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,24]]},"reference":[{"key":"4_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/3-540-48318-7_24","volume-title":"WAE","author":"J. Bojesen","year":"1999","unstructured":"J. Bojesen, J. Katajainen, and M. Spork. Performance engineering case study: Heap construction. WAE, LNCS, pages 301\u2013315, 1999."},{"key":"4_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/3-540-46521-9_13","volume-title":"CIAC","author":"D. Cantone","year":"2000","unstructured":"D. Cantone and G. Cinotti. QuickHeapsort, an efficient mix of classical sorting algorithms. CIAC, LNCS, 1767:150\u2013162, 2000."},{"issue":"2","key":"4_CR3","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 case analysis of Floyd\u2019s algorithm to construct heaps. Information and Control, 61(2):114\u2013131, 1984.","journal-title":"Information and Control"},{"key":"4_CR4","series-title":"Technical report","volume-title":"The weak-heap data structure","author":"R. D. Dutton","year":"1992","unstructured":"R. D. Dutton. The weak-heap data structure. Technical report, University of Central Florida, Orlando, FL 32816, 1992."},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/BF01990520","volume":"33","author":"R. D. Dutton","year":"1993","unstructured":"R. D. Dutton. Weak-heap sort. BIT, 33:372\u2013381, 1993.","journal-title":"BIT"},{"key":"4_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1007\/3-540-46541-3_21","volume-title":"STACS","author":"S. Edelkamp","year":"2000","unstructured":"S. Edelkamp and I. Wegener. On the performance of WEAK-HEAPSORT. STACS, LNCS, pages 254\u2013266, 2000."},{"issue":"3","key":"4_CR7","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M. L. Fredman","year":"1987","unstructured":"M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in improved network optimization algorithm. Journal ofthe ACM, 34(3):596\u2013615, 1987.","journal-title":"Journal ofthe ACM"},{"issue":"1","key":"4_CR8","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. Computer Journal, 5(1):10\u201315, 1962.","journal-title":"Computer Journal"},{"key":"4_CR9","volume-title":"The Art ofComputer Programming, Vol. III: Sorting and Searching","author":"D. Knuth","year":"1973","unstructured":"D. Knuth. The Art ofComputer Programming, Vol. III: Sorting and Searching. Addison-Wesley, Reading, MA, 1973."},{"doi-asserted-by":"crossref","unstructured":"M. Li and P. Vit\u00e1nyi. An Introduction to Kolmogorov Complexity and Its Applications. Text and Monographs in Computer Science. Springer-Verlag, 1993.","key":"4_CR10","DOI":"10.1007\/978-1-4757-3860-5"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/0196-6774(89)90033-3","volume":"10","author":"C. J. H. McDiarmid","year":"1989","unstructured":"C. J. H. McDiarmid and B. A. Reed. Building heaps fast. Journal of Algorithms, 10:352\u2013365, 1989.","journal-title":"Journal of Algorithms"},{"unstructured":"S. Nilsson. Radix Sorting & Searching. PhD thesis, Lund University, 1996.","key":"4_CR12"},{"issue":"3","key":"4_CR13","first-page":"63","volume":"1","author":"A. Papernov","year":"1965","unstructured":"A. Papernov and G. Stasevich. The worst case in shellsort and related algorithms. Problems Inform. Transmission, 1(3):63\u201375, 1965.","journal-title":"Problems Inform. Transmission"},{"key":"4_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/3-540-56279-6_101","volume-title":"Sorting in-place with a worst case complexity of n log n \u2212 1.3n + O(log n) comparisons and \u03b5n log n + O(1) transports","author":"K. Reinhardt","year":"1992","unstructured":"K. Reinhardt. Sorting in-place with a worst case complexity of n log n \u2212 1.3n + O(log n) comparisons and \u03b5n log n + O(1) transports. LNCS, 650:489\u2013499, 1992."},{"key":"4_CR15","volume-title":"One hundred problems in elemantary mathematics (Problems 52,85)","author":"H. Steinhaus","year":"1958","unstructured":"H. Steinhaus. One hundred problems in elemantary mathematics (Problems 52,85). Pergamon Press, London, 1958."},{"key":"4_CR16","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/362736.362753","volume":"13","author":"M. H. van Emden","year":"1970","unstructured":"M. H. van Emden. Increasing the efficiency of QUICKSORT. Communications of the ACM, 13:563\u2013567, 1970.","journal-title":"Communications of the ACM"},{"issue":"1","key":"4_CR17","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 HEAPSORT is less than n log n + 1.1n. Information and Computation, 97(1):86\u201396, 1992.","journal-title":"Information and Computation"},{"key":"4_CR18","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). TCS, 118:81\u201398, 1993.","journal-title":"TCS"}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44691-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T19:03:01Z","timestamp":1707937381000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44691-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425120","9783540446910"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44691-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"24 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}