{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:18:45Z","timestamp":1781259525565,"version":"3.54.1"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,2,1]],"date-time":"1999-02-01T00:00:00Z","timestamp":917827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5280,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,2]]},"DOI":"10.1016\/s0304-3975(98)00172-8","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T19:40:02Z","timestamp":1049744402000},"page":"337-344","source":"Crossref","is-referenced-by-count":39,"title":["Fusion trees can be implemented with AC0 instructions only"],"prefix":"10.1016","volume":"215","author":[{"given":"Arne","family":"Andersson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peter Bro","family":"Miltersen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mikkel","family":"Thorup","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00172-8_BIB1","first-page":"217","article-title":"Hash functions for priority queues","volume":"63","author":"Ajtai","year":"1984","journal-title":"Inform. Comput."},{"issue":"3","key":"10.1016\/S0304-3975(98)00172-8_BIB2","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/BF00288683","article-title":"Organization and maintenance of large ordered indexes","volume":"1","author":"Bayer","year":"1972","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(98)00172-8_BIB3","series-title":"Proc. 1st Workshop on Algorithms and Data Structures (WADS)","first-page":"39","article-title":"Optimal algorithms for list indexing and subset rank","volume":"vol. 382","author":"Dietz","year":"1989"},{"key":"10.1016\/S0304-3975(98)00172-8_BIB4","series-title":"Proc. 21th ACM Symp. on Theory of Computing (STOC)","first-page":"254","article-title":"The cell probe complexity of dynamic data structures","author":"Fredman","year":"1989"},{"key":"10.1016\/S0304-3975(98)00172-8_BIB5","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1016\/0022-0000(93)90040-4","article-title":"Surpassing the information theoretic bound with fusion trees","volume":"47","author":"Fredman","year":"1993","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00172-8_BIB6","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/S0022-0000(05)80064-9","article-title":"Trans-dichotomous algorithms for minimum spanning trees and shortest paths","volume":"48","author":"Fredman","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00172-8_BIB7","series-title":"Proc. Internat. Symp. on Logic and Algorithmic","first-page":"331","article-title":"Decision trees and random access machines","author":"Paul","year":"1980"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001728?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598001728?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:27:18Z","timestamp":1556522838000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598001728"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,2]]},"references-count":7,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,2]]}},"alternative-id":["S0304397598001728"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00172-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,2]]}}}