Succinct dynamic data structures
From MaRDI portal
Recommendations
- Highly succinct dynamic data structures
- A Framework for Dynamizing Succinct Data Structures
- scientific article; zbMATH DE number 1418448
- On the dynamization of data structures
- The design of dynamic data structures
- A general framework for dynamic succinct and compressed data structures
- Succinct data structure for dynamic trees with faster queries
- scientific article; zbMATH DE number 2038723
- Dynamic data structures for a direct search algorithm
Cited in
(56)- Efficient management of dynamic tables
- A compact data structure for representing a dynamic multiset
- Dynamic relative compression, dynamic partial sums, and substring concatenation
- Approximate query processing over static sets and sliding windows
- Fast algorithms for the rooted triplet distance between caterpillars
- In-place initializable arrays
- Compressed dynamic range majority and minority data structures
- Determining membership with 2 simultaneous queries
- Highly succinct dynamic data structures
- Space efficient linear time algorithms for BFS, DFS and applications
- The cell probe complexity of succinct data structures
- Canonical density control
- Rank and select revisited and extended
- Opportunistic data structures for range queries
- Succinct dynamic cardinal trees
- Fully functional static and dynamic succinct trees
- Succinct and Implicit Data Structures for Computational Geometry
- A Survey of Data Structures in the Bitprobe Model
- Changing base without losing space
- Succinct dynamic cardinal trees with constant time operations for small alphabet
- scientific article; zbMATH DE number 2185599 (Why is no real title available?)
- scientific article; zbMATH DE number 437539 (Why is no real title available?)
- On the Complexity of Maintaining Partial Sums
- Compressed property suffix trees
- Space efficient data structures for dynamic orthogonal range counting
- Succinct representations of permutations and functions
- scientific article; zbMATH DE number 2038723 (Why is no real title available?)
- scientific article; zbMATH DE number 4113964 (Why is no real title available?)
- Data Structures for Traveling Salesmen
- Extra space during initialization of succinct data structures and dynamical initializable arrays
- Approximate query processing over static sets and sliding windows
- Dynamic Elias-Fano representation
- Fast dynamic arrays
- Succinct dynamic one-dimensional point reporting
- Succinct color searching in one dimension
- On-the-fly array initialization in less space
- Succinct partial sums and Fenwick trees
- Algorithms and Computation
- A general framework for dynamic succinct and compressed data structures
- Compact dynamic rewritable (CDRW) arrays
- m-Bonsai: a practical compact dynamic trie
- Cell-probe lower bounds for succinct partial sums
- A Framework for Dynamizing Succinct Data Structures
- Compressed Prefix Sums
- Proving tree algorithms for succinct data structures
- Partial sums on the ultra-wide word RAM
- scientific article; zbMATH DE number 7765406 (Why is no real title available?)
- Random access in persistent strings and segment selection
- Adaptive succinctness
- Optimal resizable arrays
- Space-efficient B trees via load-balancing
- (Worst-case) optimal adaptive dynamic bitvectors
- Succinct data structures for searchable partial sums with optimal worst-case performance
- Dynamic rank/select structures with applications to run-length encoded texts
- Optimal static fully indexable dictionaries
- Dynamic deferred data structuring
This page was built for publication: Succinct dynamic data structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4778577)
