Application of Lempel-Ziv factorization to the approximation of grammar-based compression. (Q1401326): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On the complexity of pattern matching for highly compressed two-dimensional texts. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the smallest grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4849531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4347161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grammar-based codes: a new class of universal lossless source codes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828933 / 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: Q4737684 / rank
 
Normal rank

Revision as of 09:50, 6 June 2024

scientific article
Language Label Description Also known as
English
Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
scientific article

    Statements

    Application of Lempel-Ziv factorization to the approximation of grammar-based compression. (English)
    0 references
    0 references
    17 August 2003
    0 references
    0 references
    LZ-compression
    0 references
    Minimal grammar
    0 references
    AVL-tree
    0 references
    AVL-grammar
    0 references