{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:54:50Z","timestamp":1725663290282},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540102915"},{"type":"electronic","value":"9783540384359"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10291-4_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:10:36Z","timestamp":1330189836000},"page":"90-112","source":"Crossref","is-referenced-by-count":1,"title":["A new data structure for representing sorted lists"],"prefix":"10.1007","author":[{"given":"Kurt","family":"Mehlhorn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,25]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","volume":"1","author":"Bayer","year":"1972","unstructured":"Bayer\/McCreight: \"Organization and Maintenance of Large Ordered Indizes\", Acta Informatica 1 (1972), 173\u2013189","journal-title":"Acta Informatica"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Blum\/Mehlhorn: \"On the Average Number of Rebalancing Steps in Weight-Balanced Trees\", 4th GI-Conference on Theoretical Computer Science, Aachen 1979, LNCS Vol. 67, 67\u201378","DOI":"10.1007\/3-540-09118-1_9"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Brown\/Tarjan: \"A Representation for Linear Lists with Movable Fingers\", 10th ACM Symposium on Theory of Computing, p. 19\u201328, 1978","DOI":"10.1145\/800133.804328"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Guibas\/McCreight\/Plass\/Roberts: \"A new representation for linear lists\", 9th ACM Symposium on Theory of Computing, 1977, 49\u201360","DOI":"10.1145\/800105.803395"},{"key":"8_CR5","unstructured":"Mehlhorn: \"Effiziente Algorithmen\", Teubner-Verlag, Studienb\u00fccher Informatik, 1977"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Mehlhorn 79a: \"Sorting Presorted Files\", 4th GI-Conference on Theoretical Computer Science, Aachen 1979, LNCS, Vol. 67, p. 199\u2013212","DOI":"10.1007\/3-540-09118-1_22"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Mehlhorn 79b: \"Searching, Sorting and Information Theory\", MFCS 79, Springer Lecture Notes in Computer Science, Vol. 74, p. 131\u2013145","DOI":"10.1007\/3-540-09526-8_10"}],"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_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:02:58Z","timestamp":1605643378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10291-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540102915","9783540384359"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-10291-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}