{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T10:52:13Z","timestamp":1672656733239},"reference-count":9,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1976,5,1]],"date-time":"1976-05-01T00:00:00Z","timestamp":199756800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1976,5]]},"DOI":"10.1016\/0020-0190(76)90094-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:11:21Z","timestamp":1027656681000},"page":"11-14","source":"Crossref","is-referenced-by-count":14,"title":["Implementing dictionaries using binary trees of very small height"],"prefix":"10.1016","volume":"5","author":[{"given":"H.A.","family":"Maurer","sequence":"first","affiliation":[]},{"given":"Th.","family":"Ottmann","sequence":"additional","affiliation":[]},{"given":"H.-W.","family":"Six","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(76)90094-6_BIB1","first-page":"263","article-title":"Ein Algoritmus zur Informationsorganisation (russisch)","volume":"146","author":"Adelson-Velskii","year":"1962","journal-title":"Doklady Akad. Nauk, SSSR"},{"key":"10.1016\/0020-0190(76)90094-6_BIB2","series-title":"The Design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0020-0190(76)90094-6_BIB3","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1007\/BF00289509","article-title":"Symmetric Binary B-Trees","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Informatica"},{"key":"10.1016\/0020-0190(76)90094-6_BIB4_1","volume":"vol. I","author":"Knuth","year":"1967"},{"key":"10.1016\/0020-0190(76)90094-6_BIB4_2","volume":"vol. III","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(76)90094-6_BIB5","series-title":"Datenstrukturen und Programmierverfahren","author":"Maurer","year":"1974"},{"key":"10.1016\/0020-0190(76)90094-6_BIB6","article-title":"Zur Manipulation von Zahlenmengen","volume":"4","author":"Maurer","year":"1976","journal-title":"Angewandte Informatik"},{"key":"10.1016\/0020-0190(76)90094-6_BIB7","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1137\/0202005","article-title":"Binary Trees of Bounded Balance","volume":"2","author":"Nievergelt","year":"1973","journal-title":"SIAM J. Computing"},{"key":"10.1016\/0020-0190(76)90094-6_BIB8","unstructured":"Th. Ottman and H.-W. Six, Eine neue Klasse con ausgeglichen Bin\u00e4rb\u00e4umen, Inst. f. Angewandte Informatik und Formale Beschreibungsverfahren, Universit\u00e4t Karlsruhe, Bericht Nr. 35."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019076900946?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019076900946?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T16:25:17Z","timestamp":1555086317000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019076900946"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,5]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1976,5]]}},"alternative-id":["0020019076900946"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(76)90094-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1976,5]]}}}