The following pages link to (Q4778577):
Displayed 17 items.
- Succinct dynamic cardinal trees (Q262263) (← links)
- Compressed property suffix trees (Q386003) (← links)
- Space efficient data structures for dynamic orthogonal range counting (Q390134) (← links)
- Succinct representations of permutations and functions (Q441860) (← links)
- Succinct data structures for searchable partial sums with optimal worst-case performance (Q719256) (← links)
- Dynamic rank/select structures with applications to run-length encoded texts (Q732034) (← links)
- Dynamic relative compression, dynamic partial sums, and substring concatenation (Q1755738) (← links)
- Determining membership with 2 simultaneous queries (Q2250448) (← links)
- Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- Rank and select revisited and extended (Q2465064) (← links)
- Opportunistic data structures for range queries (Q2498981) (← links)
- Fully Functional Static and Dynamic Succinct Trees (Q2799480) (← links)
- Succinct and Implicit Data Structures for Computational Geometry (Q2848977) (← links)
- A Survey of Data Structures in the Bitprobe Model (Q2848981) (← links)
- Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet (Q3010401) (← links)
- m-Bonsai: A Practical Compact Dynamic Trie (Q5384619) (← links)