The following pages link to Succinct Trees in Practice (Q5233599):
Displaying 20 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Simultaneous encodings for range and next/previous larger/smaller value queries (Q344773) (← links)
- Simple and efficient fully-functional succinct trees (Q507389) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Constant delay traversal of grammar-compressed graphs with bounded rank (Q776844) (← links)
- Practical compressed suffix trees (Q1736557) (← links)
- One-stage tree: end-to-end tree builder and pruner (Q2163237) (← links)
- Efficient computation of spatial queries over points stored in \(k^2\)-tree compact data structures (Q2235767) (← links)
- Lempel-Ziv compressed structures for document retrieval (Q2272976) (← links)
- On succinct representations of binary trees (Q2363992) (← links)
- Grammar compressed sequences with rank/select support (Q2397151) (← links)
- Improved range minimum queries (Q2397152) (← links)
- Parallel construction of succinct trees (Q2410360) (← links)
- GLOUDS: representing tree-like graphs (Q2634715) (← links)
- Succinct encoding of binary strings representing triangulations (Q2665909) (← links)
- Fast compressed tries through path decompositions (Q2828185) (← links)
- General document retrieval in compact space (Q2828189) (← links)
- Dualities in tree representations (Q5140782) (← links)
- Faster Compressed Suffix Trees for Repetitive Collections (Q5266617) (← links)
- Practical Compact Indexes for Top-<i>k</i>Document Retrieval (Q5270942) (← links)