Succinct data structures for segments

DOI10.4230/LIPICS.CPM.2025.27MaRDI QIDQ7299462zbMATH OpenFDO

Authors Philip Bille, Inge Li Gørtz, Simon Rumle Tarnow

Publication date 17 July 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2025.27

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Cites work

• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• A space-efficient framework for dynamic point location
• An optimal dynamic data structure for stabbing-semigroup queries
• Compressed representations of sequences and full-text indexes
• scientific article; zbMATH DE number 5485435 (Why is no real title available?)
• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• On the Size of Succinct Indices
• Random access in persistent strings and segment selection
• Range selection and median: tight cell probe lower bounds and adaptive data structures
• Rank and select revisited and extended
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
• Space-efficient data-analysis queries on grids
• Succinct and Implicit Data Structures for Computational Geometry
• Succinct geometric indexes supporting point location queries
• Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing

This page was built for publication: Succinct data structures for segments

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