Rajat De

Orcid: 0009-0005-2429-7376

According to our database1, Rajat De authored at least 3 papers between 2024 and 2026.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

On csauthors.net:

Bibliography

2026
Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings.
Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms, 2026

2025
Word Break on SLP-Compressed Texts.
Proceedings of the Data Compression Conference, 2025

2024
Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024


  Loading...