2 citations · 2 across the 4 of their papers we have counts for
4 papers
Hardness of Frequency-Related Queries on Compressed Strings
Rajat De, Dominik Kempa
Compressed indexing aims to support fundamental string queries in space proportional to compressed input size. For grammar compression, a length- string represented…
Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings
Rajat De, Dominik Kempa
Compressed indexing is a powerful technique that enables efficient querying over data stored in compressed form, significantly reducing memory usage and often accelerating computat…
Word Break on SLP-Compressed Texts
Rajat De, Dominik Kempa
Word Break is a prototypical factorization problem in string processing: Given a word of length and a dictionary of strings,…
Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data
Rajat De, Dominik Kempa
Grammar compression is a general compression framework in which a string of length is represented as a context-free grammar of size whose language contains only . In…