The following pages link to (Q2768345):
Displaying 12 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Succinct representation of dynamic trees (Q541673) (← links)
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- Succinct representations of planar maps (Q959810) (← links)
- Succinct data structure for dynamic trees with faster queries (Q2420610) (← links)
- A uniform paradigm to succinctly encode various families of trees (Q2441590) (← links)
- Representation of ordered trees with a given degree distribution (Q2656174) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet (Q3010401) (← links)
- A Uniform Approach Towards Succinct Representation of Trees (Q3512457) (← links)
- m-Bonsai: A Practical Compact Dynamic Trie (Q5384619) (← links)
