BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC

DOI10.1142/S0129054106004406zbMath1169.68402MaRDI QIDQ3421843

Sergio De Agostino

Publication date: 8 February 2007

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

space complexitybounded dictionaryLRU strategyLZ2 compression

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Related Items (1)

Lempel-Ziv data compression on parallel and distributed systems

Cites Work

• P-complete problems in data compression
• Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms.
• Compression of individual sequences via variable-rate coding

This page was built for publication: BOUNDED SIZE DICTIONARY COMPRESSION: RELAXING THE LRU DELETION HEURISTIC