The following pages link to (Q3484345):
Displaying 7 items.
- On some deterministic dictionaries supporting sparsity (Q734953) (← links)
- Bounded ordered dictionaries in O(log log N) time and O(n) space (Q915434) (← links)
- Bounded size dictionary compression: SC\(^{k}\)-completeness and NC algorithms. (Q1401920) (← links)
- A dynamic dictionary for priced information with application (Q2492633) (← links)
- Dynamic Trees with Almost-Optimal Access Cost (Q5009598) (← links)
- Binary search trees: How low can you go? (Q5054833) (← links)
- Fast updating of well-balanced trees (Q5056096) (← links)