Succinct data structures\ \dots potential for symbolic computation?

DOI10.1145/2930889.2930944MaRDI QIDQ2985800zbMATH OpenOpenAlexWikidataFDO

Authors J. Ian Munro

Publication date 10 May 2017

Published in Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2930889.2930944

zbMATH Keywords

data structuresspace efficiencysuccinct data structures

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Combinatorics in computer science (68R05) Symbolic computation and algebraic computation (68W30)

Recommendations

• Succinct representations of ordinal trees
• Fully-functional succinct trees
• Simple and efficient fully-functional succinct trees
• Succinct representations of trees
• Fully functional static and dynamic succinct trees

Cited in

(3)

• Highly succinct dynamic data structures
• Encoding data structures
• Proving tree algorithms for succinct data structures

This page was built for publication: Succinct data structures\ \dots potential for symbolic computation?

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