{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:32:34Z","timestamp":1725456754913},"publisher-location":"Berlin\/Heidelberg","reference-count":10,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540529535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0029650","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T05:33:46Z","timestamp":1133415226000},"page":"516-522","source":"Crossref","is-referenced-by-count":9,"title":["Bottom-up-heap sort, a new variant of heap sort beating on average quick sort (if n is not very small)"],"prefix":"10.1007","author":[{"given":"Ingo","family":"Wegener","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"59_CR1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(87)90142-6","volume":"25","author":"S. Carlsson","year":"1987","unstructured":"Carlsson, S. (1987a). A variant of HEAP SORT with almost optimal number of comparisons. Information Processing Letters 25, 247\u2013250.","journal-title":"Information Processing Letters"},{"key":"59_CR2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01937350","volume":"27","author":"S. Carlsson","year":"1987","unstructured":"Carlsson, S. (1987b). Average-case results on HEAP SORT. BIT 27, 2\u201317.","journal-title":"BIT"},{"key":"59_CR3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00264353","volume":"17","author":"E.E. Doberkat","year":"1982","unstructured":"Doberkat, E.E. (1982). Deleting the root of a heap. Acta Informatica 17, 245\u2013265.","journal-title":"Acta Informatica"},{"key":"59_CR4","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/S0019-9958(84)80053-4","volume":"61","author":"E.E. Doberkat","year":"1984","unstructured":"Doberkat, E.E. (1984). An average case analysis of Floyd's algorithm to construct heaps. Information and Control 61, 114\u2013131.","journal-title":"Information and Control"},{"key":"59_CR5","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R.W. Floyd","year":"1964","unstructured":"Floyd, R.W. (1964). Algorithm 245, treesort 3. Communication of the ACM 7, 701.","journal-title":"Communication of the ACM"},{"key":"59_CR6","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1093\/comjnl\/5.1.10","volume":"5","author":"C.A.R. Hoare","year":"1962","unstructured":"Hoare, C.A.R. (1962). Quicksort. Computer Journal 5, 10\u201315.","journal-title":"Computer Journal"},{"key":"59_CR7","unstructured":"Kemp,R. (1989). Pers. communication."},{"key":"59_CR8","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/0196-6774(89)90033-3","volume":"10","author":"C.J.H. McDiarmid","year":"1989","unstructured":"McDiarmid, C.J.H. and Reed, B.A. (1989). Building heaps fast. Journal of Algorithms 10, 352\u2013365.","journal-title":"Journal of Algorithms"},{"key":"59_CR9","unstructured":"Wegener,I. (1989). Complete version of this paper. Preprint."},{"key":"59_CR10","unstructured":"Wegener,I. (1990). The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP-HEAP SORT is less than n log n + 1.1n. Preprint."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1990"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029650.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:59:54Z","timestamp":1607551194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540529535"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/bfb0029650","relation":{},"subject":[]}}