Probabilistic behavior of asymmetric Level Compressed tries

Random Structures and Algorithms

Volumn 27, Issue 2, 2005, Pages 185-200

  Devroye, Luc ^a   Szpankowski, Wojcieh ^b  

^a MCGILL UNIVERSITY   (Canada)

^b Purdue University   (United States)

Author keywords

Height of a tree; Law of large numbers; LC trie; Probabilistic analysis; Trie

Indexed keywords

EID: 26944470786     PISSN: 10429832     EISSN: None     Source Type: Journal    
DOI: 10.1002/rsa.20067     Document Type: Article

References (28)

1. A. Andersson and S. Nilsson, Improved behaviour of tries by adaptive branching, Inform Process Lett 46 (1993), 295-300.
2. A. Andersson and S. Nilsson, Faster searching in tries and quadtrees - an analysis of level compression, Proc Second Annu European Symp Algorithms, (1994), 82-93.
3. A. Andersson and N. Nilsson, Efficient implementation of suffix trees, Software Practice Experience 25(2) (1995), 129-141.
4. L. Devroye, A note on the average depth of tries, Computing 28 (1982), 367-371.
5. L. Devroye, A probabilistic analysis of the height of tries and of the complexity of triesort, Acta Inform 21 (1984), 229-237.
6. L. Devroye, An analysis of random LC tries, Random Structures Algorithms 15 (2001), 359-375.
7. P. Flajolet, On the performance evaluation of extendible hashing and trie search, Acta Inform 20 (1983), 345-369.
8. P. Flajolet and R. Sedgewick, Digital search trees revisited, SIAM J Comput 15 (1986), 748-767.
9. P. Flajolet and J. M. Steyaert, A branching process arising in dynamic hashing, trie searching and polynomial factorization, Lecture notes in computer science, Vol. 140, M. Nielsen and E. M. Schmidt (Editors), Springer, New York, 1982, pp. 239-251.
10. E. H. Fredkin, Trie memory, Commun ACM 3 (1960), 490-500.
11. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Amer Statist Assoc 58 (1963), 13-30.
12. J.-P. livonen, S. Nilsson, and M. Tikkanen, An experimental study of compression methods for functional tries, Workshop Algorithmic Aspects of Advanced Programming Languages (WAAAPL'99), 1999, pp. 101-116.
13. P. Jacquet and M. Régnier, Trie partitioning process: Limiting distributions, Lecture notes in computer science, Vol. 214, Springer, Berlin, 1986, pp. 196-210.
14. P. Kirschenhofer and H. Prodinger, Some further results on digital trees, Lecture notes in computer science, Vol. 226, Springer Berlin, 1986, pp. 177-185.
15. P. Kirschenhofer, H. Prodinger, and W. Szpankowski, On the balance property of PATRICIA tries: External path length viewpoint, Theoret Comput Sci, 68 (1989), 1-17.
16. P. Kirschenhofer, H. Prodinger, and W. Szpankowski, On the variance of the external path length in a symmetric digital trie, Discrete Appl Math 25 (1989), 129-143.
17. D. E. Knuth, The art of computer programming, Volume 3: Sorting and searching, Addison-Wesley, Reading, MA, 1973.
18. H. Mendelson, Analysis of extendible hashing, IEEE Trans Software Eng 8 (1982), 611-619.
19. A. Nilsson and G. Karlsson, Fast address look-up for Internet routers, Proc IFIP 4th Int Conf Broadband Communications, 1998, pp. 11-22.
20. S. Nilsson and G. Karlsson, IP-address lookup using LC-tries, IEEE J Selected Areas Commun 17(6) (1999), 1083-1092.
21. S. Nilsson and M. Tikkanen, An experimental study of compression methods for dynamic tries, Algorithmica, submitted.
22. B. Pittel, Asymptotical growth of a class of random trees, Ann Probab 13 (1985), 414-427.
23. B. Pittel, Path in a random digital tree: Limiting distributions, Adv Appl Probab 18 (1986), 139-155.
24. M. Régnier, On the average height of trees in digital searching and dynamic hashing, Inform Process Lett 13 (1981), 64-66.
25. M. Régnier, Trie hasing analysis, Proc Fourth Int Conf Data Engineering, IEEE, Los Angeles, 1988, pp. 337-381.
26. W. Szpankowski, Some results on V-ary asymmetric tries, J Algorithms 9 (1988), 224-244.
27. W. Szpankowski, On the height of digital trees and related problems, Algorithmica 6 (1991) 256-277.
28. W. Szpankowski, Average case analysis of algorithms on sequences, Springer, New York, 2001.