{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,27]],"date-time":"2025-06-27T19:24:29Z","timestamp":1751052269791},"reference-count":28,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3978,"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":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00415-7","type":"journal-article","created":{"date-parts":[[2002,10,18]],"date-time":"2002-10-18T15:19:50Z","timestamp":1034954390000},"page":"1009-1026","source":"Crossref","is-referenced-by-count":8,"title":["Some results on tries with adaptive branching"],"prefix":"10.1016","volume":"289","author":[{"given":"Yuriy A.","family":"Reznik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00415-7_BIB1","series-title":"Handbook of Mathematical Functions","author":"Abramowitz","year":"1972"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0020-0190(93)90068-K","article-title":"Improved behaviour of tries by adaptive branching","volume":"46","author":"Andersson","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00415-7_BIB3","series-title":"Elements of Information Theory","author":"Cover","year":"1991"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF02124750","article-title":"On the Lambert W function","volume":"5","author":"Corless","year":"1996","journal-title":"Adv. Comput. Math."},{"key":"10.1016\/S0304-3975(01)00415-7_BIB5","first-page":"367","article-title":"A note on the average depths in tries","volume":"28","author":"Devroye","year":"1982","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10.1016\/S0304-3975(01)00415-7_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0020-0190(78)90028-5","article-title":"Sorting by distributive partitioning","volume":"7","author":"Dobosiewitz","year":"1978","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/S0304-3975(01)00415-7_BIB7","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0020-0190(79)90014-0","article-title":"The practical significance of DP sort revisited","volume":"8","author":"Dobosiewitz","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00415-7_BIB8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(81)90002-X","article-title":"Searching and sorting real numbers","volume":"2","author":"Ehrlich","year":"1981","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB9","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\/S0304-3975(01)00415-7_BIB10","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\/S0304-3975(01)00415-7_BIB11","doi-asserted-by":"crossref","unstructured":"P. Jacquet, M. R\u00e9gnier, Trie Partitioning Process: Limiting Distributions, Lecture Notes in Computer Science, Vol. 214, Springer, New York, 1986, pp. 196\u2013210.","DOI":"10.1007\/BFb0022669"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB12","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1109\/18.133271","article-title":"Analysis of digital trees with Markovian dependency","volume":"37","author":"Jacquet","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB13","doi-asserted-by":"crossref","unstructured":"P. Kirschenhofer, H. Prodinger, Some Further Results on Digital Search Trees, Lecture Notes in Computer Science, Vol. 229, Springer, New York, 1986, pp. 177\u2013185.","DOI":"10.1007\/3-540-16761-7_67"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB14","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB15","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB16","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1109\/TIT.1981.1056331","article-title":"The performance of universal encoding","volume":"27","author":"Krichevsky","year":"1981","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB17","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1051\/ita\/1983170403651","article-title":"The Brownian motion","volume":"17","author":"Louchard","year":"1983","journal-title":"RAIRO Theoret. Inform."},{"key":"10.1016\/S0304-3975(01)00415-7_BIB18","first-page":"259","article-title":"Digital search trees revisited","volume":"36","author":"Louchard","year":"1995","journal-title":"Cahiers du CERO"},{"issue":"9\/10","key":"10.1016\/S0304-3975(01)00415-7_BIB19","doi-asserted-by":"crossref","first-page":"735","DOI":"10.1007\/s002360050173","article-title":"Analytic variations on bucket selection and sorting","volume":"36","author":"Mahmoud","year":"2000","journal-title":"Acta Inform."},{"key":"10.1016\/S0304-3975(01)00415-7_BIB20","unstructured":"S. Nilsson, Radix sorting and searching, Ph.D. Thesis, Department of Computer Science, Lund University, 1996."},{"key":"10.1016\/S0304-3975(01)00415-7_BIB21","unstructured":"S. Nilsson, M. Tikkanen, Implementing a Dynamic Compressed Trie, Proc. Second Workshop on Algorithm Engineering (WAE\u201998), Saarbruecken, Germany, 1998, pp. 25\u201336."},{"key":"10.1016\/S0304-3975(01)00415-7_BIB22","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1214\/aop\/1176993000","article-title":"Asymptotic growth of a class of random trees","volume":"18","author":"Pittel","year":"1985","journal-title":"Ann. Probab."},{"key":"10.1016\/S0304-3975(01)00415-7_BIB23","doi-asserted-by":"crossref","first-page":"139","DOI":"10.2307\/1427240","article-title":"Paths in a random digital tree","volume":"18","author":"Pittel","year":"1986","journal-title":"Adv. Appl. Probab."},{"key":"10.1016\/S0304-3975(01)00415-7_BIB24","doi-asserted-by":"crossref","first-page":"526","DOI":"10.1109\/TIT.1986.1057210","article-title":"Complexity of strings in the class of Markov sources","volume":"32","author":"Rissanen","year":"1986","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB25","series-title":"An Introduction to the Analysis of Algorithms","author":"Sedgewick","year":"1996"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB26","series-title":"Average Case Analysis of Algorithms on Sequences","author":"Szpankowski","year":"2001"},{"key":"10.1016\/S0304-3975(01)00415-7_BIB27","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0196-6774(88)90039-9","article-title":"Some results on V-ary asymmetric tries","volume":"9","author":"Szpankowski","year":"1988","journal-title":"J. Algorithms"},{"issue":"3","key":"10.1016\/S0304-3975(01)00415-7_BIB28","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0020-0190(83)90064-9","article-title":"Analysis of N-trees","volume":"16","author":"Tamminen","year":"1983","journal-title":"Inform. Process. Lett."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004157?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501004157?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T01:08:29Z","timestamp":1578532109000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501004157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501004157"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00415-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}