The following pages link to (Q4449188):
Displayed 20 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Succinct representation of dynamic trees (Q541673) (← links)
- Space-efficient construction of Lempel-Ziv compressed text indexes (Q549672) (← links)
- Rank/select on dynamic compressed sequences and applications (Q732036) (← links)
- Dynamic dictionaries for multisets and counting filters with constant time operations (Q832853) (← links)
- Dynamic extended suffix arrays (Q972366) (← links)
- A compact data structure for representing a dynamic multiset (Q1675822) (← links)
- Fast and simple compact hashing via bucketing (Q2165038) (← links)
- Space-efficient B trees via load-balancing (Q2169966) (← links)
- Linked dynamic tries with applications to LZ-compression in sublinear time and space (Q2350903) (← links)
- 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)
- Succinct Representations of Ordinal Trees (Q2848982) (← links)
- Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet (Q3010401) (← links)
- (Q3304151) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- Spaces, Trees, and Colors (Q5176183) (← links)
- m-Bonsai: A Practical Compact Dynamic Trie (Q5384619) (← links)
- Dynamic dictionaries for multisets and counting filters with constant time operations (Q6103528) (← links)