12 citations · 13 across the 2 of their papers we have counts for
2 papers
cs.DS2009★ 12 cited
More Haste, Less Waste: Lowering the Redundancy in Fully Indexable Dictionaries
Roberto Grossi, Alessio Orlandi, Rajeev Raman +1
We consider the problem of representing, in a compressed format, a bit-vector of bits with 1s, supporting the following operations, where : $rank_b(S,i…
cs.DS2009★ 1 cited
Optimal cache-aware suffix selection
Gianni Franceschini, Roberto Grossi, S. Muthukrishnan
Given string and integer , the {\em suffix selection} problem is to determine the th lexicographically smallest amongst the suffixes , .…