{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T10:10:04Z","timestamp":1648807804501},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"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 Systems"],"published-print":{"date-parts":[[1976,1]]},"DOI":"10.1016\/0306-4379(76)90010-7","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T01:31:39Z","timestamp":1060306299000},"page":"65-70","source":"Crossref","is-referenced-by-count":3,"title":["Optimal tree lists for information storage and retrieval"],"prefix":"10.1016","volume":"2","author":[{"given":"L.E","family":"Stanfel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0306-4379(76)90010-7_BIB1","series-title":"Introduction to Data Structures and Non-Numeric Computations","author":"Brillinger","year":"1972"},{"key":"10.1016\/0306-4379(76)90010-7_BIB2","doi-asserted-by":"crossref","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","article-title":"Variable length binary encodings","volume":"38","author":"Gilbert","year":"1959","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0306-4379(76)90010-7_BIB3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1109\/TIT.1961.1057615","article-title":"Minimum-redundancy coding for the discrete noiseless channel","author":"Karp","year":"1961","journal-title":"IRE Trans.\u2014Inform. Theory"},{"key":"10.1016\/0306-4379(76)90010-7_BIB4","series-title":"Optimization Techniques in Operations Research","author":"Sivazlian","year":"1975"},{"key":"10.1016\/0306-4379(76)90010-7_BIB5","doi-asserted-by":"crossref","unstructured":"L. E. Stanfel: Tree structures for optimal searching. J. A.C.M. 17(3), 508\u2013517 (19 ).","DOI":"10.1145\/321592.321601"},{"key":"10.1016\/0306-4379(76)90010-7_BIB6","article-title":"Practical aspects of doubly-chained trees for retrieval","author":"Stanfel","year":"1972","journal-title":"J. A.C.M."},{"key":"10.1016\/0306-4379(76)90010-7_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0271(73)90006-5","article-title":"Optimal trees for a class of information retrieval problems","volume":"9","author":"Stanfel","year":"1973","journal-title":"Inform. Storage Retriev."},{"issue":"5","key":"10.1016\/0306-4379(76)90010-7_BIB8","first-page":"272","article-title":"Use of tree structures for processing files","volume":"6","author":"Sussenguth","year":"1963","journal-title":"Comm. A.C.M."}],"container-title":["Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437976900107?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0306437976900107?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,25]],"date-time":"2020-03-25T05:19:36Z","timestamp":1585113576000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0306437976900107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976,1]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1976,1]]}},"alternative-id":["0306437976900107"],"URL":"https:\/\/doi.org\/10.1016\/0306-4379(76)90010-7","relation":{},"ISSN":["0306-4379"],"issn-type":[{"value":"0306-4379","type":"print"}],"subject":[],"published":{"date-parts":[[1976,1]]}}}