Succinct Trees in Practice
From MaRDI portal
Recommendations
- Fully-functional succinct trees
- Succinct representations of trees
- A Uniform Approach Towards Succinct Representation of Trees
- Fully functional static and dynamic succinct trees
- On succinct representations of binary trees
- Succinct representation of dynamic trees
- Parallel construction of succinct trees
Cited in
(23)- Succinct dynamic cardinal trees
- Practical compressed suffix trees
- Space-efficient construction of Lempel-Ziv compressed text indexes
- Grammar compressed sequences with rank/select support
- Dualities in tree representations
- A practical succinct data structure for tree-like graphs
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures
- Succinct representations of trees
- GLOUDS: representing tree-like graphs
- Practical compact indexes for top-k document retrieval
- Parallel construction of succinct trees
- Engineering the LOUDS Succinct Tree Representation
- One-stage tree: end-to-end tree builder and pruner
- Lempel-Ziv compressed structures for document retrieval
- Succinct encoding of binary strings representing triangulations
- A simple representation of tree covering utilizing balanced parentheses and efficient implementation of average-case optimal RMQs
- Constant delay traversal of grammar-compressed graphs with bounded rank
- General document retrieval in compact space
- Fast compressed tries through path decompositions
- On succinct representations of binary trees
- Simple and efficient fully-functional succinct trees
- Faster compressed suffix trees for repetitive collections
- Improved range minimum queries
This page was built for publication: Succinct Trees in Practice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233599)
