{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T22:54:40Z","timestamp":1676415280521},"reference-count":8,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7808,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1992,3]]},"DOI":"10.1016\/0890-5401(92)90005-z","type":"journal-article","created":{"date-parts":[[2004,12,16]],"date-time":"2004-12-16T20:34:26Z","timestamp":1103229266000},"page":"86-96","source":"Crossref","is-referenced-by-count":20,"title":["The worst case complexity of McDiarmid and Reed's variant of BOTTOM-UP HEAPSORT is less than n log n + 1.1n"],"prefix":"10.1016","volume":"97","author":[{"given":"Ingo","family":"Wegener","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(92)90005-Z_bib1","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0020-0190(87)90142-6","article-title":"A variant of HEAPSORT with almost optimal number of comparsons","volume":"24","author":"Carlsson","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(92)90005-Z_bib2","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1007\/BF01937350","article-title":"Average-case results on HEAPSORT","volume":"27","author":"Carlsson","year":"1987","journal-title":"BIT"},{"key":"10.1016\/0890-5401(92)90005-Z_bib3","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF00264353","article-title":"Deleting the root of a heap","volume":"17","author":"Doberkat","year":"1982","journal-title":"Acta Informat."},{"key":"10.1016\/0890-5401(92)90005-Z_bib4","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/S0019-9958(84)80053-4","article-title":"An average case analysis of Floyd's algorithm to construct heaps","volume":"61","author":"Doberkat","year":"1984","journal-title":"Inform. Control"},{"key":"10.1016\/0890-5401(92)90005-Z_bib5","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","article-title":"Algorithm 245, treesort 3","volume":"7","author":"Floyd","year":"1964","journal-title":"Comm. ACM"},{"key":"10.1016\/0890-5401(92)90005-Z_bib6","doi-asserted-by":"crossref","first-page":"352","DOI":"10.1016\/0196-6774(89)90033-3","article-title":"Building heaps fast","volume":"10","author":"McDiarmid","year":"1989","journal-title":"J. Algorithms"},{"key":"10.1016\/0890-5401(92)90005-Z_bib7","series-title":"BOTTOM-UP HEAPSORT, a new variant of HEAPSORT beating on average QUICKSORT (if n is not very small)","author":"Wegener","year":"1989"},{"key":"10.1016\/0890-5401(92)90005-Z_bib8","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","article-title":"Algorithm 232","volume":"7","author":"Williams","year":"1964","journal-title":"Comm. ACM"}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290005Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019290005Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T18:05:49Z","timestamp":1625162749000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019290005Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["089054019290005Z"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(92)90005-z","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}