On the Bit-Complexity of Lempel--Ziv Compression
From MaRDI portal
Publication:2862201
DOI10.1137/120869511zbMath1276.68069arXiv0802.0835OpenAlexW1990184581MaRDI QIDQ2862201
Igor Nitto, Rossano Venturini, Paolo Ferragina
Publication date: 14 November 2013
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0802.0835
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05)
Related Items (8)
Comparison of LZ77-type parsings ⋮ Unnamed Item ⋮ Greedy versus optimal analysis of bounded size dictionary compression and on-the-fly distributed computing ⋮ Lempel-Ziv-like parsing in small space ⋮ Dictionary-Symbolwise Flexible Parsing ⋮ The greedy approach to dictionary-based static text compression on a distributed system ⋮ Bidirectional Text Compression in External Memory ⋮ Bicriteria Data Compression
Uses Software
This page was built for publication: On the Bit-Complexity of Lempel--Ziv Compression
