{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T07:38:09Z","timestamp":1758267489430},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1985,6,1]],"date-time":"1985-06-01T00:00:00Z","timestamp":486432000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,6]]},"DOI":"10.1007\/bf00264229","type":"journal-article","created":{"date-parts":[[2004,9,27]],"date-time":"2004-09-27T17:17:22Z","timestamp":1096305442000},"page":"171-186","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["An algorithm for merging heaps"],"prefix":"10.1007","volume":"22","author":[{"given":"J\u00f6rg -R.","family":"Sack","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Strothotte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1985,6,1]]},"reference":[{"key":"BF00264229_CR1","first-page":"99","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The design and analysis of computer algorithms, p. 99. Reading, MA: Addison-Wesley 1974"},{"key":"BF00264229_CR2","volume-title":"Data structures and algorithms","author":"A.V. Aho","year":"1983","unstructured":"Aho, A.V., Hopcroft, J.E., Ullman, J.D.: Data structures and algorithms. Reading, MA: Addison-Wesley 1983"},{"key":"BF00264229_CR3","volume-title":"The analysis of a practical and nearly optimal priority queue","author":"M.R. Brown","year":"1980","unstructured":"Brown, M.R.: The analysis of a practical and nearly optimal priority queue. New York: Garland Publishing 1980"},{"key":"BF00264229_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 3. CACM 7, 701 (1964)","journal-title":"CACM"},{"key":"BF00264229_CR5","doi-asserted-by":"crossref","unstructured":"Francon, J., Viennot, G., Vuillemin, J.: Description and analysis of an efficient priority queue representation. Proc. 19th Ann. Symp. Found. Comput Sci. MI: Ann Arbor, pp. 1\u20137 (1978)","DOI":"10.1109\/SFCS.1978.13"},{"key":"BF00264229_CR6","volume-title":"A handbook of algorithms and data structures","author":"G.H. Gonnet","year":"1984","unstructured":"Gonnet, G.H.: A handbook of algorithms and data structures. Reading, MA: Addison-Wesley 1984"},{"key":"BF00264229_CR7","doi-asserted-by":"crossref","unstructured":"Gonnet, G.H., Munro, I.J.: Heaps on Heaps. Proc. ICALP, Aarhus 9, pp.282\u2013291 (July 1982)","DOI":"10.1007\/BFb0012776"},{"key":"BF00264229_CR8","volume-title":"The art of computer programming. Vol. 3: Sorting and searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The art of computer programming. Vol. 3: Sorting and searching. Reading, MA: Addison-Wesley 1973"},{"key":"BF00264229_CR9","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"R.E. Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms. Philadelphia, PA: Soc. Ind. Appl. Math. 1983"},{"key":"BF00264229_CR10","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/359460.359478","volume":"21","author":"J. Vuillemin","year":"1978","unstructured":"Vuillemin, J.: A data structure for manipulating priority queues. CACM 21, 309\u2013315 (1978)","journal-title":"CACM"},{"key":"BF00264229_CR11","doi-asserted-by":"publisher","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. CACM 7, 347\u2013348 (1964)","journal-title":"CACM"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264229.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF00264229\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264229","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00264229.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,11]],"date-time":"2023-04-11T08:06:18Z","timestamp":1681200378000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF00264229"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,6]]},"references-count":11,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1985,6]]}},"alternative-id":["BF00264229"],"URL":"https:\/\/doi.org\/10.1007\/bf00264229","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,6]]},"assertion":[{"value":"8 March 1984","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 1985","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}