Bat-LZ out of hell

DOI10.4230/LIPICS.CPM.2024.21MaRDI QIDQ6891074zbMATH OpenFDO

Authors Zsuzsanna Lipták, Francesco Masillo, Gonzalo Navarro

Publication date 2 December 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

data compressioncompressed data structuresrepetitive text collectionsLempel-Ziv parsing

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• scientific article; zbMATH DE number 3913711 (Why is no real title available?)
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• An upper bound and linear-space queries on the LZ-End parsing
• Application of Lempel-Ziv factorization to the approximation of grammar-based compression.
• Balancing Straight-line Programs
• Combined data structure for previous- and next-smaller-values
• Data structure lower bounds on random access to grammar-compressed strings
• Efficient Storage and Retrieval by Content and Address of Static Files
• Fast construction of wavelet trees
• Grammar-based codes: a new class of universal lossless source codes
• Grammar-compressed indexes with logarithmic search time
• LZ-End Parsing in Linear Time
• Lazy Lempel-Ziv factorization algorithms
• Lempel Ziv computation in small space (LZ-CISS)
• Lempel-Ziv Factorization Revisited
• Lempel-Ziv factorization powered by space efficient suffix trees
• Lempel-Ziv factorization using less time \& space
• Linear Algorithm for Data Compression via String Matching
• Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
• New advances in rightmost Lempel-Ziv
• On compressing and indexing repetitive sequences
• On the Complexity of Finite Sequences
• On the complexity and approximability of bounded access Lempel Ziv coding
• On-line construction of suffix trees
• Orthogonal point location and rectangle stabbing queries in 3-d
• Orthogonal range searching in linear and almost-linear space
• Random access to grammar-compressed strings and trees
• Range predecessor and Lempel-Ziv parsing
• Space-efficient preprocessing schemes for range minimum queries on static arrays
• The Smallest Grammar Problem
• Two Efficient Algorithms for Linear Time Suffix Array Construction

Cited in

(1)

• Hardness and approximability of bounded access Lempel Ziv coding

This page was built for publication: Bat-LZ out of hell

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891074)