39 citations · 87 across the 16 of their papers we have counts for
1 paper · 1 filter
Mihai Patrascu
The rank problem in succinct data structures asks to preprocess an array A[1..n] of bits into a data structure using as close to n bits as possible, and answer queries of the form…