Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm

No abstract is available for this paper.

• Publication year

  1995

• Venue

  IEEE Transactions on Information Theory

• Publication date

  1995-03-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1109/18.370149
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees

  1995cited by this paper
• Asymptotic properties of data compression and suffix trees

  1993cited by this paper
• A Generalized Suffix Tree and its (Un)expected Asymptotic Behaviors

  1993cited by this paper
• Entropy and data compression schemes

  1993cited by this paper
• General combinatorial schemas: Gaussian limit distributions and exponential tails

  1993cited by this paper
• The Lempel-Ziv algorithm and message complexity

  1992cited by this paper
• Generalized Digital Trees and Their Difference-Differential Equations

  1992cited by this paper
• Evolution of random search trees

  1991cited by this paper
• Analysis of digital tries with Markovian dependency

  1991cited by this paper
• A Characterization of Digital Search Trees from the Successful Search Viewpoint

  1991cited by this paper
• Compression, tests for randomness and estimating the statistical model of an individual sequence

  1990cited by this paper
• Probabilistic Analysis of Some Distributed Algorithms

  1990cited by this paper
• Estimating the information content of symbol sequences and efficient codes

  1989cited by this paper
• Some asymptotic properties of the entropy of a stationary ergodic data source with applications to data compression

  1989cited by this paper
• On the variance of the external path length in a symmetric digital trie

  1989cited by this paper
• A diffusion limit for a class of randomly-growing binary trees

  1988cited by this paper
• On classification with empirically observed statistics and universal data compression

  1988cited by this paper
• Further Results on Digital Search Trees

  1988cited by this paper
• The Evaluation of an Alternative Sum With Applications to the Analysis of Some Data Structures

  1988cited by this paper
• Applied and Computational Complex Analysis.

  1988cited by this paper
• Exact and Asymptotic Distributions in Digital and Binary Search Trees

  1987cited by this paper
• Trie Partitioning Process: Limiting Distributions

  1986cited by this paper
• Digital Search Trees Revisited

  1986cited by this paper
• Asymptotical Growth of a Class of Random Trees

  1985cited by this paper
• The first-passage density of a continuous gaussian process to a general boundary

  1985cited by this paper
• A universal data compression system

  1983cited by this paper
• Compression of individual sequences via variable-rate coding

  1978cited by this paper
• A universal algorithm for sequential data compression

  1977cited by this paper
• Applied and Computational Complex Analysis

  1974cited by this paper
• The art of computer programming: sorting and searching (volume 3)

  1973cited by this paper
• A note on growing binary trees

  1973cited by this paper
• Convergence of Probability Measures

  1970cited by this paper
• An Introduction to Probability Theory and Its Applications

  1959cited by this paper

• Building Test Batteries Based on Analyzing Random Number Generator Tests within the Framework of Algorithmic Information Theory

  2024cites this paper
• Building test batteries based on analysing random number generator tests within the framework of algorithmic information theory

  2024cites this paper
• Unconditionally Secure Ciphers with a Short Key for a Source with Unknown Statistics

  2023cites this paper
• Reduction of the secret key length in the perfect cipher by data compression and randomisation

  2023cites this paper
• Asymptotically most powerful tests for random number generators

  2022cites this paper
• Analysis of Lempel-Ziv'78 for Markov Sources

  2020cites this paper
• Electricity theft detection framework based on universal prediction algorithm

  2019cites this paper
• Redundancy of Lossless Data Compression for Known Sources by Analytic Methods

  2017cites this paper
• On optimal parsing for LZ78-like compressors

  2017cites this paper
• Analytic Pattern Matching - From DNA to Twitter

  2015cites this paper
• Probabilistic Analysis of Radix Algorithms on Markov Sources

  2015cites this paper
• Analytic Pattern Matching by Philippe Jacquet

  2015cites this paper
• Analysis of depth of digital trees built on general sources. (Analyse de la profondeur des arbres digitaux construits sur des sources générales)

  2014influential citation
• Gaussian Distribution of Trie Depth for Strongly Tame Sources

  2014cites this paper
• Properties of maximum Lempel-Ziv complexity strings

  2013cites this paper
• $(b,m)$-DIGITAL SEARCH TREES

  2012cites this paper
• The Variance of The Profile in Digital Search Trees

  2011cites this paper
• The expected profile of digital search trees

  2011influential citation
• Digital Trees and Memoryless Sources: from Arithmetics to Analysis

  2010cites this paper
• The analysis of enumerative source codes and their use in Burrows‑Wheeler compression algorithms

  2010cites this paper
• Imbalance in Random Digital Trees

  2009cites this paper
• (Un)expected behavior of digital search tree profile

  2009cites this paper
• Asymptotic variance of random symmetric digital search trees

  2009cites this paper
• Asymptotic variance of random digital search trees

  2009cites this paper
• The Expected Profile of Digital Search Trees ∗ December 10 , 2009

  2009influential citation
• On the average profile of symmetric digital search trees

  2009cites this paper
• Average Redundancy for Known Sources: Ubiquitous Trees in Source Coding

  2008cites this paper
• Compression de données sans perte et combinatoire analytique

  2006cites this paper
• Distances in random digital search trees

  2006influential citation
• Monotone runs of uniformly distributed integer random variables: A probabilistic analysis

  2005cites this paper
• Bimodality and Phase Transitions in the Profile Variance of Random Binary Search Trees

  2005cites this paper
• On the pointwise redundancy of the LZ78 algorithm

  2005cites this paper
• Distribution of inter-node distances in digital trees

  2005influential citation
• Dictionary-Based Data Compression

  2003cites this paper
• Runs of geometrically distributed random variables: a probabilistic analysis

  2002cites this paper
• Distinctness of compositions of an integer: A probabilistic analysis

  2001cites this paper
• Average Case Analysis of Algorithms on Sequences

  2001cites this paper
• The Effect of Flexible Parsing for Dynamic Dictionary-Based Data Compression

  2001cites this paper
• Ascending runs of sequences of geometrically distributed random variables: a probabilistic analysis

  2001cites this paper
• Average Profile of the Lempel-Ziv Parsing Scheme for a Markovian Source

  2001influential citation
• Height in a digital search tree and the longest phrase of the Lempel-Ziv scheme

  2000cites this paper
• Asymptotic Properties of Some Underdiagonal Walks Generation Algorithms

  1999cites this paper
• The effect of flexible parsing for dynamic dictionary-based data compression

  1999cites this paper
• Entropy Computations via Analytic Depoissonization

  1999cites this paper
• On the optimality of parsing in dynamic dictionary based data compression

  1999cites this paper
• Average Profile of the Generalized Digital Search Tree and the Generalized Lempel-Ziv Algorithm

  1999influential citation
• Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data Compression

  1998cites this paper
• Implementation and Experimental Evaluation of Flexible Parsing for Dynamic Dictionary Based Data Compression

  1998cites this paper
• Analytical Depoissonization and its Applications

  1998cites this paper
• Average profile of the Lempel-Ziv scheme for a Markovian source

  1997cites this paper
• On the average redundancy rate of the Lempel-Ziv code

  1997cites this paper
• Second-order analysis of lossless and lossy versions of Lempel-Ziv codes

  1997cites this paper
• The Diagonal Poisson Transform and its application to the analysis of a hashing scheme

  1997cites this paper
• Techniques of the Average Case Analysis of Algorithms

  1996cites this paper
• Average redundancy rate of the Lempel-Ziv code

  1996cites this paper
• On asymptotics of Certain Recurrences Arising in Multi-Alphabet Universal Coding

  1996cites this paper
• Analysis of hashing algorithms and a new mathematical transform

  1996cites this paper
• Asymptotic Behavior of the Lempel-Ziv Parsing Scheme and Digital Search Trees

  1995cites this paper
• On Generalized Digital Search Trees with Applications to a Generalized Lempel-ziv Algorithm

  1995cites this paper
• On the Variance of a Class of Inductive Valuations of Data Structures for Digital Search

  1995cites this paper
• On asymptotics of certain sums arising in coding theory

  1995cites this paper
• Generalized Lempel-Ziv parsing scheme and its preliminary analysis of the average profile

  1995cites this paper
• Asymptotic behavior of the Lempel-Ziv parsing scheme and digital trees

  1995cites this paper
• On the Average Redundancy Rate of the Lempel

  1995cites this paper
• Algorithms seminar, 1994-1995

  1995cites this paper
• A functional equation often arising in the analysis of algorithms (extended abstract)

  1994cites this paper
• The redundancy and distribution of the phrase lengths of the fixed-database Lempel-Ziv algorithm

  1994cites this paper
• A Functional Equation Arising in the Analysis of Algorithms

  1994cites this paper
• Stability Considerations for Networks Project Summary

  year unknowncites this paper
• Analytical Approach to Some Problems Involving Order Statistics

  year unknowncites this paper
• The Variance of the Profile in Digital Search Trees

  year unknowncites this paper