| 2025 | STOC | Primes via Zeros: Interactive Proofs for Testing Primality of Natural Classes of Ideals. | Abhibhav Garg, Rafael Oliveira, Nitin Saxena |
| 2024 | STOC | Learning the Coefficients: A Presentable Version of Border Complexity and Applications to Circuit Factoring. | C. S. Bhargav, Prateek Dwivedi, Nitin Saxena |
| 2024 | TAMC | Lower Bounds for the Sum of Small-Size Algebraic Branching Programs. | C. S. Bhargav, Prateek Dwivedi, Nitin Saxena |
| 2023 | INDOCRYPT | VDOO: A Short, Fast, Post-quantum Multivariate Digital Signature Scheme. | Anindya Ganguly, Angshuman Karmakar, Nitin Saxena |
| 2023 | ISSAC | An effective description of the roots of bivariates mod pk and the related Igusa's local zeta function. | Sayak Chakrabarti, Nitin Saxena |
| 2022 | FOCS | Separated borders: Exponential-gap fanin-hierarchy theorem for approximative depth-3 circuits. | Pranjal Dutta, Nitin Saxena |
| 2022 | MFCS | Improved Lower Bound, and Proof Barrier, for Constant Depth Algebraic Circuits. | C. S. Bhargav, Sagnik Dutta, Nitin Saxena |
| 2021 | FOCS | Demystifying the border of depth-3 algebraic circuits. | Pranjal Dutta, Prateek Dwivedi, Nitin Saxena |
| 2020 | ISSAC | Special-case algorithms for blackbox radical membership, nullstellensatz and transcendence degree. | Abhibhav Garg, Nitin Saxena |
| 2019 | ISSAC | Efficiently Factoring Polynomials Modulo p4. | Ashish Dwivedi, Rajat Mittal, Nitin Saxena |
| 2018 | ICALP | Towards Blackbox Identity Testing of Log-Variate Circuits. | Michael A. Forbes, Sumanta Ghosh, Nitin Saxena |
| 2018 | STOC | Bootstrapping variables in algebraic circuits. | Manindra Agrawal, Sumanta Ghosh, Nitin Saxena |
| 2018 | STOC | Discovering the roots: uniform closure results for algebraic classes under factoring. | Pranjal Dutta, Nitin Saxena, Amit Sinhababu |
| 2017 | ISSAC | Irreducibility and Deterministic r-th Root Finding over Finite Fields. | Vishwas Bhargava, Gbor Ivanyos, Rajat Mittal, Nitin Saxena |
| 2016 | MFCS | Integer Factoring Using Small Algebraic Dependencies. | Manindra Agrawal, Nitin Saxena, Shubham Sahai Srivastava |
| 2016 | MFCS | Algebraic Independence over Positive Characteristic: New Criterion and Applications to Locally Low Algebraic Rank Circuits. | Anurag Pandey, Nitin Saxena, Amit Sinhababu |
| 2015 | CEC | Dynamic-PSO: An improved particle swarm Optimizer. | Nitin Saxena, Ashish Tripathi, K. K. Mishra, Arun Kumar Misra |
| 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 |
| 2011 | ICALP | Algebraic Independence and Blackbox Identity Testing. | Malte Beecken, Johannes Mittmann, Nitin Saxena |
| 2011 | STOC | Blackbox identity testing for bounded top fanin depth-3 circuits: the field doesn't matter. | Nitin Saxena, C. Seshadhri |
| 2010 | FOCS | From Sylvester-Gallai Configurations to Rank Bounds: Improved Black-Box Identity Test for Depth-3 Circuits. | Nitin Saxena, C. Seshadhri |
| 2009 | ISSAC | Schemes for deterministic polynomial factoring. | Gbor Ivanyos, Marek Karpinski, Nitin Saxena |
| 2008 | ICALP | Diagonal Circuit Identity Testing and Lower Bounds. | Nitin Saxena |
| 2006 | STACS | Equivalence of F-Algebras and Cubic Forms. | Manindra Agrawal, Nitin Saxena |
| 2005 | STACS | Automorphisms of Finite Rings and Applications to Complexity of Problems. | Manindra Agrawal, Nitin Saxena |