Why it matters
Succinct bitvector enables compact indexes. Understanding shapes theory.
Advertisement
The architecture
Store bitvector + small index for rank + select.
o(n) overhead.
O(1) rank + select.
Advertisement
How it works end to end
Jacobson 1989.
o(n) space overhead.
Constant-time rank + select.
Foundation for succinct DS.