{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T18:57:22Z","timestamp":1794337042642,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540115762","type":"print"},{"value":"9783540393085","type":"electronic"}],"license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":[[1982]]},"DOI":"10.1007\/bfb0012776","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T08:00:52Z","timestamp":1132732852000},"page":"282-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Heaps on heaps"],"prefix":"10.1007","author":[{"given":"Gaston H.","family":"Gonnet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,10,22]]},"reference":[{"key":"25_CR1","first-page":"701","volume":"12","author":"R.W. Floyd","year":"1964","unstructured":"R.W. Floyd, Algorithm 245, Treesort 3, CACM 7, 12 (Dec. 1964), 701.","journal-title":"Algorithm 245, Treesort 3, CACM 7"},{"key":"25_CR2","unstructured":"D.E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, 1973."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/359460.359478","volume":"4","author":"J. Vuillemin","year":"1978","unstructured":"J. Vuillemin, A Data Structure for Manipulating Priority Queues, CACM 21, 4 (April 1978), 309\u2013314.","journal-title":"CACM 21"},{"key":"25_CR4","first-page":"347","volume":"6","author":"J.W.J. Williams","year":"1964","unstructured":"J.W.J. Williams, Algorithm 232, Heapsort, CACM 7, 6 (June 1964), 347\u2013348.","journal-title":"Algorithm 232, Heapsort, CACM 7"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0012776","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T08:57:44Z","timestamp":1558256264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0012776"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982]]},"ISBN":["9783540115762","9783540393085"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/bfb0012776","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0012751","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982]]},"assertion":[{"value":"22 October 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}