{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,15]],"date-time":"2023-10-15T14:13:33Z","timestamp":1697379213836},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"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":8690,"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":[[1989,10]]},"DOI":"10.1016\/0304-3975(89)90115-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"1-17","source":"Crossref","is-referenced-by-count":21,"title":["On the balance property of Patricia tries: External path length viewpoint"],"prefix":"10.1016","volume":"68","author":[{"given":"Peter","family":"Kirschenhofer","sequence":"first","affiliation":[]},{"given":"Helmut","family":"Prodinger","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Szpankowski","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90115-1_BIB1","series-title":"Data Structures and Algorithms","author":"Aho","year":"1983"},{"key":"10.1016\/0304-3975(89)90115-1_BIB2","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/320083.320092","article-title":"Extendible hashing: A fast access method for dynamic files","volume":"4","author":"Fagin","year":"1979","journal-title":"ACM TODS"},{"key":"10.1016\/0304-3975(89)90115-1_BIB3","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(89)90115-1_BIB4","series-title":"Handbook of Algorithms and Data Structures","author":"Gonnet","year":"1986"},{"key":"10.1016\/0304-3975(89)90115-1_BIB5","series-title":"Applied and Computational Complex Analysis","author":"Henrici","year":"1977"},{"key":"10.1016\/0304-3975(89)90115-1_BIB6","series-title":"Automata, Languages and Machines (ICALP'86)","first-page":"177","article-title":"Some further results on digital search trees","volume":"226","author":"Kirschenhofer","year":"1986"},{"key":"10.1016\/0304-3975(89)90115-1_BIB7","author":"Kirschenhofer","year":"1987","journal-title":"On some applications of formulae of Ramanujan in the analysis of algorithms"},{"key":"10.1016\/0304-3975(89)90115-1_BIB8","unstructured":"P. Kirschenhofer, H. Prodinger and W. Szpankowski, On the variance of the external path length in a symmetric digital trie, Discrete Appl. Math., Special Issue on \u201cCombinatorics and Complexity\u201d, to be published."},{"key":"10.1016\/0304-3975(89)90115-1_BIB9","series-title":"The Art of Computer Programming, Sorting and Searching","author":"Knuth","year":"1973"},{"issue":"2","key":"10.1016\/0304-3975(89)90115-1_BIB10","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 and blocked channel access","volume":"31","author":"Mathys","year":"1985","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/0304-3975(89)90115-1_BIB11","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"},{"key":"10.1016\/0304-3975(89)90115-1_BIB12","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/0020-0190(88)90137-8","article-title":"The evaluation of an alternative sum with applications to the analysis of some data structures","volume":"28","author":"Szpankowski","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0304-3975(89)90115-1_BIB13","article-title":"Patricia tries again revisited","author":"Szpankowski","year":"1986","journal-title":"Purdue University, Tech. Rept. CSD-TR 625"},{"key":"10.1016\/0304-3975(89)90115-1_BIB14","author":"Paige","year":"1986","journal-title":"Three efficient algorithms based on partition refinement"},{"key":"10.1016\/0304-3975(89)90115-1_BIB15","series-title":"Combinatorial Identities","author":"Riordan","year":"1968"},{"key":"10.1016\/0304-3975(89)90115-1_BIB16","series-title":"Probability Theory","author":"Renyi","year":"1970"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901151?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589901151?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:42Z","timestamp":1555127802000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589901151"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0304397589901151"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90115-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}