Analysis of random LC tries

Random Structures and Algorithms

Volumn 19, Issue 3-4, 2001, Pages 359-375

  Devroye, Luc ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

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

Indexed keywords

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

References (46)

1. D. Aldous and P. Shields, A diffusion limit for a class of randomly-growing binary trees, Probab Theory Related Fields 79 (1988), 509-542.
2. N. Alon, J. Spencer, and P. Erdös, The Probabilistic Method, John Wiley, New York, 1992.
3. A. Andersson and N. Nilsson, Efficient implementation of suffix trees, Software Practice and Experience Vol. 25(2) (1995), 129-141.
4. A. Andersson and S. Nilsson, Improved behaviour of tries by adaptive branching, Inform Process Lett 46 (1993), 295-300.
5. A. Andersson and S. Nilsson, Faster searching in tries and quadtrees - an analysis of level compression, Proc of the Second Annual European Symposium on Algorithms, 1994, pp. 82-93.
6. K. Azuma, Weighted sums of certain dependent random variables, Tohoku Math J 37 (1967), 357-367.
7. L. Devroye, A note on the average depth of tries, Computing 28 (1982), 367-371.
8. L. Devroye, A probabilistic analysis of the height of tries and of the complexity of triesort, Acta Informatics 21 (1984), 229-237.
9. L. Devroye, A note on the probabilistic analysis of PATRICIA trees, Random Struct Algorithms 3 (1992a), 203-214.
10. L. Devroye, A study of trie-like structures under the density model, Ann Appl Probab 2 (1992b), 402-434.
11. G. Ehrlich, Searching and sorting real numbers, J Algorithms 2 (1982), 1-12.
12. J.D. Esary, F. Proschan, and D.W. Walkup, Association of random variables, with applications, Annals Math Statist 38 (1967), 1466-1474.
13. P. Flajolet, On the performance evaluation of extendible hashing and trie search, Acta Informatica 20 (1983), 345-369.
14. P. Flajolet and R. Sedgewick, Digital search trees revisited, SIAM J Computing 15 (1986), 748-767.
15. 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, Springer-Verlag, New York, 1982, pp. 239-251.
16. E.H. Fredkin, Trie memory, Commun ACM 3 (1960), 490-500.
17. W. Hoeffding, Probability inequalities for sums of hounded random variables, J American Statist Assoc 58 (1963), 13-30.
18. J.-P. Iivonen, S. Nilsson, and M. Tikkanen, An experimental study of compression methods for functional tries, Workshop on Algorithmic Aspects of Advanced Programming Languages (WAAAPL'99), 1999.
19. P. Jacquet and M. Régnier, Trie partitioning process: limiting distributions, in: Lecture Notes in Computer Science, vol. 214, pp. 196-210, 1986.
20. P. Jacquet and W. Szpankowski, Analysis of digital tries with Markovian dependency, IEEE Trans Information Theory IT-37 (1991), 1470-1475.
21. K. Joag-Dev and F. Proschan, Negative association of random variables, with applications, Annals Statist 11 (1983), 286-295.
22. P. Kirschenhofer and H. Prodinger, Some further results on digital trees, Lecture Notes in Computer Science, Vol. 226, Springer-Verlag, Berlin, 1986, pp. 177-185.
23. 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.
24. 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.
25. D.E. Knuth, The Art of Computer Programming, Vol. 3 : Sorting and Searching, Addison-Wesley, Reading, MA, 1973.
26. V.F. Kolchin, B.A. Sevast'yanov, and VP. Chistyakov, Random Allocations, V.H. Winston and Sons, Washington, D.C., 1978.
27. C.L. Mallows, An inequality involving multinomial probabilities, Biometrika 55 (1968), 422-424.
28. C. McDiarmid, "On the method of hounded differences," Surveys in Combinatorics, J. Siemens (Editor), Vol. 141, London Mathematical Society Lecture Note Series, Cambridge University Press, 1989, pp. 148-188.
29. H. Mendelson, Analysis of extendible hashing, IEEE Trans Software Eng 8 (1982) 611-419.
30. D.R. Morrison, PATRICIA - Practical Algorithm To Retrieve Information Coded in Alphanumeric, J ACM 15 (1968), 514-534.
31. A. Nilsson and G. Karlsson, Fast address look-up for Internet routers, Proc IFIP Fourth International Conference on Broadband Communications, 1998, pp. 11-22.
32. S. Nilsson and G. Karlsson, IP-address lookup using LC-tries, IEEE J Selected Areas in Commun 17(6) (1999), 1083-1092.
33. S. Nilsson and M. Tikkanen, An experimental study of compression methods for dynamic tries, Submitted to Algorithmica, 1998.
34. B. Pittel, Asymptotical growth of a class of random trees, Ann Probab 13 (1985), 414-427.
35. B. Pittel, Path in a random digital tree: limiting distributions, Adv Appl Probab 18 (1986), 139-155.
36. B. Pittel, On the height of PATRICIA search tree, ORSA/TIMS Special Interest Conference on Applied Probability in the Engineering, Information and Natural Sciences, Monterey, CA, 1991.
37. B. Pittel and H. Rubin, How many random questions are necessary to identify n distinct objects?, J Combinat Theory A55 (1990), 292-312.
38. B. Rais, P. Jacquet, and W. Szpankowski, A limiting distribution for the depth in Patricia tries, SIAM J Discrete Math 6 (1993), 197-213.
39. M. Régnier, On the average height of trees in digital searching and dynamic hashing, Information Processing Lett 13 (1981), 64-66.
40. M. Régnier, Trie hashing analysis, Proc Fourth International Conference on Data Engineering, pp. 377-381, IEEE, Los Angeles, 1988.
41. W. Szpankowski, Some results on V-ary asymmetric tries, J Algorithms 9 (1988), 224-244.
42. W. Szpankowski, "Digital data structures and order statistics," Algorithms and Data Structures: Workshop WADS '89 Ottawa, Lecture Notes in Computer Science, Vol. 382, Springer-Verlag, Berlin, 1989, pp. 206-217.
43. W. Szpankowski, Patricia trees again revisited, J ACM 37 (1990), 691-711.
44. W. Szpankowski, On the height of digital trees and related problems, Algorithmica 6 (1991), 256-277.
45. W. Szpankowski and C. Knessl, Heights in generalized tries and PATRICIA tries, LATIN'2000, Lecture Notes in Computer Science Vol. 1776, 2000, pp. 298-307.
46. M. Tamminen, Analysis of N-trees, Information Processing Lett 16 (1983), 131-137.