{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T02:45:05Z","timestamp":1778294705267,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540102915","type":"print"},{"value":"9783540384359","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10291-4_10","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T12:08:56Z","timestamp":1330171736000},"page":"127-136","source":"Crossref","is-referenced-by-count":2,"title":["On a generalization of heaps"],"prefix":"10.1007","author":[{"given":"Hartmut","family":"Noltemeier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"10_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. V. Aho","year":"1976","unstructured":"Aho, A.V., J.E. Hopcroft and J.D. Ullman: \"The design and analysis of computer algorithms\", Addision-Wesley, Reading 1976."},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Blum, M.: \"A machine independent theory of the complexity of recursive functions\", JACM, 14, 1967.","DOI":"10.1145\/321386.321395"},{"key":"10_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-95113-8","volume-title":"Selecta Mathematica I","author":"K. Jacobs","year":"1969","unstructured":"Jacobs, K.: Selecta Mathematica I, Springer, Heidelberg, 1969."},{"key":"10_CR4","unstructured":"Munro, J.J. and H. Suwanda: \"Implicit Data Structures\", Proc. 11th Annual ACM STOC, Atlanta 1979."},{"key":"10_CR5","unstructured":"Noltemeier, H.: \"Dilworth's theorem and lower complexity bounds in implicit data structures\", Proc. V. Symposium on Oper. Research, Cologne 1980."},{"key":"10_CR6","unstructured":"Paul, W.: Komplexit\u00e4tstheorie; Teubner, Stuttgart 1978."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Snyder, L.: \"On Uniquely Represented Data Structure\", Proc. 18th IEEE Symp. on FOCS, 1977.","DOI":"10.1109\/SFCS.1977.22"}],"container-title":["Lecture Notes in Computer Science","Graphtheoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10291-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:02:52Z","timestamp":1605625372000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10291-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540102915","9783540384359"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-10291-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981]]}}}