Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees (Q672989): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A diffusion limit for a class of randomly-growing binary trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Digital Trees and Their Difference—Differential Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital Search Trees Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: General combinatorial schemas: Gaussian limit distributions and exponential tails / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lempel-Ziv algorithm and message complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A functional equation often arising in the analysis of algorithms (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Digital Search Trees Again Revisited: The Internal Path Length Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Finite Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and asymptotic distributions in digital and binary search trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average profile and limiting distribution for a phrase size in the Lempel-Ziv parsing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds on the probability of sequences emitted by finite-state sources and on the redundancy of the Lempel-Ziv algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Distribution for the Depth in PATRICIA Tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results on the size of tries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal redundancy rates do not exist / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of digital search trees from the successful search viewpoint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Suffix Tree and Its (Un)Expected Asymptotic Behaviors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic properties of data compression and suffix trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coding theorems for individual sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: A universal algorithm for sequential data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression of individual sequences via variable-rate coding / rank
 
Normal rank

Revision as of 10:21, 27 May 2024

scientific article
Language Label Description Also known as
English
Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees
scientific article

    Statements

    Asymptotic behavior of the Lempel-Ziv parsing scheme and digital search trees (English)
    0 references
    0 references
    0 references
    28 February 1997
    0 references
    Lempel-Ziv parsing scheme
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers