The macro model for data compression (Extended Abstract)

DOI10.1145/800133.804329zbMath1282.68097OpenAlexW2034339630MaRDI QIDQ5402538

James A. Storer, Thomas G. Szymanski

Publication date: 14 March 2014

Published in: Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/800133.804329

Mathematics Subject Classification ID

Database theory (68P15) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (14)

Approximation of smallest linear tree grammar ⋮ On finding minimal length superstrings ⋮ Random access in persistent strings and segment selection ⋮ A \textit{really} simple approximation of smallest grammar ⋮ On the compressibility of finite languages and formal proofs ⋮ Unnamed Item ⋮ Approximation of grammar-based compression via recompression ⋮ Dynamic relative compression, dynamic partial sums, and substring concatenation ⋮ Forty Years of Text Indexing ⋮ Optimal encoding of non-stationary sources ⋮ Approximability of minimum AND-circuits ⋮ Compressibility of Finite Languages by Grammars ⋮ A fully linear-time approximation algorithm for grammar-based compression ⋮ A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem

This page was built for publication: The macro model for data compression (Extended Abstract)