The following pages link to Succinct dynamic cardinal trees (Q262263):
Displaying 8 items.
- Succinct data structure for dynamic trees with faster queries (Q2420610) (← links)
- Representation of ordered trees with a given degree distribution (Q2656174) (← links)
- Fully functional static and dynamic succinct trees (Q2799480) (← links)
- Engineering Practical Lempel-Ziv Tries (Q5102060) (← links)
- LZ78 Compression in Low Main Memory Space (Q5150917) (← links)
- m-Bonsai: A Practical Compact Dynamic Trie (Q5384619) (← links)
- Dynamic Path-decomposed Tries (Q6039927) (← links)
- Faster dynamic compressed \(d\)-ary relations (Q6536269) (← links)