{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:16Z","timestamp":1725549676413},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_7","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T08:31:47Z","timestamp":1268382707000},"page":"61-72","source":"Crossref","is-referenced-by-count":0,"title":["Analysis of a Class of Tries with Adaptive Multi-digit\u00a0Branching"],"prefix":"10.1007","author":[{"given":"Yuriy A.","family":"Reznik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(93)90068-K","volume":"46","author":"A. Andersson","year":"1993","unstructured":"Andersson, A., Nilsson, S.: Improved Behaviour of Tries by Adaptive Branching. Information Processing Letters\u00a046, 295\u2013300 (1993)","journal-title":"Information Processing Letters"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Andersson, A., Nilsson, S.: Faster Searching in Tries and Quadtries \u2013 An Analysis of Level Compression. In: Proc. 2nd Annual European Symp. on Algorithms, pp. 82\u201393 (1994)","DOI":"10.1007\/BFb0049399"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"de la Briandeis, R.E.: File searching using variable length keys. In: Proc. Western Joint Computer Conference., vol.\u00a015. AFIPS Press (1959)","DOI":"10.1145\/1457838.1457895"},{"key":"7_CR4","unstructured":"Clement, J., Flajolet, P., Vall\u00e9e, B.: The analysis of hybrid trie structures. In: Proc. Annual ACM-SIAM Symp. on Discrete Algorithms., San Francisco, CA, pp. 531\u2013539 (1998)"},{"issue":"1\/2","key":"7_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02679623","volume":"29","author":"J. Clement","year":"2001","unstructured":"Clement, J., Flajolet, P., Vall\u00e9e, B.: Dynamic sources in information theory: A general analysis of trie structures. Algorithmica\u00a029(1\/2), 307\u2013369 (2001)","journal-title":"Algorithmica"},{"issue":"7","key":"7_CR6","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/362686.362693","volume":"13","author":"E.G. Coffman Jr.","year":"1970","unstructured":"Coffman Jr., E.G., Eve, J.: File Structures Using Hashing Functions. Comm. ACM\u00a013(7), 427\u2013436 (1970)","journal-title":"Comm. ACM"},{"key":"7_CR7","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory.","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.M.: Elements of Information Theory.. John Wiley & Sons, New York (1991)"},{"key":"7_CR8","first-page":"367","volume":"28","author":"L. Devroye","year":"1982","unstructured":"Devroye, L.: A Note on the Average Depths in Tries. SIAM J. Computing\u00a028, 367\u2013371 (1982)","journal-title":"SIAM J. Computing"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1002\/rsa.3240030209","volume":"3","author":"L. Devroye","year":"1992","unstructured":"Devroye, L.: A Note on the Probabilistic Analysis of PATRICIA Tries. Rand. Structures & Algorithms\u00a03, 203\u2013214 (1992)","journal-title":"Rand. Structures & Algorithms"},{"issue":"3-4","key":"7_CR10","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1002\/rsa.10006","volume":"19","author":"L. Devroye","year":"2001","unstructured":"Devroye, L.: Analysis of Random LC Tries. Rand. Structures & Algorithms\u00a019(3-4), 359\u2013375 (2001)","journal-title":"Rand. Structures & Algorithms"},{"key":"7_CR11","unstructured":"Devroye, L., Szpankowski, W.: Probabilistic Behavior of Asymmetric LC-Tries, Rand. Structures & Algorithms \u2013 submitted"},{"issue":"3","key":"7_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/320083.320092","volume":"4","author":"R. Fagin","year":"1979","unstructured":"Fagin, R., Nievergelt, J., Pipinger, N., Strong, H.R.: Extendible Hashing \u2013 A Fast Access Method for Dynamic Files. ACM Trans. Database Syst.\u00a04(3), 315\u2013344 (1979)","journal-title":"ACM Trans. Database Syst."},{"key":"7_CR13","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1137\/0215054","volume":"15","author":"P. Flajolet","year":"1986","unstructured":"Flajolet, P., Sedgewick, R.: Digital Search Trees Revisited. SIAM J. Computing\u00a015, 748\u2013767 (1986)","journal-title":"SIAM J. Computing"},{"key":"7_CR14","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1145\/367390.367400","volume":"3","author":"E. Fredkin","year":"1960","unstructured":"Fredkin, E.: Trie Memory. Comm. ACM\u00a03, 490\u2013500 (1960)","journal-title":"Comm. ACM"},{"key":"7_CR15","volume-title":"The Art of Computer Programming. Sorting and Searching","author":"D.E. Knuth","year":"1973","unstructured":"Knuth, D.E.: The Art of Computer Programming. Sorting and Searching, vol.\u00a03. Addison-Wesley, Reading (1973)"},{"issue":"4","key":"7_CR16","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1145\/321479.321481","volume":"15","author":"D.A. Morrison","year":"1968","unstructured":"Morrison, D.A.: PATRICIA \u2013 Practical Algorithm To Retrieve Information Coded in Alphanumeric. J. ACM\u00a015(4), 514\u2013534 (1968)","journal-title":"J. ACM"},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Nilsson, S., Karlsson, G.: Fast IP look-up for Internet routers. In: Proc. IFIP 4th International Conference on Broadband Communication, pp. 11\u201322 (1998)","DOI":"10.1007\/978-0-387-35378-4_2"},{"issue":"6","key":"7_CR18","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1109\/49.772439","volume":"17","author":"S. Nilsson","year":"1999","unstructured":"Nilsson, S., Karlsson, G.: IP-address look-up using LC-tries. IEEE J. Selected Areas in Communication\u00a017(6), 1083\u20131092 (1999)","journal-title":"IEEE J. Selected Areas in Communication"},{"key":"7_CR19","unstructured":"Nilsson, S., Tikkanen, M.: Implementing a Dynamic Compressed Trie. In: Proc. 2nd Workshop on Algorithm Engineering, Saarbruecken, Germany, pp. 25\u201336 (1998)"},{"issue":"1","key":"7_CR20","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(1), 19\u201333 (2002)","journal-title":"Algorithmica"},{"key":"7_CR21","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1214\/aop\/1176993000","volume":"18","author":"B. Pittel","year":"1985","unstructured":"Pittel, B.: Asymptotic Growth of a Class of Random Trees. Annals of Probability\u00a018, 414\u2013427 (1985)","journal-title":"Annals of Probability"},{"issue":"2","key":"7_CR22","doi-asserted-by":"publisher","first-page":"1009","DOI":"10.1016\/S0304-3975(01)00415-7","volume":"289","author":"Y.A. Reznik","year":"2002","unstructured":"Reznik, Y.A.: Some Results on Tries with Adaptive Branching. Theoretical Computer Science\u00a0289(2), 1009\u20131026 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1023\/A:1023837529522","volume":"39","author":"Y.A. Reznik","year":"2003","unstructured":"Reznik, Y.A.: On Time\/Space Efficiency of Tries with Adaptive Multi-Digit Branching. Cybernetics and Systems Analysis\u00a039(1), 32\u201346 (2003)","journal-title":"Cybernetics and Systems Analysis"},{"key":"7_CR24","unstructured":"Reznik, Y.A.: On the Average Depth of Asymmetric LC-tries, Information Processing Letters \u2013 submitted"},{"key":"7_CR25","unstructured":"Reznik, Y.A.: On the Average Density and Selectivity of Nodes in Multi-Digit\u00a0Tries. In: Proc. 7th\u00a0Workshop on Algorithm Engineering and Experiments and 2nd Workshop on Analytic Algorithmics and Combinatorics (ALENEX\/ANALCO 2005). SIAM, Philadelphia (2005)"},{"issue":"5","key":"7_CR26","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1145\/366552.366600","volume":"6","author":"E.H. Sussenguth Jr.","year":"1963","unstructured":"Sussenguth Jr., E.H.: Use of Tree Structures for Processing Files. Comm. ACM\u00a06(5), 272\u2013279 (1963)","journal-title":"Comm. ACM"},{"key":"7_CR27","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. J. Algorithms\u00a09, 224\u2013244 (1988)","journal-title":"J. Algorithms"},{"key":"7_CR28","doi-asserted-by":"crossref","DOI":"10.1002\/9781118032770","volume-title":"Average Case Analysis of Algorithms on Sequences","author":"W. Szpankowski","year":"2001","unstructured":"Szpankowski, W.: Average Case Analysis of Algorithms on Sequences. John\u00a0Wiley & Sons, New York (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:35:07Z","timestamp":1558272907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/11534273_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}