NP-hard Sets and Creativeness over Constant Time Languages. - Manindra Agrawal (FSTTCS, 1991)

Universal Relations. - Manindra Agrawal; Somenath Biswas (SCT, 1992)

Polynomial Isomorphism of 1-L-Complete Sets. - Manindra Agrawal; Somenath Biswas (SCT, 1993)

On the Isomorphism Problem for Weak Reducibilities. - Manindra Agrawal (SCT, 1994)

Polynomial Time Truth-Table Reductions to P-Selective Sets. - Manindra Agrawal; Vikraman Arvind (SCT, 1994)

DSPACE(n)=?NSPACE(n): A Degree Theoretic Characterization. - Manindra Agrawal (SCT, 1995)

Reductions of Self-Reducible Sets to Depth-1 Weighted Threshold Circuit Classes, and Sparse Sets. - Manindra Agrawal; Vikraman Arvind (SCT, 1995)

Pinpointing Computation with Modular Queries in the Boolean Hierarchy. - Manindra Agrawal; Richard Beigel; Thomas Thierauf (FSTTCS, 1996)

Modulo Information from Nonadaptive Queries to NP - Manindra Agrawal; Richard Beigel; Thomas Thierauf (Electron. Colloquium Comput. Complex., 1996)

An Isomorphism Theorem for Circuit Complexity - Manindra Agrawal; Eric Allender (Electron. Colloquium Comput. Complex., 1996)

The Boolean Isomorphism Problem - Manindra Agrawal; Thomas Thierauf (Electron. Colloquium Comput. Complex., 1996)

A Note on Decision versus Search for Graph Automorphism. - Manindra Agrawal; Vikraman Arvind (Inf. Comput., 1996)

On the Isomorphism Conjecture for 2-DFA Reductions. - Manindra Agrawal; Srinivasan Venkatesh 001 (Int. J. Found. Comput. Sci., 1996)

On the Isomorphism Conjecture for Weak Reducibilities. - Manindra Agrawal (J. Comput. Syst. Sci., 1996)

Polynomial-Time Isomorphism of 1-L-Complete Sets. - Manindra Agrawal; Somenath Biswas (J. Comput. Syst. Sci., 1996)

NP-Creative Sets: A New Class of Creative Sets in NP. - Manindra Agrawal; Somenath Biswas (Math. Syst. Theory, 1996)

Geometric Sets of Low Information Content. - Manindra Agrawal; Vikraman Arvind (Theor. Comput. Sci., 1996)

Quasi-Linear Truth-Table Reductions to p-Selective Sets. - Manindra Agrawal; Vikraman Arvind (Theor. Comput. Sci., 1996)

The Satisfiability Problem for Probabilistic Ordered Branching Programs - Manindra Agrawal; Thomas Thierauf (Electron. Colloquium Comput. Complex., 1997)

DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization. - Manindra Agrawal (J. Comput. Syst. Sci., 1997)

Characterizing Small Depth and Small Space Classes by Operators of Higher Types - Manindra Agrawal; Eric Allender; Samir Datta; Heribert Vollmer; Klaus W. Wagner (Electron. Colloquium Comput. Complex., 1998)

Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem. - Manindra Agrawal; Eric Allender; Steven Rudich (J. Comput. Syst. Sci., 1998)

Reducing Randomness via Chinese Remaindering - Manindra Agrawal; Somenath Biswas (Electron. Colloquium Comput. Complex., 1999)

Characterizing Small Depth and Small Space Classes by Operators of Higher Type. - Manindra Agrawal; Eric Allender; Samir Datta; Heribert Vollmer; Klaus W. Wagner (Chic. J. Theor. Comput. Sci., 2000)

On TC0, AC0, and Arithmetic Circuits. - Manindra Agrawal; Eric Allender; Samir Datta (J. Comput. Syst. Sci., 2000)

The Formula Isomorphism Problem. - Manindra Agrawal; Thomas Thierauf (SIAM J. Comput., 2000)

Towards Uniform AC0 - Isomorphisms. - Manindra Agrawal (CCC, 2001)

Hard Sets and Pseudo-random Generators for Constant Depth Circuits. - Manindra Agrawal (FSTTCS, 2001)

The First-Order Isomorphism Theorem. - Manindra Agrawal (FSTTCS, 2001)

Reducing the complexity of reductions. - Manindra Agrawal; Eric Allender; Russell Impagliazzo; Toniann Pitassi; Steven Rudich (Comput. Complex., 2001)

Pseudo-Random Generators and Structure of Complete Degrees. - Manindra Agrawal (CCC, 2002)

For completeness, sublogarithmic space is no space. - Manindra Agrawal (Inf. Process. Lett., 2002)

On Derandomizing Tests for Certain Polynomial Identities. - Manindra Agrawal (CCC, 2003)

Primality and identity testing via Chinese remaindering. - Manindra Agrawal; Somenath Biswas (J. ACM, 2003)

Lazy Rectangular Hybrid Automata. - Manindra Agrawal; P. S. Thiagarajan (HSCC, 2004)

Proving Lower Bounds Via Pseudo-random Generators. - Manindra Agrawal (FSTTCS, 2005)

The Discrete Time Behavior of Lazy Linear Hybrid Automata. - Manindra Agrawal; P. S. Thiagarajan (HSCC, 2005)

Automorphisms of Finite Rings and Applications to Complexity of Problems. - Manindra Agrawal; Nitin Saxena 001 (STACS, 2005)

Behavioural Approximations for Restricted Linear Differential Hybrid Automata. - Manindra Agrawal; Frank Stephan 001; P. S. Thiagarajan; Shaofa Yang (HSCC, 2006)

Primality Tests Based on Fermat's Little Theorem. - Manindra Agrawal (ICDCN, 2006)

Equivalence of F-Algebras and Cubic Forms. - Manindra Agrawal; Nitin Saxena 001 (STACS, 2006)

The polynomially bounded perfect matching problem is in NC^2. - Manindra Agrawal; Thanh Minh Hoang; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2006)

07411 Executive Summary – Algebraic Methods in Computational Complexity. - Manindra Agrawal; Harry Buhrman; Lance Fortnow; Thomas Thierauf (Algebraic Methods in Computational Complexity, 2007)

07411 Abstracts Collection – Algebraic Methods in Computational Complexity. - Manindra Agrawal; Harry Buhrman; Lance Fortnow; Thomas Thierauf (Algebraic Methods in Computational Complexity, 2007)

The Polynomially Bounded Perfect Matching Problem Is in NC 2. - Manindra Agrawal; Thanh Minh Hoang; Thomas Thierauf (STACS, 2007)

Arithmetic Circuits: A Chasm at Depth Four. - Manindra Agrawal; V. Vinay (Electron. Colloquium Comput. Complex., 2008)

One-Way Functions and the Berman-Hartmanis Conjecture. - Manindra Agrawal; Osamu Watanabe 001 (CCC, 2009)

09421 Abstracts Collection - Algebraic Methods in Computational Complexity. - Manindra Agrawal; Lance Fortnow; Thomas Thierauf; Christopher Umans (Algebraic Methods in Computational Complexity, 2009)

09421 Executive Summary - Algebraic Methods in Computational Complexity. - Manindra Agrawal; Lance Fortnow; Thomas Thierauf; Christopher Umans (Algebraic Methods in Computational Complexity, 2009)

One-Way Functions and the Isomorphism Conjecture. - Manindra Agrawal; Osamu Watanabe 001 (Electron. Colloquium Comput. Complex., 2009)

Preface to Special Issue: Theory and Applications of Models of Computation (TAMC 2008-2009). - Manindra Agrawal; S. Barry Cooper; Angsheng Li (Math. Struct. Comput. Sci., 2010)

On the Arithmetic Complexity of Euler Function. - Manindra Agrawal (CSR, 2011)

Jacobian hits circuits: Hitting-sets, lower bounds for depth-D occur-k formulas & depth-3 transcendence degree-k circuits. - Manindra Agrawal; Chandan Saha 001; Ramprasad Saptharishi; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2011)

The isomorphism conjecture for constant depth reductions. - Manindra Agrawal (J. Comput. Syst. Sci., 2011)

Theory and applications of models of computation (TAMC 2008). - Manindra Agrawal; Angsheng Li (Theor. Comput. Sci., 2011)

The Discrete Time Behaviour of Restricted Linear Hybrid Automata. - Manindra Agrawal; Frank Stephan 001; P. S. Thiagarajan; Shaofa Yang (Modern Applications of Automata Theory, 2012)

Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl Seminar 12421). - Manindra Agrawal; Thomas Thierauf; Christopher Umans (Dagstuhl Reports, 2012)

The Deterministic and Randomized Query Complexity of a Simple Guessing Game. - Peyman Afshani; Manindra Agrawal; Benjamin Doerr; Carola Winzen; Kasper Green Larsen; Kurt Mehlhorn (Electron. Colloquium Comput. Complex., 2012)

Quasi-polynomial Hitting-set for Set-depth-$ Delta$ Formulas. - Manindra Agrawal; Chandan Saha 001; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2012)

The Query Complexity of Finding a Hidden Permutation. - Peyman Afshani; Manindra Agrawal; Benjamin Doerr; Carola Doerr; Kasper Green Larsen; Kurt Mehlhorn (Space-Efficient Data Structures, Streams, and Algorithms, 2013)

Quasi-polynomial hitting-set for set-depth-Δ formulas. - Manindra Agrawal; Chandan Saha 001; Nitin Saxena 001 (STOC, 2013)

Hitting-sets for low-distance multilinear depth-3. - Manindra Agrawal; Rohit Gurjar; Arpita Korwar; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2013)

A Roadmap for TAMC. - T. V. Gopal; Manindra Agrawal; Angsheng Li; S. Barry Cooper (TAMC, 2014)

Algebra in Computational Complexity (Dagstuhl Seminar 14391). - Manindra Agrawal; Valentine Kabanets; Thomas Thierauf; Christopher Umans (Dagstuhl Reports, 2014)

Measure of Non-pseudorandomness and Deterministic Extraction of Pseudorandomness. - Manindra Agrawal; Diptarka Chakraborty; Debarati Das 001; Satyadev Nandakumar (Electron. Colloquium Comput. Complex., 2014)

Theory and Applications of Models of Computation at the Turing Centenary in China. - George Barmpalias; Manindra Agrawal; S. Barry Cooper (Theor. Comput. Sci., 2014)

Approximate Verification of the Symbolic Dynamics of Markov Chains. - Manindra Agrawal; S. Akshay 001; Blaise Genest; P. S. Thiagarajan (J. ACM, 2015)

Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits. - Manindra Agrawal; Rohit Gurjar; Arpita Korwar; Nitin Saxena 001 (SIAM J. Comput., 2015)

Integer Factoring Using Small Algebraic Dependencies. - Manindra Agrawal; Nitin Saxena 001; Shubham Sahai Srivastava (MFCS, 2016)

Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-D Occur-k Formulas and Depth-3 Transcendence Degree-k Circuits. - Manindra Agrawal; Chandan Saha 001; Ramprasad Saptharishi; Nitin Saxena 001 (SIAM J. Comput., 2016)

Dimension, pseudorandomness and extraction of pseudorandomness. - Manindra Agrawal; Diptarka Chakraborty; Debarati Das 001; Satyadev Nandakumar (Comput., 2017)

Small hitting-sets for tiny arithmetic circuits or: How to turn bad designs into good. - Manindra Agrawal; Michael A. Forbes 001; Sumanta Ghosh; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2017)

On the optimality of lattices for the coppersmith technique. - Yoshinori Aono; Manindra Agrawal; Takakazu Satoh; Osamu Watanabe 001 (Appl. Algebra Eng. Commun. Comput., 2018)

Bootstrapping variables in algebraic circuits. - Manindra Agrawal; Sumanta Ghosh; Nitin Saxena 001 (Electron. Colloquium Comput. Complex., 2018)

The query complexity of a permutation-based variant of Mastermind. - Peyman Afshani; Manindra Agrawal; Benjamin Doerr; Carola Doerr; Kasper Green Larsen; Kurt Mehlhorn (Discret. Appl. Math., 2019)

Impossibility of Derandomizing the Isolation Lemma for all Families. - Manindra Agrawal; Rohit Gurjar; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2020)

SUTRA: An Approach to Modelling Pandemics with Undetected (Asymptomatic) Patients, and Applications to COVID-19. - Manindra Agrawal; Madhuri Kanitkar; Mathukumalli Vidyasagar (CDC, 2021)