Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees

This publication has 19 references indexed in Scilit:

• Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
  IEEE Transactions on Information Theory, 1995
• Digital Search Trees Again Revisited: The Internal Path Length Perspective
  SIAM Journal on Computing, 1994
• General combinatorial schemas: Gaussian limit distributions and exponential tails
  Discrete Mathematics, 1993
• The Lempel-Ziv algorithm and message complexity
  IEEE Transactions on Information Theory, 1992
• Generalized Digital Trees and Their Difference—Differential Equations
  Random Structures & Algorithms, 1992
• Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
  IEEE Transactions on Information Theory, 1992
• A diffusion limit for a class of randomly-growing binary trees
  Probability Theory and Related Fields, 1988
• Exact and asymptotic distributions in digital and binary search trees
  RAIRO - Theoretical Informatics and Applications, 1987
• Digital Search Trees Revisited
  SIAM Journal on Computing, 1986
• On the Complexity of Finite Sequences
  IEEE Transactions on Information Theory, 1976