I am a Post-Doctoral Researcher at the Center for Quantum and Topological Systems (CQTS) at New York University in Abu Dhabi. Prior to this, I completed my PhD in Theoretical Computer Science at the Indian Institute of Science (IISc) and my Bachelor’s degree in Computer Science at the Indian Institute of Technology, Delhi (IITD).
If you think you are working on a problem that I might find interesting, do not hesitate to reach out to me to chat about it at: r.gajjala@nyu.edu!
LinkedIn 
Twitter 
DBLP 
Google Scholar
Publications
Remark: Author names are in alphabetical ordering (unless they are not). For theory work/venues, it is often standard practice to list authors by alphabetical ordering of last names.Graphs + Quantum
- No distributed quantum advantage for approximate graph coloring
with Xavier Coiteux-Roy, Francesco d'Amore, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid and Jukka Suomela
ACM Symposium on Theory of Computing (STOC 2024) - Graph-theoretic insights on the constructability of complex entangled states
with L. Sunil Chandran
Quantum Journal (Quantum 2024) - Graph reduction approach to Krenn-Gu conjecture
with L. Sunil Chandran and Abraham M. Illickan
International Symposium on Mathematical Foundations of Computer Science (MFCS 2024) - Perfect Matchings and Quantum Physics: Progress on Krenn’s Conjecture
with L. Sunil Chandran
(Preprint) (arXiv:2202.05562)
In revision at The Electronic Journal of Combinatorics 📜 Quantum-Graph Best-Paper Award
Combinatorics + Model Counting
- CNFs and DNFs with exactly _n_ solutions
with L. Sunil Chandran and Kuldeep Meel
In Review.
Approximation Algorithms
- Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones
with L. Sunil Chandran, Shravan Mehra, Saladi Rahul
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2024) - Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings
with Shashwat Banchhor, Yogish Sabharwal and Sandeep Sen
Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)
Discrete Geometry
- Improved upper bounds for the Heilbronn’s Problem for k-gons
with Jayanth Ravi
Canadian Conference on Computational Geometry (CCCG 2024)
Learning Theory
- Learning Sparse Fixed-Structure Gaussian Bayesian Networks
with Arnab Bhattacharyya, Davin Choo, Sutanu Gayen and Yuhao Wang
International Conference on Artificial Intelligence and Statistics (AISTATS 2022)
Deep Learning
- Huffman Coding Based Encoding Techniques for Fast Distributed Deep Learning
with Shashwat Banchhor, Ahmed Sayed, Aritra Dutta, Marco Canini, Panos Kalnis
CoNEXT Distributed ML Workshop (DistributedML 2020)
Talks
- Krenn-Gu conjecture for sparse graphs
Mathematical Foundations of Computer Science (MFCS), Slovakia [Slides] - A combinatorial problem from weighted model counting
Helsinki CS Theory Seminar
Algorithmic Graph Theory seminar series - No distributed quantum advantage for approximate graph coloring
EECS Research Symposium — Winner of Best Presentation Award - Designing quantum experiments via Graph Theory
PMRF Research Symposium — Winner of Best Poster Award
IISc–MSR Theory Seminar
Algorithmic Graph Theory seminar series
Quantum Colloquium @ NYU Abu Dhabi
Service
- Reviewer: ICALP ’23, NeurIPS ’23, ICML ’24, IWOCA ’24, FOCS ’24, SODA ’25 and NeurIPS ’25
- Teaching Assistant: Graph Theory (Fall 2023 at IISc Bengaluru), Design & Analysis of Algorithms (Autumn 2021 at IISc Bengaluru), and Introduction to Parallel Programming (Autumn 2019 at IIT Delhi)
- Mentoring: Abraham M. Illickan (MFCS 2024, IIT Palakkad → UC Irvine), Jayanth Ravi (CCCG 2024, IIT Delhi) and Shravan Mehra (FSTTCS 2024, IISc Bangalore → Univ. of Birmingham)