Highly succinct dynamic data structures

DOI10.1007/978-3-030-25027-0_3MaRDI QIDQ2291412zbMATH OpenOpenAlexFDO

Authors Torben Hagerup

Publication date 30 January 2020

Full work available at URL https://doi.org/10.1007/978-3-030-25027-0_3

zbMATH Keywords

arrayschoice dictionariesconstant-time initializationin-place chain techniquespace efficiency

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• scientific article; zbMATH DE number 1830754
• On the Size of Succinct Indices
• Succinct data structures\ \dots potential for symbolic computation?
• A compact data structure for representing a dynamic multiset
• Fully-functional succinct trees

Cited in

(3)

• In-place initializable arrays
• scientific article; zbMATH DE number 1830754 (Why is no real title available?)
• A constant-time colored choice dictionary with almost robust iteration

This page was built for publication: Highly succinct dynamic data structures

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