(Worst-case) optimal adaptive dynamic bitvectors

DOI10.1007/S00224-025-10229-8MaRDI QIDQ6940313zbMATH OpenFDO

Authors Gonzalo Navarro

Publication date 19 August 2025

Published in Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00224-025-10229-8

zbMATH Keywords

adaptive dynamic data structuressuccinct dynamic bitvectors

Mathematics Subject Classification ID

Data structures (68P05)

Cites work

• Algorithms and Computation
• An implicit data structure supporting insertion, deletion, and search in O( ^ 2\,n) time
• Combinatorial Pattern Matching
• Compact representations of ordered sets
• Compressed Data Structures for Dynamic Sequences
• Compressed data structures: Dictionaries and data-aware measures
• Compressed indexes for dynamic text collections
• Dynamic entropy-compressed sequences and full-text indexes
• Efficient Storage and Retrieval by Content and Address of Static Files
• Fully functional static and dynamic succinct trees
• scientific article; zbMATH DE number 140457 (Why is no real title available?)
• scientific article; zbMATH DE number 2079421 (Why is no real title available?)
• scientific article; zbMATH DE number 1830754 (Why is no real title available?)
• scientific article; zbMATH DE number 5170141 (Why is no real title available?)
• Indexing compressed text
• Logarithmic Lower Bounds in the Cell-Probe Model
• Optimal Lower Bounds for Rank and Select Indexes
• Parametrized complexity theory.
• Practical entropy-compressed rank/select dictionary
• Representing trees of higher degree
• Self-adjusting binary search trees
• Succinct indexable dictionaries with applications to encoding \(k\)-ary trees, prefix sums and multisets
• Succinct representation of balanced parentheses and static trees
• Tables
• Wavelet trees for all

This page was built for publication: (Worst-case) optimal adaptive dynamic bitvectors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6940313)