New advances in rightmost Lempel-Ziv
From MaRDI portal
Publication:6545424
DOI10.1007/978-3-031-43980-3_15MaRDI QIDQ6545424
Max Rishøj Pedersen, Johannes Fischer, Jonas Ellert
Publication date: 29 May 2024
lossless compressionstring algorithmslinear-time algorithmsLempel-Ziv factorizationLZ77word packingLZ-Endrightmost LZ
Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Cites Work
- Unnamed Item
- Online timestamped text indexing
- On compressing and indexing repetitive sequences
- Lempel-Ziv factorization powered by space efficient suffix trees
- Efficient parallel algorithms to test square-freeness and factorize strings
- On the Bit-Complexity of Lempel--Ziv Compression
- Computing Lempel-Ziv Factorization Online
- Lempel Ziv Computation in Small Space (LZ-CISS)
- Faster Lightweight Lempel-Ziv Parsing
- Faster Compact On-Line Lempel-Ziv Factorization
- Lempel-Ziv Factorization Revisited
- Suffix Arrays: A New Method for On-Line String Searches
- An Online Algorithm for Finding the Longest Previous Factors
- Data compression via textual substitution
- On the Complexity of Finite Sequences
- Range Predecessor and Lempel-Ziv Parsing
- Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
- Lempel-Ziv Compression in a Sliding Window
- LZ-End Parsing in Linear Time
- Most Recent Match Queries in On-Line Suffix Trees
- String synchronizing sets: sublinear-time BWT construction and optimal LCE data structure
- An upper bound and linear-space queries on the LZ-End parsing
- Optimal LZ-end parsing is hard
This page was built for publication: New advances in rightmost Lempel-Ziv
