{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:56:39Z","timestamp":1725796599321},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319087825"},{"type":"electronic","value":"9783319087832"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08783-2_9","type":"book-chapter","created":{"date-parts":[[2014,7,5]],"date-time":"2014-07-05T14:04:30Z","timestamp":1404569070000},"page":"94-103","source":"Crossref","is-referenced-by-count":0,"title":["On the Smoothed Heights of Trie and Patricia Index Trees"],"prefix":"10.1007","author":[{"given":"Weitian","family":"Tong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Randy","family":"Goebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1090\/S0002-9947-1952-0045327-5","volume":"72","author":"K.L. Chung","year":"1952","unstructured":"Chung, K.L., Erd\u00f6s, P.: On the application of the Borel-Cantelli lemma. Transactions of the American Mathematical Society\u00a072, 179\u2013186 (1952)","journal-title":"Transactions of the American Mathematical Society"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Comtet, L.: Advanced Combinatorics: The Art of Finite and Infinite Expansions. Springer (1974)","DOI":"10.1007\/978-94-010-2196-8"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF00264248","volume":"21","author":"L. Devroye","year":"1984","unstructured":"Devroye, L.: A probabilistic analysis of the height of tries and of the complexity of triesort. Acta Informatica\u00a021, 229\u2013237 (1984)","journal-title":"Acta Informatica"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/BF00264279","volume":"20","author":"P. Flajolet","year":"1983","unstructured":"Flajolet, P.: On the performance evaluation of extendible hashing and trie search. Acta Informatica\u00a020, 345\u2013369 (1983)","journal-title":"Acta Informatica"},{"key":"9_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BFb0012773","volume-title":"Automata, Languages, and Programming","author":"P. Flajolet","year":"1982","unstructured":"Flajolet, P., Steyaert, J.M.: A branching process arising in dynamic hashing, trie searching and polynomial factorization. In: Nielsen, M., Schmidt, E.M. (eds.) ICALP 1982. LNCS, vol.\u00a0140, pp. 239\u2013251. Springer, Heidelberg (1982)"},{"key":"9_CR6","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie memory. Communications of the ACM\u00a03, 490\u2013499 (1960)","journal-title":"Communications of the ACM"},{"key":"9_CR7","unstructured":"Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol.\u00a0III. Addison-Wesley (1973)"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1109\/TSE.1982.236022","volume":"8","author":"H. Mendelson","year":"1982","unstructured":"Mendelson, H.: Analysis of extendible hashing. IEEE Transactions on Software Engineering\u00a08, 611\u2013619 (1982)","journal-title":"IEEE Transactions on Software Engineering"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.R. Morrison","year":"1968","unstructured":"Morrison, D.R.: Patricia \u2014 practical algorithm to retrieve information coded in alphanumeric. Journal of the ACM\u00a015, 514\u2013534 (1968)","journal-title":"Journal of the ACM"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00453-001-0102-y","volume":"33","author":"S. Nilsson","year":"2002","unstructured":"Nilsson, S., Tikkanen, M.: An experimental study of compression methods for dynamic tries. Algorithmica\u00a033, 19\u201333 (2002)","journal-title":"Algorithmica"},{"key":"9_CR11","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1214\/aop\/1176993000","volume":"13","author":"B. Pittel","year":"1985","unstructured":"Pittel, B.: Asymptotical growth of a class of random trees. Annals of Probability\u00a013, 414\u2013427 (1985)","journal-title":"Annals of Probability"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"139","DOI":"10.2307\/1427240","volume":"18","author":"B. Pittel","year":"1986","unstructured":"Pittel, B.: Path in a random digital tree: limiting distributions. Advances in Applied Probability\u00a018, 139\u2013155 (1986)","journal-title":"Advances in Applied Probability"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/0020-0190(81)90033-8","volume":"13","author":"M. R\u00e9gnier","year":"1981","unstructured":"R\u00e9gnier, M.: On the average height of trees in digital searching and dynamic hashing. Information Processing Letters\u00a013, 64\u201366 (1981)","journal-title":"Information Processing Letters"},{"key":"9_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1145\/990308.990310","volume":"51","author":"D.A. Spielman","year":"2004","unstructured":"Spielman, D.A., Teng, S.-H.: Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM\u00a051, 385\u2013463 (2004)","journal-title":"Journal of the ACM"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0196-6774(88)90039-9","volume":"9","author":"W. Szpankowski","year":"1988","unstructured":"Szpankowski, W.: Some results on V-ary asymmetric tries. Journal of Algorithms\u00a09, 224\u2013244 (1988)","journal-title":"Journal of Algorithms"},{"key":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-51542-9_18","volume-title":"Algorithms and Data Structures","author":"W. Szpankowski","year":"1989","unstructured":"Szpankowski, W.: Digital data structures and order statistics. In: Dehne, F., Santoro, N., Sack, J.-R. (eds.) WADS 1989. LNCS, vol.\u00a0382, pp. 206\u2013217. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08783-2_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T06:37:40Z","timestamp":1558939060000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08783-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319087825","9783319087832"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08783-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}