Lempel-Ziv data compression on parallel and distributed systems (Q1736484): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3390/a4030183 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2502297787 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Finite 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
Property / cites work
 
Property / cites work: Efficient parallel algorithms to test square-freeness and factorize strings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism and dictionary based data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: P-complete problems in data compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalability and communication in parallel low-complexity lossless compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Lempel Ziv coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data compression via textual substitution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Algorithm for Data Compression via String Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Space-Economical Suffix Tree Construction Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line versus off-line computation in dynamic text compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A worst-case analysis of the LZ2 compression algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3782752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694726 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jewels of Stringology / rank
 
Normal rank
Property / cites work
 
Property / cites work: BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal modeling and coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Kraft Inequality and Arithmetic Coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Run-length encodings (Corresp.) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SIMPLE LOSSLESS COMPRESSION HEURISTIC FOR GREY SCALE IMAGES / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:46, 18 July 2024

scientific article
Language Label Description Also known as
English
Lempel-Ziv data compression on parallel and distributed systems
scientific article

    Statements

    Lempel-Ziv data compression on parallel and distributed systems (English)
    0 references
    0 references
    0 references
    26 March 2019
    0 references
    Summary: We present a survey of results concerning Lempel-Ziv data compression on parallel and distributed systems, starting from the theoretical approach to parallel time complexity to conclude with the practical goal of designing distributed algorithms with low communication cost. Storer's extension for image compression is also discussed.
    0 references
    dictionary-based compression
    0 references
    string factorization
    0 references
    parallel complexity
    0 references
    distributed algorithm
    0 references
    binary image
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references