{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:38Z","timestamp":1759638638357},"reference-count":28,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"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":6621,"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":[[1995,6]]},"DOI":"10.1016\/0304-3975(94)00306-4","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T00:04:58Z","timestamp":1052784298000},"page":"251-275","source":"Crossref","is-referenced-by-count":10,"title":["On the variance of a class of inductive valuations of data structures for digital search"],"prefix":"10.1016","volume":"144","author":[{"given":"Werner","family":"Schachinger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00306-4_BIB1","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/362686.362693","article-title":"File structure using hashing functions","volume":"13","author":"Coffman","year":"1970","journal-title":"CACM"},{"key":"10.1016\/0304-3975(94)00306-4_BIB2","author":"Doetsch","year":"1955"},{"key":"10.1016\/0304-3975(94)00306-4_BIB3","doi-asserted-by":"crossref","first-page":"441","DOI":"10.2307\/1427308","article-title":"On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel","volume":"18","author":"Fayolle","year":"1986","journal-title":"Adv. Appl. Probab."},{"key":"10.1016\/0304-3975(94)00306-4_BIB4","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1145\/5383.5453","article-title":"Partial match retrieval of multidimensional data","volume":"33","author":"Flajolet","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(94)00306-4_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\/0304-3975(94)00306-4_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":"CACM"},{"key":"10.1016\/0304-3975(94)00306-4_BIB7","article-title":"Beitr\u00e4ge zur Analyse verallgemeinerter Suchb\u00e4ume","author":"Hubalek","year":"1993","journal-title":"Dissertation Technische Universit\u00e4t Wien"},{"key":"10.1016\/0304-3975(94)00306-4_BIB8","first-page":"196","article-title":"Trie partitioning process: limiting distributions","volume":"Vol. 214","author":"Jacquet","year":"1986"},{"key":"10.1016\/0304-3975(94)00306-4_BIB9","series-title":"Performance '87","first-page":"209","article-title":"Normal limiting distribution of the size of tries","author":"Jacquet","year":"1987"},{"key":"10.1016\/0304-3975(94)00306-4_BIB10","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(94)00298-W","article-title":"Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees","author":"Jacquet","year":"1993"},{"key":"10.1016\/0304-3975(94)00306-4_BIB11","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1112\/S0025579300006409","article-title":"On some applications of formulae of Ramanujan in the analysis of algorithms","volume":"38","author":"Kirschenhofer","year":"1991","journal-title":"Mathematika"},{"key":"10.1016\/0304-3975(94)00306-4_BIB12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1002\/rsa.3240050112","article-title":"Multidimensional digital searching \u2014 alternative data structures","volume":"5","author":"Kirschenhofer","year":"1994","journal-title":"Random Struct. Algorithms"},{"key":"10.1016\/0304-3975(94)00306-4_BIB13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90115-1","article-title":"On the balance property of Patricia tries: external path length viewpoint","volume":"68","author":"Kirschenhofer","year":"1989","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00306-4_BIB14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0166-218X(89)90050-4","article-title":"On the variance of the external path length in a symmetric digital trie","volume":"25","author":"Kirschenhofer","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0304-3975(94)00306-4_BIB15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1142\/S0129054193000055","article-title":"Multidimensional digital searching and some new parameters in tries","volume":"4","author":"Kirschenhofer","year":"1993","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/0304-3975(94)00306-4_BIB16","first-page":"493","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0304-3975(94)00306-4_BIB17","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/BF01931695","article-title":"Dynamic hashing","volume":"18","author":"Larson","year":"1978","journal-title":"BIT"},{"key":"10.1016\/0304-3975(94)00306-4_BIB18","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1051\/ita\/1987210404791","article-title":"Exact and asymptotic distributions in digital and binary search trees","volume":"21","author":"Louchard","year":"1987","journal-title":"Theoret. Inform."},{"key":"10.1016\/0304-3975(94)00306-4_BIB19","series-title":"Proc. CAAP '93","first-page":"717","article-title":"Trie size in a dynamic list structure","volume":"Vol. 668","author":"Louchard","year":"1993"},{"key":"10.1016\/0304-3975(94)00306-4_BIB20","article-title":"Average profile and limiting distribution for a phase size in the Lempel-Ziv parsing algorithm","author":"Louchard","year":"1993","journal-title":"Tech. Report INRIA-TR 1886"},{"key":"10.1016\/0304-3975(94)00306-4_BIB21","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","article-title":"On the complexity of finite sequences","volume":"22","author":"Lempel","year":"1976","journal-title":"IEEE Inform. Theory"},{"key":"10.1016\/0304-3975(94)00306-4_BIB22","first-page":"15","article-title":"Bernstein polynomials","volume":"8","author":"Lorentz","year":"1953","journal-title":"Math. Expositions"},{"key":"10.1016\/0304-3975(94)00306-4_BIB23","series-title":"Evolution of Random Search Trees","author":"Mahmoud","year":"1992"},{"key":"10.1016\/0304-3975(94)00306-4_BIB24","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1145\/321479.321481","article-title":"Patricia \u2014 practical algorithm to retrieve information coded in alphanumeric","volume":"15","author":"Morrison","year":"1968","journal-title":"JACM"},{"key":"10.1016\/0304-3975(94)00306-4_BIB25","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1109\/18.42197","article-title":"New results on the size of tries","volume":"IT-35","author":"R\u00e9gnier","year":"1989","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(94)00306-4_BIB26","doi-asserted-by":"crossref","unstructured":"R.L. Rivest, Partial-match retrieval algorithms, SIAM J. Comput. 5, 19\u201350.","DOI":"10.1137\/0205003"},{"key":"10.1016\/0304-3975(94)00306-4_BIB27","series-title":"Automata, Languages and Programming","first-page":"223","article-title":"The average CRI-length of a tree collision resolution algorithm in presence of multiplicity- dependent capture effects","author":"Schmid","year":"1992"},{"key":"10.1016\/0304-3975(94)00306-4_BIB28","first-page":"259","article-title":"Free syncronous packet access in a broadcast channel with feedback","volume":"14","author":"Tsybakov","year":"1978","journal-title":"Problems Inform. Transmission"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594003064?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594003064?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T08:28:01Z","timestamp":1555403281000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594003064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["0304397594003064"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00306-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}