{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:37:52Z","timestamp":1725496672532},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677871"},{"type":"electronic","value":"9783540449683"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44968-x_15","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T04:37:43Z","timestamp":1196311063000},"page":"148-158","source":"Crossref","is-referenced-by-count":1,"title":["Some Results on Tries with Adaptive Branching"],"prefix":"10.1007","author":[{"given":"Yuriy A.","family":"Reznik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,7,21]]},"reference":[{"key":"15_CR1","volume-title":"Handbook of Mathematical Functions","author":"M. Abramowitz","year":"1972","unstructured":"M. Abramowitz, and I. Stegun, Handbook of Mathematical Functions, Dover, NY (1972)"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/0020-0190(93)90068-K","volume":"46","author":"Andersson","year":"1993","unstructured":"Andersson, and S. Nilsson, Improved Behaviour of Tries by Adaptive Branching, Information Processing Letters, 46 (1993) 295\u2013300.","journal-title":"Information Processing Letters"},{"key":"15_CR3","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. M. Cover","year":"1991","unstructured":"T. M. Cover and J. M. Thomas, Elements of Information Theory, John Wiley & Sons, New York (1991)"},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02124750","volume":"5","author":"R. M. Corless","year":"1996","unstructured":"R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, and D. E. Knuth, On the Lambert W Function, Advances in Computational Mathematics, 5 (1996) 329\u2013359","journal-title":"Advances in Computational Mathematics"},{"key":"15_CR5","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF02279819","volume":"28","author":"L. Devroye","year":"1982","unstructured":"L. Devroye, A Note on the Average Depths in Tries, Computing, 28 (1982) 367\u2013371","journal-title":"Computing"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(78)90028-5","volume":"7","author":"W. Dobosiewitz","year":"1978","unstructured":"W. Dobosiewitz, Sorting by Distributive Partitioning, Information Processing Letters, 7,1, (1978) 1\u20136","journal-title":"Information Processing Letters"},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1016\/0020-0190(79)90014-0","volume":"8","author":"W. Dobosiewitz","year":"1979","unstructured":"W. Dobosiewitz, The Practical Significance of DP Sort Revisited, Information Processing Letters, 8,4 (1979) 170\u2013172","journal-title":"Information Processing Letters"},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0196-6774(81)90002-X","volume":"2","author":"G. Ehrlich","year":"1981","unstructured":"G. Ehrlich, Searching and Sorting Real Numbers, J. Algorithms, 2 (1981) 1\u201314","journal-title":"J. Algorithms"},{"key":"15_CR9","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1137\/0215054","volume":"15","author":"P. Flajolet","year":"1986","unstructured":"P. Flajolet and R. Sedgewick, Digital Search Trees Revisited, SIAM J. Computing, 15, (1986) 748\u2013767","journal-title":"SIAM J. Computing"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"1470","DOI":"10.1109\/18.133271","volume":"37","author":"P. Jacquet","year":"1991","unstructured":"P. Jacquet and W. Szpankowski, Analysis of Digital Trees with Markovian Dependency, IEEE Trans. Information Theory, 37 (1991) 1470\u20131475","journal-title":"IEEE Trans. Information Theory"},{"key":"15_CR11","unstructured":"D. Knuth, The Art of Computer Programming. Sorting and Searching. Vol. 3., Addison-Wesley (1973)"},{"key":"15_CR12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1051\/ita\/1983170403651","volume":"17","author":"G. Louchard","year":"1983","unstructured":"G. Louchard, The Brownian Motion: A Neglected Tool for the Complexity Analysis of Sorted Tables Manipulations, RAIRO Theoretical Informatics, 17 (1983) 365\u2013385","journal-title":"RAIRO Theoretical Informatics"},{"key":"15_CR13","first-page":"259","volume":"36","author":"G. Louchard","year":"1995","unstructured":"G. Louchard, Digital Search Trees Revisited, Cahiers du CERO, 36 (1995) 259\u201327","journal-title":"Cahiers du CERO"},{"key":"15_CR14","unstructured":"G. Louchard and W. Szpankowski, An Exercise in Asymptotic Analysis, reprint (1995)"},{"key":"15_CR15","unstructured":"S. Nilsson, Radix Sorting and Searching, Ph.D. thesis, Department of Computer Science, Lund University (1996)"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"139","DOI":"10.2307\/1427240","volume":"18","author":"Pittel","year":"1986","unstructured":"Pittel, Paths in a Random Digital Tree: Limiting Distributions. Advances in Applied Probability, 18 (1986) 139\u2013155","journal-title":"Advances in Applied Probability"},{"key":"15_CR17","volume-title":"An Introduction to the Analysis of Algorithms","author":"R. Sedgewick","year":"1996","unstructured":"R. Sedgewick, and P. Flajolet, An Introduction to the Analysis of Algorithms, Addison-Wesley, Reading, MA (1996)"},{"key":"15_CR18","unstructured":"W. Szpankowski, Techniques for the Average Case Analysis of Algorithms on Words, John Wiley & Sons, to be published"},{"key":"15_CR19","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1016\/0196-6774(88)90039-9","volume":"9","author":"W. Szpankowski","year":"1988","unstructured":"W. Szpankowski, Some results on V-ary asymmetric tries, Journal of Algorithms, 9 (1988) 224\u2013244","journal-title":"Journal of Algorithms"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0020-0190(83)90064-9","volume":"16","author":"M. Tamminen","year":"1983","unstructured":"M. Tamminen, Analysis of N-Trees, Information Processing Letters, 16,3 (1983) 131\u2013137","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44968-X_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T18:21:03Z","timestamp":1551118863000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44968-X_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677871","9783540449683"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-44968-x_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}