Lempel Ziv Computation in Small Space (LZ-CISS)
From MaRDI portal
Publication:2942255
DOI10.1007/978-3-319-19929-0_15zbMath1432.68138arXiv1504.02605OpenAlexW1873490270MaRDI QIDQ2942255
Dominik Köppl, Johannes Fischer, Tomohiro I.
Publication date: 20 August 2015
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.02605
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Related Items
Approximating LZ77 via Small-Space Multiple-Pattern Matching, Lempel Ziv Computation in Small Space (LZ-CISS), Faster Lightweight Lempel-Ziv Parsing, LZ78 Compression in Low Main Memory Space, Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries, Lempel-Ziv-78 compressed string dictionaries
Cites Work
- Succinct representations of permutations and functions
- Representing trees of higher degree
- Improved dynamic dictionary matching
- Constructing LZ78 tries and position heaps in linear time for large alphabets
- Linked dynamic tries with applications to LZ-compression in sublinear time and space
- Fully Functional Static and Dynamic Succinct Trees
- Alphabet-Dependent String Searching with Wexponential Search Trees
- Lempel Ziv Computation in Small Space (LZ-CISS)
- Suffix Arrays: A New Method for On-Line String Searches
- Linear work suffix array construction
- Optimal Succinctness for Range Minimum Queries
- A universal algorithm for sequential data compression
- Compression of individual sequences via variable-rate coding
- Efficient LZ78 Factorization of Grammar Compressed Text
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- Lempel-Ziv Factorization: Simple, Fast, Practical
- Engineering a compressed suffix tree implementation
