{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:08:07Z","timestamp":1760202487023},"reference-count":17,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[1993,7,1]],"date-time":"1993-07-01T00:00:00Z","timestamp":741484800000},"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":[[1993,7]]},"DOI":"10.1016\/0020-0190(93)90068-k","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T14:05:40Z","timestamp":1034085940000},"page":"295-300","source":"Crossref","is-referenced-by-count":53,"title":["Improved behaviour of tries by adaptive branching"],"prefix":"10.1016","volume":"46","author":[{"given":"Arne","family":"Andersson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Nilsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90068-K_BIB1","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","article-title":"Universal classes of hash functions","volume":"18","author":"Cater","year":"1979","journal-title":"J. Comput. System Sci."},{"issue":"5","key":"10.1016\/0020-0190(93)90068-K_BIB2","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1214\/aop\/1176994313","article-title":"Laws of the iterated logarithm for order statistics of uniform spacings","volume":"9","author":"Devroye","year":"1981","journal-title":"Ann. Probab."},{"key":"10.1016\/0020-0190(93)90068-K_BIB3","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02279819","article-title":"A note on the average depth of tries","volume":"28","author":"Devroye","year":"1982","journal-title":"Computing"},{"key":"10.1016\/0020-0190(93)90068-K_BIB4","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF00264279","article-title":"On the performance evaluation of extendible hashing and trie searching","volume":"20","author":"Flajolet","year":"1983","journal-title":"Acta Inform."},{"key":"10.1016\/0020-0190(93)90068-K_BIB5","doi-asserted-by":"crossref","first-page":"748","DOI":"10.1137\/0215054","article-title":"Digital search trees revisited","volume":"15","author":"Flajolet","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0020-0190(93)90068-K_BIB6","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1145\/367390.367400","article-title":"Trie memory","volume":"3","author":"Fredkin","year":"1960","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90068-K_BIB7","series-title":"Handbook of Algorithms and Data Structures","author":"Gonnet","year":"1991"},{"key":"10.1016\/0020-0190(93)90068-K_BIB8","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","article-title":"A guided tour of Chernoff bounds","volume":"33","author":"Hagerup","year":"1990","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90068-K_BIB9","series-title":"Proc. 13th ICALP","first-page":"177","article-title":"Some further results on digital search trees","volume":"26","author":"Kirschenhofer","year":"1986"},{"key":"10.1016\/0020-0190(93)90068-K_BIB10","first-page":"1","article-title":"On the balance property of patricia tries: External path lenght viewpoint","volume":"68","author":"Kirschenhofer","year":"1989"},{"key":"10.1016\/0020-0190(93)90068-K_BIB11","series-title":"The art of Computer Programming, Volume 3: Sorting and Searching","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(93)90068-K_BIB12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2307\/1427240","article-title":"Paths in a random digital tree: limiting distributions","volume":"18","author":"Pittel","year":"1986","journal-title":"Adv. in Appl. Probab."},{"key":"10.1016\/0020-0190(93)90068-K_BIB13","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF00533604","article-title":"Entropy and maximal spacings for random partitions","volume":"41","author":"Slud","year":"1978","journal-title":"Z. Wahrsch. Verw. Gebiete"},{"issue":"11","key":"10.1016\/0020-0190(93)90068-K_BIB14","doi-asserted-by":"crossref","DOI":"10.1145\/359168.359175","article-title":"Storing a sparse table","volume":"22","author":"Tarjan","year":"1979","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(93)90068-K_BIB15","series-title":"Choice and Chance","author":"Whitworth","year":"1897"},{"key":"10.1016\/0020-0190(93)90068-K_BIB16","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 \u03b8(n)","volume":"17","author":"Willard","year":"1983","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90068-K_BIB17","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":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390068K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390068K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T14:23:33Z","timestamp":1554906213000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390068K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":17,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["002001909390068K"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90068-k","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}