.png){kind=icon}
.png){kind=icon}
Return
Practical Adaptive Dynamic Bitvectors
.png){kind=icon}
PRE
AI
DOI：10.1002/spe.3433.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
While operations rank and select on static bitvectors can be supported in constant time, lower bounds show that this is impossible when supporting updates; practical implementations offer time for the operations, which is close to optimal. This is a shame in scenarios where updates are possible but uncommon.
Keywords:
adaptive dynamic data structures
compact data structures
succinct dynamic bitvectors
Journal
S
IF:
2.7
Papers:
84
Citations:
3.2K