375 citations · 440 across the 15 of their papers we have counts for
Showing 2010 · cs.DSShow all
2 papers · 2 filters
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.DS2010
Random Access to Grammar Compressed Strings
Philip Bille, Gad M. Landau, Rajeev Raman +3
Grammar based compression, where one replaces a long string by a small context-free grammar that generates the string, is a simple and powerful paradigm that captures many popular…