Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
- 1 June 1995
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 144 (1-2), 161-197
- https://doi.org/10.1016/0304-3975(94)00298-w
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithmIEEE Transactions on Information Theory, 1995
- Digital Search Trees Again Revisited: The Internal Path Length PerspectiveSIAM Journal on Computing, 1994
- General combinatorial schemas: Gaussian limit distributions and exponential tailsDiscrete Mathematics, 1993
- The Lempel-Ziv algorithm and message complexityIEEE Transactions on Information Theory, 1992
- Generalized Digital Trees and Their Difference—Differential EquationsRandom Structures & Algorithms, 1992
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithmIEEE Transactions on Information Theory, 1992
- A diffusion limit for a class of randomly-growing binary treesProbability Theory and Related Fields, 1988
- Exact and asymptotic distributions in digital and binary search treesRAIRO - Theoretical Informatics and Applications, 1987
- Digital Search Trees RevisitedSIAM Journal on Computing, 1986
- On the Complexity of Finite SequencesIEEE Transactions on Information Theory, 1976