About Me
I am a PhD student in the Department of Computer Science at Stony Brook University. I am advised by professor Dominik Kempa. Prior to starting my PhD, I did my undergrad and masters at Chennai Mathematical Institute . I am interested in theoretical computer science and my research thus far has focused on string algorithms and fine grained complexity.
News
- August 2026: Looking for a postdoc position in theoretical cs starting in fall 2027, feel free to reach out if your lab has any openings.
- June 2026: Paper titled "Frequency-Related Queries on Compressed Strings" will appear in ESA 2026
- May 2026: I will be giving a talk at DIMACS Workshop on Fine-Grained Complexity of String Problems in late July
Selected publications
See the full list of papers here.
ESA 2026: Rajat De and Dominik Kempa: Hardness of Frequency-Related Queries on Compressed Strings.
SODA 2026: Rajat De and Dominik Kempa: Optimal Random Access and Conditional Lower Bounds for 2D Compressed Strings.
DCC 2025: Rajat De and Dominik Kempa: Word Break on SLP-Compressed Texts.
SODA 2024: Rajat De and Dominik Kempa: Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data.
Talks
- Recent results in compressed computation: at DIMACS Workshop on Fine-Grained Complexity of String Problems, 2026
- Discrete Mathematics and Combinatorics: at CMI, 2018
Awards
2022
Chairman's fellowship
2019
World Finalist at ACM ICPC
2017
World Finalist at ACM ICPC
2016
Silver medal at International Olympiad in Informatics
Services
Teaching Assistant
Stony Brook University: Spring 2023-Computational Biology, Fall 2022-Foundations of Computer Science
Chennai Mathematical Institute: Spring 2021-Programming and Data structures with python, Spring 2019-Algorithms,Spring 2018-Discrete Math
NPTEL: Fall 2018-Algorithms,Spring 2019-Algorithms
Reviewer
SODA 2027,STACS 2026