A Framework for Dynamizing Succinct Data Structures
From MaRDI portal
Publication:5428836
DOI10.1007/978-3-540-73420-8_46zbMath1171.68435OpenAlexW1641328052MaRDI QIDQ5428836
Wing-Kai Hon, Rahul Shah, Ankur Gupta, Jeffrey Scott Vitter
Publication date: 28 November 2007
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1808/7230
Related Items (10)
Compressed Data Structures for Dynamic Sequences ⋮ Representation of ordered trees with a given degree distribution ⋮ Compressed property suffix trees ⋮ Succinct data structure for dynamic trees with faster queries ⋮ Succinct representation of dynamic trees ⋮ Dynamic rank/select structures with applications to run-length encoded texts ⋮ Rank/select on dynamic compressed sequences and applications ⋮ Unnamed Item ⋮ Improved Space Efficient Algorithms for BFS, DFS and Applications ⋮ Space efficient linear time algorithms for BFS, DFS and applications
This page was built for publication: A Framework for Dynamizing Succinct Data Structures
