Rajat De

activity

20232026

most citedGrammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data

2 citations · 2 across the 4 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

cs.DS2025

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…

cs.DS2025

Word Break on SLP-Compressed Texts

Rajat De, Dominik Kempa

Word Break is a prototypical factorization problem in string processing: Given a word $w$ of length $N$ and a dictionary $D = {d_{1}, d_{2}, \dots, d_{K}}$ of $K$ strings,…