{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T17:47:15Z","timestamp":1773683235279,"version":"3.50.1"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,3,1]],"date-time":"1991-03-01T00:00:00Z","timestamp":667785600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1991,3]]},"DOI":"10.1016\/0196-6774(91)90027-v","type":"journal-article","created":{"date-parts":[[2004,11,6]],"date-time":"2004-11-06T18:03:10Z","timestamp":1099764190000},"page":"126-153","source":"Crossref","is-referenced-by-count":14,"title":["Average case analysis of heap building by repeated insertion"],"prefix":"10.1016","volume":"12","author":[{"given":"Ryan","family":"Hayward","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"McDiarmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(91)90027-V_BIB1","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1016\/0196-6774(85)90028-8","article-title":"Repeated random insertion into a priority queue","volume":"6","author":"Bollob\u00e1s","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0196-6774(91)90027-V_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\/0196-6774(91)90027-V_BIB3","unstructured":"L. Devroye, private communication."},{"key":"10.1016\/0196-6774(91)90027-V_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. and Control"},{"key":"10.1016\/0196-6774(91)90027-V_BIB5","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","article-title":"Algorithm 245","volume":"7","author":"Floyd","year":"1964","journal-title":"Comm. ACM"},{"key":"10.1016\/0196-6774(91)90027-V_BIB6","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0020-0190(88)90101-9","article-title":"On the random construction of heaps","volume":"27","author":"Frieze","year":"1988","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0196-6774(91)90027-V_BIB7","doi-asserted-by":"crossref","first-page":"13","DOI":"10.2307\/2282952","article-title":"Probability inequalities for sums of bounded random variables","volume":"58","author":"Hoeffding","year":"1963","journal-title":"J. Amer. Statist. Assoc."},{"key":"10.1016\/0196-6774(91)90027-V_BIB8","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1137\/0215068","article-title":"Heaps on heaps","volume":"15","author":"Gonnet","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(91)90027-V_BIB9","author":"Knuth","year":"1973"},{"key":"10.1016\/0196-6774(91)90027-V_BIB10","series-title":"Surveys in Combinatorics, 1989","article-title":"On the method of bounded differences","volume":"Vol. 141","author":"McDiarmid","year":"1989"},{"key":"10.1016\/0196-6774(91)90027-V_BIB11","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\/0196-6774(91)90027-V_BIB12","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1109\/TSE.1975.6312854","article-title":"Random insertion into a priority queue structure","author":"Porter","year":"1975","journal-title":"IEEE Trans. Software Eng."},{"key":"10.1016\/0196-6774(91)90027-V_BIB13","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":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190027V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:019667749190027V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,6,27]],"date-time":"2021-06-27T20:14:42Z","timestamp":1624824882000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/019667749190027V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,3]]}},"alternative-id":["019667749190027V"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(91)90027-v","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1991,3]]}}}