- Learning Read-Once Determinants and the Principal Minor Assignment Problem (with Abhiram Aravind, Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, and Chandan Saha), Under Submission
- Matroids are Equitable (with Hannaneh Akrami and László Végh), To appear at ACM-SIAM Symposium on Discrete Algorithms (SODA) 2026
- Characterizing and Testing Principal Minor Equivalence of Matrices (with Abhranil Chatterjee, Sumanta Ghosh, and Rohit Gurjar), ACM Symposium on Theory of Computing (STOC) 2025
- Fractional Linear Matroid Matching is in quasi-NC (with Rohit Gurjar and Taihei Oki), European Symposium on Algorithms (ESA) 2024
- Border Complexity of Symbolic Determinant under Rank One Restriction (with Abhranil Chatterjee, Sumanta Ghosh, and Rohit Gurjar), Computational Complexity Conference (CCC) 2023
- A Deterministic Parallel Reduction from Weighted Matroid Intersection Search to Decision (with Sumanta Ghosh and Rohit Gurjar), ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022
Research Experience
- Postdoctoral Fellow at School of Technology and Computer Science, TIFR Mumbai, working with Mrinal Kumar
- Ph.D. student at CSE department, IIT Bombay, supervised by Rohit Gurjar
- Teaching Assistant at IIT Bombay for courses including Algorithms and Complexity, Topics in Computational Complexity, Applied Algorithms, etc.
- Teaching Assistant for NPTEL course Randomized Methods in Complexity
- Subreviewer for Foundations of Software Technology and Theoretical Computer Science (FSTTCS), 2020
Education
- Ph.D., Department of CSE, IIT Bombay, Advisor: Rohit Gurjar
- B.Tech., Computer Science and Engineering, IIT Varanasi (BHU)
Background
Research Interests: Algebraic Computational Complexity, Matroids, and Parallel Algorithms. Professional Field: Theoretical Computer Science.