Sublinear algorithms for approximating string compressibility (Q2392931): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Discrete Cosine Transform / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Approximating the Entropy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934616 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal Entropy Estimation Via Block Sorting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003151 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering by Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023085 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the combinatorics of finite words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4808652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On average sequence complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized substring compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using literal and grammatical statistics for authorship attribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828933 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture on word complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Similarity Metric / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4337021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation of Entropy and Mutual Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimating Entropy on<tex>$m$</tex>Bins Given Fewer Than<tex>$m$</tex>Samples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sublinear Algorithms for Approximating String Compressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum number of distinct factors of a binary string / rank
 
Normal rank
Property / cites work
 
Property / cites work: The context-tree weighting method: basic properties / 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

Latest revision as of 16:52, 6 July 2024

scientific article
Language Label Description Also known as
English
Sublinear algorithms for approximating string compressibility
scientific article

    Statements

    Sublinear algorithms for approximating string compressibility (English)
    0 references
    0 references
    0 references
    5 August 2013
    0 references
    sublinear algorithms
    0 references
    lossless compression
    0 references
    run-length encoding
    0 references
    Lempel-Ziv
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers