Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing

DOI10.1016/j.dam.2023.09.017OpenAlexW3114864936MaRDI QIDQ6184325

Sergio De Agostino

Publication date: 24 January 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2023.09.017

zbMATH Keywords

scalabilityfactorizationdistributedon the fly

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case
• Dictionary-symbolwise flexible parsing
• The greedy approach to dictionary-based static text compression on a distributed system
• On optimally partitioning a text to improve its compression
• P-complete problems in data compression
• A worst-case analysis of the LZ2 compression algorithm
• Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
• Lempel-Ziv data compression on parallel and distributed systems
• Note on the greedy parsing optimality for dictionary-based text compression
• On the Bit-Complexity of Lempel--Ziv Compression
• Data compression via textual substitution
• On the Complexity of Finite Sequences
• A universal algorithm for sequential data compression
• Compression of individual sequences via variable-rate coding
• Parallelism and dictionary based data compression