Abstract
It is attempted to elucidate a number of known dynamic data structures that come close to using the absolutely minimal amount of space, and their connections and ramifications are explored.
Author supplied keywords
Cite
CITATION STYLE
APA
Hagerup, T. (2019). Highly Succinct Dynamic Data Structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11651 LNCS, pp. 29–45). Springer Verlag. https://doi.org/10.1007/978-3-030-25027-0_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free