| 2026 | STOC | Learning Read-Once Determinants and the Principal Minor Assignment Problem. | Abhiram Aravind, Abhranil Chatterjee, Sumanta Ghosh, Rohit Gurjar, Roshan Raj, Chandan Saha |
| 2024 | ICALP | NP-Hardness of Testing Equivalence to Sparse Polynomials and to Constant-Support Polynomials. | Omkar Baraskar, Agrim Dewan, Chandan Saha, Pulkit Sinha |
| 2024 | STACS | Testing Equivalence to Design Polynomials. | Omkar Baraskar, Agrim Dewan, Chandan Saha |
| 2023 | ICALP | Low-Depth Arithmetic Circuit Lower Bounds: Bypassing Set-Multilinearization. | Prashanth Amireddy, Ankit Garg, Neeraj Kayal, Chandan Saha, Bhargav Thankey |
| 2023 | SODA | Equivalence Test for Read-Once Arithmetic Formulas. | Nikhil Gupta, Chandan Saha, Bhargav Thankey |
| 2020 | FOCS | Learning sums of powers of low-degree polynomials in the non-degenerate case. | Ankit Garg, Neeraj Kayal, Chandan Saha |
| 2020 | MFCS | Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests. | Janaky Murthy, Vineet Nair, Chandan Saha |
| 2019 | ICALP | Determinant Equivalence Test over Finite Fields and over Q. | Ankit Garg, Nikhil Gupta, Neeraj Kayal, Chandan Saha |
| 2019 | MFCS | On the Symmetries of and Equivalence Test for Design Polynomials. | Nikhil Gupta, Chandan Saha |
| 2019 | STOC | Reconstruction of non-degenerate homogeneous depth three circuits. | Neeraj Kayal, Chandan Saha |
| 2016 | ICALP | An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits. | Neeraj Kayal, Chandan Saha, Sbastien Tavenas |
| 2016 | STOC | On the size of homogeneous and of depth four formulas with low individual degree. | Neeraj Kayal, Chandan Saha, Sbastien Tavenas |
| 2016 | STACS | Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits. | Neeraj Kayal, Vineet Nair, Chandan Saha |
| 2015 | ICALP | Lower Bounds for Sums of Powers of Low Degree Univariates. | Neeraj Kayal, Pascal Koiran, Timothe Pecatte, Chandan Saha |
| 2015 | STACS | Multi-k-ic Depth Three Circuit Lower Bound. | Neeraj Kayal, Chandan Saha |
| 2014 | FOCS | An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas. | Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan |
| 2014 | STOC | Super-polynomial lower bounds for depth-4 homogeneous arithmetic formulas. | Neeraj Kayal, Nutan Limaye, Chandan Saha, Srikanth Srinivasan |
| 2014 | STOC | A super-polynomial lower bound for regular arithmetic formulas. | Neeraj Kayal, Chandan Saha, Ramprasad Saptharishi |
| 2013 | STOC | Quasi-polynomial hitting-set for set-depth-Δ formulas. | Manindra Agrawal, Chandan Saha, Nitin Saxena |
| 2012 | STOC | Jacobian hits circuits: hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. | Manindra Agrawal, Chandan Saha, Ramprasad Saptharishi, Nitin Saxena |
| 2008 | STOC | Fast integer multiplication using modular arithmetic. | Anindya De, Piyush P. Kurur, Chandan Saha, Ramprasad Saptharishi |
| 2008 | STACS | Factoring Polynomials over Finite Fields using Balance Test. | Chandan Saha |
| 2006 | SODA | Simpler algorithm for estimating frequency moments of data streams. | Lakshminath Bhuvanagiri, Sumit Ganguly, Deepanjan Kesh, Chandan Saha |