19 citations · 31 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2011
Optimal Indexes for Sparse Bit Vectors
Alexander Golynski, Alessio Orlandi, Rajeev Raman +1
We consider the problem of supporting Rank() and Select() operations on a bit vector of length m with n 1 bits. The problem is considered in the succinct index model, where the bit…
cs.DS2010★ 19 cited
Optimal Trade-Off for Succinct String Indexes
Roberto Grossi, Alessio Orlandi, Rajeev Raman
Let s be a string whose symbols are solely available through access(i), a read-only operation that probes s and returns the symbol at position i in s. Many compressed data structur…
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…