Size and path length of Patricia tries: Dynamical sources context

Random Structures and Algorithms

Volumn 19, Issue 3-4, 2001, Pages 289-315

  Bourdon, Jérémie ^a  

^a UNIVERSITÉ DE CAEN   (France)

Author keywords

Average case analysis of data structures; Dynamical systems; Functional analysis; Information theory; Mellin analysis; Ruelle operator; Trie

Indexed keywords

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

References (31)

1. T. Bell, I. Witten, and J. Cleary, Modelling for text compression, ACM Computing Surveys 21(4) (1989), 557-591.
2. J. Clément, Arbres digitaux et sources dynamiques, Thèse de doctorat de l'Université de Caen, 2000.
3. J. Clément, P. Flajolet, and B. Vallée, Dynamical sources in information theory: A general analysis of trie structures, Algorithmica 29(1) (2001), 307-369.
4. L. Devroye, A study of trie-like structures under the density model, The Annals of Applied Probability 2(2) (1992), 402-434.
5. S. Edelkamp, Dictionary automaton in optimal space, Technical Report of the Computer Science Department, University of Freiburg, 29, 1999.
6. G. Fayolle, P. Flajolet, and M. Hofri, On a functional equation arising in the analysis of a protocol for a multi-access broadcast channel, Advances in Applied Probabilities 18 (1986), 441-472.
7. P. Flajolet, On the performance evaluation of extendible hashing and trie searching, Acta Informatica 20 (1983), 345-369.
8. P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science 144(1/2) (1995), 3-58.
9. P. Flajolet and B. Vallée, Continued fraction algorithms, functional operators, and structure constants, Theoretical Computer Science 194(1/2) (1998), 1-34.
10. P. Flajolet and B. Vallée, Continued fraction, comparison algorithms and fine structure constants, Conference Proceedings, Canadian Mathematical Society, 2000, pp. 1-30.
11. A. Grothendieck, Produit tensoriels topologiques et espaces nucléaires, Memories of the American Mathematical Society, 16 (1955), 1-140.
12. A. Grothendieck, La théorie de fredholm, Bulletin de la Société Mathématique de France, 84 (1956), 319-384.
13. D. Gusfield, Algorithms on strings, trees, and sequences. Computer science and computational biology, vol xviii, Cambridge University Press, Cambridge, (1997), pp. 1-534.
14. G. Held and T. Marshall, Data and image compression, 4th ed., Wiley, New York, 1996.
15. P. Jacquet and M. Régnier, Trie partitioning process: limiting distributions, Lecture notes in computer science, vol 214, Springer Verlag, New York, 1986, pp. 196-210.
16. P. Jacquet and W. Szpankowski, Analytical depoissonization and its applications, Theoretical Computer Science 201(1/2) (1998), 1-62.
17. P. Jacquet and W. Szpankowski, Asymptotic behavior of the lempel-ziv parsing scheme and digital search trees, Theoretical Computer Science 144(1/2) (1995), 161-197.
18. P. Kirschenhofer, H. Prodinger, W. Szpankowski, On the balance property of patricia tries: external path length viewpoint, Theoretical Computer Science 68(1) (1989), 1-17.
19. D.E. Knuth, The art of computer programming volume 3: sorting and searching, 3rd ed., Addison-Wesley, Reading, MA, 1998, pp. 1-736.
20. M.A. Krasnosel'skij, Positive Solutions of operator equations, P. Noordhoff, Groningen, The Netherlands, 1964, pp. 1-381. [Translated from the Russian by Richard E. Flaherty, Edited by Leo F. Boron].
21. H.M. Mahmoud, Evolution of random search trees, New York, Series X Wiley-Interscience, 1992, 1-324.
22. D.R. Morrison, PATRICIA-Practical algorithm to retrieve information coded in alphanumeric, Journal of the ACM 15(4) (1968), 514-534.
23. M. Pollicott, A complex Ruelle-Perron-Frobenius theorem and two counterexamples, Ergodic Theory and Dynamical Systems 4 (1984), 135-146.
24. R. Sedgewick, Algorithms in C 3rd ed., Parts 1-4: Fundamentals, Sorting, Searching, and Strings, Addison-Wesley, Reading, MA, 1998, 1-720.
25. B. Rais, P. Jacquet, and W. Szpankowski, Limiting distribution for the depth in PATRICIA tries, SIAM Journal of Discrete Mathematics 6(2) (1993), 197-213.
26. W. Szpankowski, Average case analysis of algorithms on sequences, Wiley, New York (2001) 1-576.
27. W. Szpankowski, Patricia tries again revisited, Journal of the ACM, 37(4) (1990), 691-711.
28. B. Vallée, Dynamical sources in information theory: Fundamental intervals and word prefixes, Algorithmica 29(1/2) (2001), 262-306.
29. B. Vallée, Digits and continuants in euclidean algorithms. Ergodic versus tauberian theorems, Journal de Théorie des Nombres de Bordeaux 12 (2000), 531-570.
30. J. Ziv and A. Lempel, A universal algorithm for sequential data compression, IEEE Transactions on Information Theory 23(3) (1977), 337-343.
31. J. Ziv and A. Lempel, Compression of individual sequences via variable-rate coding, IEEE Transactions on Information Theory 24(5) (1978), 530-536.