{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T08:40:10Z","timestamp":1734943210706,"version":"3.32.0"},"reference-count":26,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,9,1]],"date-time":"1982-09-01T00:00:00Z","timestamp":399686400000},"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":["Journal of Algorithms"],"published-print":{"date-parts":[[1982,9]]},"DOI":"10.1016\/0196-6774(82)90025-6","type":"journal-article","created":{"date-parts":[[2005,2,10]],"date-time":"2005-02-10T08:44:36Z","timestamp":1108025076000},"page":"276-287","source":"Crossref","is-referenced-by-count":1,"title":["Fixed-bucket binary storage trees"],"prefix":"10.1016","volume":"3","author":[{"given":"Gary D","family":"Knott","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0196-6774(82)90025-6_BIB1_1","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1093\/comjnl\/3.3.174","volume":"3","author":"Berners-Lee","year":"1960","journal-title":"Comput. J."},{"key":"10.1016\/0196-6774(82)90025-6_BIB1_2","first-page":"184","volume":"3","author":"Berners-Lee","year":"1960","journal-title":"Comput. J."},{"key":"10.1016\/0196-6774(82)90025-6_BIB2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/S0019-9958(60)90901-3","article-title":"On the efficiency of a new method of dictionary construction","volume":"3","author":"Booth","year":"1960","journal-title":"Inform. Contr."},{"key":"10.1016\/0196-6774(82)90025-6_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1093\/comjnl\/2.1.1","article-title":"Techniques for the recording of and reference to data in a computer","volume":"2","author":"Douglas","year":"1959","journal-title":"Comput. J."},{"key":"10.1016\/0196-6774(82)90025-6_BIB4","first-page":"13","article-title":"Some combinatorial properties of certain trees","volume":"9","author":"Hibbard","year":"1962","journal-title":"Commun. ACM"},{"key":"10.1016\/0196-6774(82)90025-6_BIB5","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1093\/comjnl\/3.2.84","article-title":"Trees, forests and rearranging","volume":"3","author":"Windley","year":"1960","journal-title":"Comput. J."},{"key":"10.1016\/0196-6774(82)90025-6_BIB6","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/362848.362856","article-title":"Randomized binary search technique","volume":"12","author":"Arora","year":"1969","journal-title":"Commun. ACM"},{"key":"10.1016\/0196-6774(82)90025-6_BIB7","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0019-9958(58)80001-7","article-title":"Sorting, trees, and measures of order","volume":"1","author":"Burge","year":"1958","journal-title":"Inform. Contr."},{"key":"10.1016\/0196-6774(82)90025-6_BIB8","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1145\/363958.363987","article-title":"Randomized binary searching with tree structures","volume":"7","author":"Clampett","year":"1964","journal-title":"Commun. ACM"},{"article-title":"Deletion in Binary Storage Trees","year":"1975","author":"Knott","key":"10.1016\/0196-6774(82)90025-6_BIB9"},{"year":"1973","author":"Knuth","key":"10.1016\/0196-6774(82)90025-6_BIB10"},{"key":"10.1016\/0196-6774(82)90025-6_BIB11","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1093\/comjnl\/7.4.299","article-title":"More combinatorial properties of certain trees","volume":"7","author":"Lynch","year":"1965","journal-title":"Comput. J."},{"key":"10.1016\/0196-6774(82)90025-6_BIB12","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF00289612","article-title":"A principle of independence for binary tree searching","volume":"4","author":"Guibas","year":"1975","journal-title":"Acta Inform."},{"key":"10.1016\/0196-6774(82)90025-6_BIB13","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/362686.362693","article-title":"File structures using hashing functions","volume":"13","author":"Coffman","year":"1970","journal-title":"Commun. ACM"},{"key":"10.1016\/0196-6774(82)90025-6_BIB14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1137\/0205003","article-title":"Partial-match retrieval algorithms","volume":"5","author":"Rivest","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0196-6774(82)90025-6_BIB15_1","series-title":"ACM SIGACT Conf. Record","first-page":"211","article-title":"Associative retrieval trie hash coding","author":"Burkhard","year":"1976"},{"key":"10.1016\/0196-6774(82)90025-6_BIB15_2","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/S0022-0000(77)80031-7","volume":"15","author":"Burkhard","year":"1977","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/0196-6774(82)90025-6_BIB16","doi-asserted-by":"crossref","DOI":"10.2172\/1453938","article-title":"A Survey of Techniques for Fixed Radius Near Neighbor Searching","author":"Bentley","year":"1975"},{"key":"10.1016\/0196-6774(82)90025-6_BIB17_1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/355744.355745","article-title":"An algorithm for finding best matches in logarithmic time","volume":"3","author":"Friedman","year":"1977","journal-title":"Trans. Math. Softw."},{"year":"1975","author":"Friedman","key":"10.1016\/0196-6774(82)90025-6_BIB17_2"},{"key":"10.1016\/0196-6774(82)90025-6_BIB18","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1145\/361002.361007","article-title":"Multidimensional binary search trees used for associative searching","volume":"18","author":"Bentley","year":"1975","journal-title":"Commun. ACM"},{"key":"10.1016\/0196-6774(82)90025-6_BIB19_1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1109\/TSE.1977.231160","article-title":"Deletions that preserve randomness","author":"Knuth","year":"1977","journal-title":"IEEE Trans. Softw. Eng."},{"year":"1977","author":"Knuth","key":"10.1016\/0196-6774(82)90025-6_BIB19_2"},{"key":"10.1016\/0196-6774(82)90025-6_BIB20","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01931680","article-title":"Analysis of an algorithm for priority queue administration","volume":"15","author":"Jonassen","year":"1975","journal-title":"BIT"},{"year":"1969","author":"Knuth","key":"10.1016\/0196-6774(82)90025-6_BIB21"},{"key":"10.1016\/0196-6774(82)90025-6_BIB22","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0012-365X(73)90114-3","article-title":"A note on growing binary trees","volume":"4","author":"Konheim","year":"1973","journal-title":"Discrete Math."}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900256?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0196677482900256?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T08:08:49Z","timestamp":1734941329000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0196677482900256"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,9]]},"references-count":26,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,9]]}},"alternative-id":["0196677482900256"],"URL":"https:\/\/doi.org\/10.1016\/0196-6774(82)90025-6","relation":{},"ISSN":["0196-6774"],"issn-type":[{"type":"print","value":"0196-6774"}],"subject":[],"published":{"date-parts":[[1982,9]]}}}