| 2018 | STOC | Bootstrapping variables in algebraic circuits. | Manindra Agrawal, Sumanta Ghosh, Nitin Saxena |
| 2016 | MFCS | Integer Factoring Using Small Algebraic Dependencies. | Manindra Agrawal, Nitin Saxena, Shubham Sahai Srivastava |
| 2014 | TAMC | A Roadmap for TAMC. | T. V. Gopal, Manindra Agrawal, Angsheng Li, S. Barry Cooper |
| 2013 | STOC | Quasi-polynomial hitting-set for set-depth-Δ formulas. | Manindra Agrawal, Chandan Saha, Nitin Saxena |
| 2012 | ACISP | On the Optimality of Lattices for the Coppersmith Technique. | Yoshinori Aono, Manindra Agrawal, Takakazu Satoh, Osamu Watanabe |
| 2012 | LICS | Approximate Verification of the Symbolic Dynamics of Markov Chains. | Manindra Agrawal, S. Akshay, Blaise Genest, P. S. Thiagarajan |
| 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 | CSR | On the Arithmetic Complexity of Euler Function. | Manindra Agrawal |
| 2008 | FOCS | Arithmetic Circuits: A Chasm at Depth Four. | Manindra Agrawal, V. Vinay |
| 2007 | STACS | The Polynomially Bounded Perfect Matching Problem Is in NC | Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf |
| 2006 | ICDCN | Primality Tests Based on Fermat's Little Theorem. | Manindra Agrawal |
| 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 |
| 1999 | FOCS | Primality and Identity Testing via Chinese Remaindering. | Manindra Agrawal, Somenath Biswas |
| 1997 | STOC | Reducing the Complexity of Reductions. | Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich |
| 1996 | FOCS | The Boolean Isomorphism Problem. | Manindra Agrawal, Thomas Thierauf |