Faster dynamic compressed d-ary relations

DOI10.1007/978-3-030-32686-9_30MaRDI QIDQ6536269zbMATH OpenFDO

Authors Diego Arroyuelo, Guillermo de Bernardo, Travis Gagie, Gonzalo Navarro

Publication date 19 April 2024

Full work available at URL https://doi.org/10.1007/978-3-030-32686-9_30

Mathematics Subject Classification ID

Data structures (68P05)

Recommendations

• An Improved Succinct Representation for Dynamic k-ary Trees
• A succinct data structure for self-indexing ternary relations
• A practical succinct dynamic graph representation
• Compact rich-functional binary relation representations
• Succinct dynamic cardinal trees

Cites work

• A succinct data structure for self-indexing ternary relations
• Foundations of multidimensional and metric data structures.
• Fully functional static and dynamic succinct trees
• Practical entropy-compressed rank/select dictionary
• Practical implementation of space-efficient dynamic keyword dictionaries
• Representing trees of higher degree
• Space-efficient construction of Lempel-Ziv compressed text indexes
• Succinct dynamic cardinal trees
• Tables
• Towards a compact representation of temporal rasters

This page was built for publication: Faster dynamic compressed \(d\)-ary relations

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