Average profile of the generalized digital search tree and the generalized Lempel-Ziv algorithm

SIAM Journal on Computing

Volumn 28, Issue 3, 1999, Pages 904-934

  Louchard, G U Y ^a   Szpankowski, Wojciech ^b   Tang, Jing ^c  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b Purdue University   (United States)

^c MICROSOFT   (United States)

Author keywords

Asymptotic expansions; Average redundancy; Depoissonization; Generalized digital search trees; Generalized Lempel Ziv parsing scheme; Mellin transform; Partial differential functional equations; Singularity analysis

Indexed keywords

ASYMPTOTIC STABILITY; DATA STRUCTURES; INFORMATION RETRIEVAL SYSTEMS; MATHEMATICAL TRANSFORMATIONS; ONLINE SEARCHING; PARTIAL DIFFERENTIAL EQUATIONS; REDUNDANCY;

AVERAGE REDUNDANCY; DEPOISSONIZATION; DIFFERENTIAL FUNCTIONAL EQUATIONS; GENERALIZED DIGITAL SEARCH TREES; GENERALIZED LEMPEL-ZIV PARSING SCHEME; MELLIN TRANSFORM; SINGULARITY ANALYSIS;

ALGORITHMS;

EID: 0032272332     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/s0097539796301811     Document Type: Article

References (41)

1. D. ALDOUS AND P. SHIELDS, A diffusion limit for a class of random-growing binary trees, Probab. Theory Related Fields, 79 (1988), pp. 509-542.
2. P. BILLINGSLEY, Convergence of Probability Measures, John Wiley & Sons, New York, 1968.
3. T.M. COVER AND J.A. THOMAS, Elements of Information Theory, John Wiley & Sons, New York, 1991.
4. B. DAVIES, Integral Transforms and Their Applications, Springer-Verlag, New York, 1985.
5. G. DOETSCH, Handbuch der Laplace Transformation, Birkhäuser Verlag, Basel, 1950.
6. P. FLAJOLET AND R. SEDGEWICK, Digital search trees revisited, SIAM J. Comput., 15 (1986), pp. 748-767.
7. P. FLAJOLET AND A. ODLYZKO, Singularity analysis of generating functions, SIAM J. Disc. Meth., 3 (1990), pp. 216-240.
8. P. FLAJOLET AND B. RICHMOND, Generalized digital trees and their difference - differential equations, Random Structures Algorithms, 3 (1992), pp. 305-320.
9. P. FLAJOLET, X. GOURDON, AND P. DUMAS, Mellin transforms and asymptotics: Harmonic sums, Theoret. Comput. Sci., 144 (1995), pp. 3-58.
10. P. FLAMANT, Sur une equation différentielle fonctionelle linéaire, Rend. Cire. Mat. Palermo, XLVIII (1924), pp. 135-208.
11. E. GILBERT AND T. KADOTA, The Lempel-Ziv algorithm and message complexity, IEEE Trans. Inform. Theory, 38 (1992), pp. 1839-1842.
12. F. HUBALEK, Beiträge zur Analyse Verallgemeinerter Digitaler Suchbäume, Ph.D. thesis, Technische Universität Wien, Vienna, 1994.
13. K. HUMMELSHEIM AND C. KLEINER, Project in CS 543: Analysis of a data compression algorithm, Department of Computer Science, Purdue University, West Lafayette, IN, 1996.
14. P. JACQUET AND W. SZPANKOWSKI, Analysis of digital trees with Markovian dependency, IEEE Trans. Inform. Theory, 37 (1991), pp. 1470-1475.
15. P. JACQUET AND W. SZPANKOWSKI, Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees, Theoret. Comput. Sci., 144 (1995), pp. 161-197.
16. P. JACQUET AND W. SZPANKOWSKI, Analytical depoissonization lemma and its applications, Theoret. Comput. Sci., 201 (1998), pp. 1-62.
17. P. JACQUET AND W. SZPANKOWSKI, Entropy computations via analytic depoissonization, IEEE Trans. Inform. Theory, 1999, to appear.
18. S. JANSON AND W. SZPANKOWSKI, Analysis of an asymmetric leader election algorithm, Electron. J. Combin., 4 (1997), Research Paper 17, (electronic).
19. P. KIRSCHENHOFER, H. PRODINGER, AND W. SZPANKOWSKI, Digital search trees again revisited: The internal path length perspective, SIAM J. Comput., 23 (1994), pp. 598-616.
20. D. KNUTH, The Art of Computer Programming. Sorting and Searching. Vol. 3, Addison-Wesley, Reading, MA, 1973.
21. A. KONHEIM AND D.J. NEWMAN, A note on growing binary trees, Discrete Math., 4 (1973), pp. 57-63.
22. A. LEMPEL AND J. Ziv, A universal algorithm for sequential data compression, IEEE Trans. Inform. Theory, 23 (1977), pp. 337-343.
23. A. LEMPEL AND J. Ziv, Compression of individual sequences via variable-rate coding, IEEE Trans. Inform. Theory, 24 (1978), pp. 530-536.
24. G. LOUCHARD, Exact and asymptotic distributions in digital and binary search trees, RAIRO Theoretical Inform. Appl., 21 (1987), pp. 479-495.
25. G. LOUCHARD, Digital search trees revisited, Cahiers Centre Études Rech. Oper., 36 (1995), pp. 259-278.
26. G. LOUCHARD AND W. SZPANKOWSKI, Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm, IEEE Trans. Inform. Theory, 41 (1995), pp. 478-488.
27. G. LOUCHARD AND W. SZPANKOWSKI, Generalized Lempel-Ziv parsing scheme and its preliminary analysis of the average profile, in Proc. Data Compression Conference, Snowbird, UT, 1995, pp. 262-271.
28. G. LOUCHARD AND W. SZPANKOWSKI, On the average redundancy rate of the Lempel-Ziv code, IEEE Trans. Inform. Theory, 43 (1997), pp. 2-8.
29. H. MAHMOUD, Evolution of Random Search Trees, John Wiley & Sons, New York, 1992.
30. D. ORNSTEIN AND B. WEISS, Entropy and data compression schemes, IEEE Trans. Inform. Theory, 39 (1993), pp. 78-83.
31. B. PITTEL, Asymptotic growth of a class of random trees, Ann. Probab., 13 (1985), pp. 414-427.
32. H. PRODINGER, Approximate counting via Euler transform, Math. Slovaca, 44 (1994), pp. 569-574.
33. H. PRODINGER, Digital search trees and basic hypergeometric functions, EATCS Bulletin, 56 (1995), pp. 112-115.
34. B. RAIS, P. JACQUET, AND W. SZPANKOWSKI, A limiting distribution for the depth in PATRICIA tries, SIAM J. Discrete Math., 6 (1993), pp. 197-213.
35. S. SAVARI, Redundancy of the Lempel-Ziv incremental parsing rule, IEEE Trans. Information Theory, 43 (1997), pp. 9-21.
36. J. STORER, Data Compression: Methods and Theory, Computer Science Press, Rockville, MD, 1988.
37. W. SZPANKOWSKI, The evaluation of an alternating sum with applications to the analysis of some data structures, Inform. Process. Lett., 28 (1988), pp. 13-19.
38. W. SZPANKOWSKI, A characterization of digital search trees from the successful search viewpoint, Theoret. Comput. Sci., 85 (1991), pp. 117-134.
39. W. SZPANKOWSKI, A generalized suffix tree and its (un)expected asymptotic behaviors, SIAM J. Comput., 22 (1993), pp. 1176-1198.
40. J. TANG, Probabilistic Analysis of Digital Search Trees, Ph.D. thesis, Purdue University, West Lafayette, IN, 1996.
41. A. WYNER AND J. ZIV, Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression, IEEE Trans. Inform. Theory, 35 (1989), pp. 1250-1258.