Simple and efficient fully-functional succinct trees

DOI10.1016/j.tcs.2016.04.031zbMath1357.68043arXiv1601.06939OpenAlexW2265899429MaRDI QIDQ507389

Joshimar Cordova, Gonzalo Navarro

Publication date: 6 February 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.06939

zbMATH Keywords

succinct data structuresordinal trees

Mathematics Subject Classification ID

Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Ultra-succinct representation of ordered trees with applications
• Succinct representations of permutations and functions
• The level ancestor problem simplified
• Representing trees of higher degree
• A simple optimal representation for balanced parentheses
• Surpassing the information theoretic bound with fusion trees
• Succinct Representation of Balanced Parentheses and Static Trees
• Fully Functional Static and Dynamic Succinct Trees
• Succinct ordinal trees with level-ancestor queries
• Balanced parentheses strike back
• Practical Entropy-Compressed Rank/Select Dictionary
• Succinct Trees in Practice
• Orderly Spanning Trees with Applications

This page was built for publication: Simple and efficient fully-functional succinct trees