{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T10:09:09Z","timestamp":1775470149285,"version":"3.50.1"},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1993,12,1]],"date-time":"1993-12-01T00:00:00Z","timestamp":754704000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7168,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR-8504245"],"award-info":[{"award-number":["CCR-8504245"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCR90-60509"],"award-info":[{"award-number":["CCR90-60509"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1993,12]]},"DOI":"10.1016\/0022-0000(93)90040-4","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"424-436","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":225,"title":["Surpassing the information theoretic bound with fusion trees"],"prefix":"10.1016","volume":"47","author":[{"given":"Michael L.","family":"Fredman","sequence":"first","affiliation":[]},{"given":"Dan E.","family":"Willard","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(93)90040-4_BIB1","first-page":"217","article-title":"Hash functions for priority queues","volume":"63","author":"Ajtai","year":"1984","journal-title":"Inform. and Comput."},{"key":"10.1016\/0022-0000(93)90040-4_BIB2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered Indices","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/0022-0000(93)90040-4_BIB3","series-title":"Proceedings, 29th IEEE Symposium on Foundations of Computer Science","first-page":"524","article-title":"Dynamic perfect hashing: Upper and lower bounds","author":"Dietzfelbinger","year":"1988"},{"key":"10.1016\/0022-0000(93)90040-4_BIB4_1","series-title":"Symposium uber Logik and Algolrithmik","article-title":"Decision trees and random access machines","author":"Paul","year":"1980"},{"key":"10.1016\/0022-0000(93)90040-4_BIB4_2","first-page":"85","article-title":"Sorting and Searching","author":"Mehlhorn","year":"1984"},{"key":"10.1016\/0022-0000(93)90040-4_BIB5","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/BF01683268","article-title":"Design and implementation of an efficient priority queue","volume":"10","author":"Van Emde Bows","year":"1977","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0022-0000(93)90040-4_BIB6","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0020-0190(83)90075-3","article-title":"Log-logarithmic worst case range queries are possible in space O(N)","author":"Willard","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(93)90040-4_BIB7","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/0022-0000(84)90020-5","article-title":"New trie data structures which support very fast search operations","volume":"28","author":"Willard","year":"1984","journal-title":"J. Comput. System Sci."}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000093900404?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000093900404?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,5]],"date-time":"2025-09-05T18:11:07Z","timestamp":1757095867000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000093900404"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,12]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1993,12]]}},"alternative-id":["0022000093900404"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(93)90040-4","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1993,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Surpassing the information theoretic bound with fusion trees","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0022-0000(93)90040-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1993 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}