Lempel-Ziv Factorization: Simple, Fast, Practical
From MaRDI portal
Publication:5232451
DOI10.1137/1.9781611972931.9zbMath1430.68462OpenAlexW2205321190MaRDI QIDQ5232451
Dominik Kempa, Simon J. Puglisi
Publication date: 12 September 2019
Published in: 2013 Proceedings of the Fifteenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/2b110cdb300a4688ae9ee08cbe3b30ac5b84208d
Analysis of algorithms (68W40) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Data structures (68P05) Algorithms on strings (68W32)
Related Items (5)
Lempel Ziv Computation in Small Space (LZ-CISS) ⋮ Fixed block compression boosting in FM-indexes: theory and practice ⋮ Refining the \(r\)-index ⋮ Bicriteria Data Compression ⋮ Lazy Lempel-Ziv Factorization Algorithms
Uses Software
This page was built for publication: Lempel-Ziv Factorization: Simple, Fast, Practical
