Compressibility measures and succinct data structures for piecewise linear approximations

DOI10.4230/LIPICS.ISAAC.2025.31MaRDI QIDQ7364372zbMATH OpenFDO

Authors Paolo Ferragina, Filippo Lari

Publication date 1 October 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.ISAAC.2025.31

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A Learned Approach to Design Compressed Rank/Select Data Structures
• A simple storage scheme for strings achieving entropy bounds
• An on-line algorithm for fitting straight lines between data ranges
• Beyond logarithmic bounds: querying in constant expected time with learned indexes
• Cell-probe lower bounds for succinct partial sums
• Efficient Storage and Retrieval by Content and Address of Static Files
• FL-RMQ: a learned approach to range minimum queries
• Learned monotone minimal perfect hashing
• On the performance of learned data structures
• PLA-index: a k-mer index exploiting rank curve linearity
• Practical entropy-compressed rank/select dictionary

This page was built for publication: Compressibility measures and succinct data structures for piecewise linear approximations

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