Succinct ordinal trees with level-ancestor queries

MaRDI QIDQ5501236zbMATH OpenFDO

Authors Richard F. Geary, Rajeev Raman, Venkatesh Raman

Publication date 3 August 2015

Mathematics Subject Classification ID

Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Succinct ordinal trees with level-ancestor queries
• Succinct ordinal trees based on tree covering
• Succinct Ordinal Trees Based on Tree Covering
• Succinct representations of ordinal trees
• Engineering the LOUDS Succinct Tree Representation

Cited in

(10)

• Tree compression with top trees
• On the succinct representation of equivalence classes
• Parallel construction of succinct trees
• Adaptive searching in succinctly encoded binary relations and tree-structured documents
• Succinct ordinal trees with level-ancestor queries
• Compressing and indexing labeled trees, with applications
• A Framework for Succinct Labeled Ordinal Trees over Large Alphabets
• Engineering the LOUDS Succinct Tree Representation
• Database Programming Languages
• A simple optimal representation for balanced parentheses

This page was built for publication: Succinct ordinal trees with level-ancestor queries

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