A Framework for Dynamizing Succinct Data Structures
From MaRDI portal
Recommendations
Cited in
(17)- Space efficient linear time algorithms for BFS, DFS and applications
- Preface -- Compact data structures
- Succinct data structure for dynamic trees with faster queries
- Representation of ordered trees with a given degree distribution
- Improved space efficient algorithms for BFS, DFS and applications
- scientific article; zbMATH DE number 3852432 (Why is no real title available?)
- Compressed Data Structures for Dynamic Sequences
- Compressed property suffix trees
- scientific article; zbMATH DE number 37729 (Why is no real title available?)
- A framework of dynamic data structures for string processing
- scientific article; zbMATH DE number 1830754 (Why is no real title available?)
- Extra space during initialization of succinct data structures and dynamical initializable arrays
- Succinct dynamic one-dimensional point reporting
- A general framework for dynamic succinct and compressed data structures
- Succinct representation of dynamic trees
- Dynamic rank/select structures with applications to run-length encoded texts
- Rank/select on dynamic compressed sequences and applications
This page was built for publication: A Framework for Dynamizing Succinct Data Structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5428836)
