{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:22Z","timestamp":1725549682089},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_3","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"14-23","source":"Crossref","is-referenced-by-count":4,"title":["Heap Building Bounds"],"prefix":"10.1007","author":[{"given":"Zhentao","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce A.","family":"Reed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","first-page":"393","volume-title":"Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms","author":"S. Carlsson","year":"1992","unstructured":"Carlsson, S., Chen, J.: The complexity of heaps. In: Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, pp. 393\u2013402. SIAM, Philadelphia (1992)"},{"key":"3_CR2","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/BFb0015430","volume-title":"Algorithms and Computation","author":"S. Carlsson","year":"1995","unstructured":"Carlsson, S., Chen, J.: Heap construction: Optimal in both worst and average cases? In: Algorithms and Computation, pp. 254\u2013263. Springer, Heidelberg (1995)"},{"key":"3_CR3","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Sten, C.: Introduction to Algorithms, 2nd edn. The MIT Press, McGraw-Hill Book Company (2001)"},{"issue":"12","key":"3_CR4","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"R.W. Floyd","year":"1964","unstructured":"Floyd, R.W.: Algorithm 245: Treesort. Commun. ACM\u00a07(12), 701 (1964)","journal-title":"Commun. ACM"},{"issue":"4","key":"3_CR5","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0215068","volume":"15","author":"G.H. Gonnet","year":"1986","unstructured":"Gonnet, G.H., Munro, I.: Heaps on heaps. SIAM Journal of Computing\u00a015(4), 964\u2013971 (1986)","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"3_CR6","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1016\/0196-6774(89)90033-3","volume":"10","author":"C.J. McDiarmid","year":"1989","unstructured":"McDiarmid, C.J., Reed, B.A.: Building heaps fast. J. Algorithms\u00a010(3), 352\u2013365 (1989)","journal-title":"J. Algorithms"},{"issue":"6","key":"3_CR7","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1145\/512274.512284","volume":"7","author":"J.W.J. Williams","year":"1964","unstructured":"Williams, J.W.J.: Algorithm 232: Heapsort. Commun. of the ACM\u00a07(6), 347\u2013348 (1964)","journal-title":"Commun. of the ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,24]],"date-time":"2021-10-24T19:16:52Z","timestamp":1635103012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11534273_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}