{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T08:15:16Z","timestamp":1649146516634},"reference-count":21,"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)90070-p","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T14:05:40Z","timestamp":1034085940000},"page":"309-311","source":"Crossref","is-referenced-by-count":1,"title":["A note on binomial recurrences arising in the analysis of algorithms"],"prefix":"10.1016","volume":"46","author":[{"given":"Helmut","family":"Prodinger","sequence":"first","affiliation":[]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(93)90070-P_BIB1","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","article-title":"Tree algorithms for packet broadcast channels","volume":"25","author":"Capentanakis","year":"1979","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(93)90070-P_BIB2","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)90070-P_BIB3","series-title":"Proc. ICALP 92","first-page":"186","article-title":"Analytic analysis of algorithms","volume":"623","author":"Flajolet","year":"1992"},{"key":"10.1016\/0020-0190(93)90070-P_BIB4","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1002\/rsa.3240030309","article-title":"Generalized digital trees and their difference-differential equations","volume":"3","author":"Flajolet","year":"1992","journal-title":"Random Structures & Algorithms"},{"key":"10.1016\/0020-0190(93)90070-P_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)90070-P_BIB6","volume":"Vol. 2","author":"Henrici","year":"1977"},{"key":"10.1016\/0020-0190(93)90070-P_BIB7","first-page":"196","article-title":"Limiting distributions for trie parameters","volume":"214","author":"Jacquet","year":"1986"},{"key":"10.1016\/0020-0190(93)90070-P_BIB8","doi-asserted-by":"crossref","first-page":"1470","DOI":"10.1109\/18.133271","article-title":"Analysis of digital tries with Markovian dependency","volume":"37","author":"Jacquet","year":"1991","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(93)90070-P_BIB9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0304-3975(88)90023-0","article-title":"Further results on digital search trees","volume":"58","author":"Kirschenhofer","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0020-0190(93)90070-P_BIB10","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 tries","volume":"25","author":"Kirschenhofer","year":"1989","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/0020-0190(93)90070-P_BIB11","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\/0020-0190(93)90070-P_BIB12","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\/0020-0190(93)90070-P_BIB13","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(93)90070-P_BIB14","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1109\/TIT.1985.1057013","article-title":"Q-ary collision resolution algorithms in random-access systems with free or blocked channels access","volume":"31","author":"Mathys","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0020-0190(93)90070-P_BIB15","series-title":"Evolution of Random Search Trees","author":"Mahmoud","year":"1992"},{"key":"10.1016\/0020-0190(93)90070-P_BIB16","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1051\/ita\/1992260201631","article-title":"On a tree collision resolution algorithm in presence of capture","volume":"26","author":"Schmid","year":"1992","journal-title":"RAIRO Theoret. Inform."},{"key":"10.1016\/0020-0190(93)90070-P_BIB17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1080\/15326348708807048","article-title":"On a recurrence equation arising in the analysis of conflict resolution algorithms","volume":"3","author":"Szpankowski","year":"1987","journal-title":"Stochastic Models"},{"key":"10.1016\/0020-0190(93)90070-P_BIB18","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0020-0190(88)90137-8","article-title":"The evaluation of an alternating sum with applications to the analysis of some data structures","volume":"28","author":"Szpankowski","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(93)90070-P_BIB19","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0196-6774(88)90039-9","article-title":"Some results on v-ary aymmetric tries","volume":"9","author":"Szpankowski","year":"1988","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(93)90070-P_BIB20","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1145\/96559.214080","article-title":"Patricia tries again revisited","volume":"37","author":"Szpankowski","year":"1991","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(93)90070-P_BIB21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(91)90050-C","article-title":"A characterization of digital search trees from the successful search viewpoint","volume":"85","author":"Szpankowski","year":"1991","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390070P?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909390070P?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:32Z","timestamp":1554906212000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909390070P"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,7]]},"references-count":21,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1993,7]]}},"alternative-id":["002001909390070P"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(93)90070-p","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1993,7]]}}}