Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
From MaRDI portal
(Redirected from Publication:672989)
Recommendations
- Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
- Average Profile of the Generalized Digital Search Tree and the Generalized Lempel--Ziv Algorithm
- scientific article; zbMATH DE number 1445303
- Average profile of the Lempel-Ziv parsing scheme for a Markovian source
Cites work
- scientific article; zbMATH DE number 4210522 (Why is no real title available?)
- scientific article; zbMATH DE number 53861 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 3274494 (Why is no real title available?)
- A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors
- A characterization of digital search trees from the successful search viewpoint
- A diffusion limit for a class of randomly-growing binary trees
- A functional equation often arising in the analysis of algorithms (extended abstract)
- A universal algorithm for sequential data compression
- Asymptotic properties of data compression and suffix trees
- Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
- Coding theorems for individual sequences
- Compression of individual sequences via variable-rate coding
- Digital Search Trees Again Revisited: The Internal Path Length Perspective
- Digital Search Trees Revisited
- Exact and asymptotic distributions in digital and binary search trees
- General combinatorial schemas: Gaussian limit distributions and exponential tails
- Generalized Digital Trees and Their Difference—Differential Equations
- Limiting Distribution for the Depth in PATRICIA Tries
- New results on the size of tries
- On the Complexity of Finite Sequences
- The Lempel-Ziv algorithm and message complexity
- Universal redundancy rates do not exist
- Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm
Cited in
(19)- scientific article; zbMATH DE number 1445303 (Why is no real title available?)
- The Diagonal Poisson Transform and its application to the analysis of a hashing scheme
- Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm
- A Central Limit Theorem for Non-Overlapping Return Times
- On the variance of a class of inductive valuations of data structures for digital search
- The expected profile of digital search trees
- Analytical depoissonization and its applications
- \(D\cdot E\cdot K=(100)_8\)
- Average profile of the Lempel-Ziv parsing scheme for a Markovian source
- A general limit theorem for recursive algorithms and combinatorial structures
- On optimal parsing for LZ78-like compressors
- On the average redundancy rate of the Lempel-Ziv code with the \(k\)-error protocol
- On the distribution for the duration of a randomized leader election algorithm
- An analytic approach to the asymptotic variance of trie statistics and related structures
- Size and path length of Patricia tries: Dynamical sources context
- The Wiener index of random digital trees
- Exact analysis of the Lempel-Ziv algorithm for i.i.d. sources
- On the variance of the internal path length of generalized digital trees -- the Mellin convolution approach
- Gaussian distribution of trie depth for strongly tame sources
This page was built for publication: Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672989)
