Pages that link to "Item:Q2768345"
From MaRDI portal
The following pages link to Representing dynamic binary trees succinctly (Q2768345):
Displaying 18 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Simple and efficient fully-functional succinct trees (Q507389) (← 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)
- Compact searchable static binary trees (Q1029045) (← links)
- A new representation of binary search trees (Q1310968) (← links)
- On succinct representations of binary trees (Q2363992) (← 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)
- A practical succinct dynamic graph representation (Q2672244) (← links)
- Succinct representation of balanced parentheses and static trees (Q2784479) (← 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)