A note on the asymptotic behavior of the heights in b-tries for b large

Electronic Journal of Combinatorics

Volumn 7, Issue 1 R, 2000, Pages 1-16

  Knessl, Charles ^a   Szpankowski, Wojciech ^b  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b Purdue University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0010766986     PISSN: 10778926     EISSN: None     Source Type: Journal    
DOI: 10.37236/1517     Document Type: Article

References (18)

1. N. Bleistein and R. Handelsman, Asymptotic Expansions of Integrals, Dover Publications, New York 1986.
2. L. Devroye, A Probabilistic Analysis of the Height of Tries and the Complexity of Trie Sort, Acta Informatica, 21, 229-237, 1984.
3. L. Devroye, A Study of Trie-Like Structures Under the Density Model, Ann. Appl. Probability, 2, 402-434, 1992.
4. P. Flajolet, On the Performance Evaluation of Extendible Hashing and Trie Searching, Acta Informatica, 20, 345-369, 1983.
5. D. Gusfield, Algorithms on Strings, Trees, and Sequences, Cambridge University Press, 1997.
6. P. Jacquet and M. Régnier, Trie Partitioning Process: Limiting Distributions, Lecture Notes in Computer Science, 214, 196-210, Springer Verlag, New York 1986.
7. C. Knessl and W. Szpankowski, Limit Laws for Heights in Generalized Tries and PATRICIA Tries, Proc. LATIN'2000, Punta del Este, Uruguay, Lecture Notes in Computer Science, 1776, 298-307, 2000.
8. C. Knessl and W. Szpankowski, Asymptotic Behavior of the Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme, SIAM J. Computing, 2000.
9. D. Knuth, The Art of Computer Programming. Sorting and Searching, Second Edition, Addison-Wesley, 1998.
10. T. Łuczak and W. Szpankowski, A Suboptimal Lossy Data Compression Based in Approximate Pattern Matching, IEEE Trans. Information Theory, 43, 1439-1451, 1997.
11. H. Mahmoud, Evolution of Random Search Trees, John Wiley & Sons, New York 1992.
12. A. Odlyzko, Asymptotic Enumeration, in Handbook of Combinatorics, Vol. II, (Eds. R. Graham, M. Götschel and L. Lovász), Elsevier Science, 1063-1229, 1995.
13. B. Pittel, Asymptotic Growth of a Class of Random Trees, Ann. of Probab., 13, 414-427, 1985.
14. B. Pittel, Path in a Random Digital Tree: Limiting Distributions, Adv. Appl. Prob., 18, 139-155, 1986.
15. M. Régnier, On the Average Height of Trees in Digital Searching and Dynamic Hashing, Inform. Processing Lett., 13, 64-66, 1981.
16. W. Szpankowski, On the Height of Digital Trees and Related Problems, Algorithmica, 6, 256-277, 1991.
17. W. Szpankowski, A Generalized Suffix Tree and its (Un)Expected Asymptotic Behaviors, SIAM J. Computing, 22, 1176-1198, 1993.
18. E.H. Yang, and J. Kieffer, On the Performance of Data Compression Algorithms Based upon String Matching, IEEE Trans. Information Theory, 44, 47-65, 1998.