Get started
Author

Manindra Agrawal

Observed names: Agrawal, Manindra, M. Agrawal, M. R. Agrawal, MANINDRA AGRAWAL
Observed institutions: Maharashtra University of Health Sciences, National University of Singapore, Government of India, Anna University, Chennai, Ministry of Defence, Indian Institute of Technology Kanpur
OpenAlex ID: A5104682589
PRIMES is in P
2004 · Manindra Agrawal, Neeraj Kayal, et al. · Annals of Mathematics · 918
PDF
Arithmetic Circuits: A Chasm at Depth Four
2008 · Manindra Agrawal, V. Vinay · Annual Symposium on Foundations of Computer Science · 190
Proving Lower Bounds Via Pseudo-random Generators
2005 · Manindra Agrawal · Lecture notes in computer science · 124
Primality and identity testing via Chinese remaindering
2003 · Manindra Agrawal, Somenath Biswas · Journal of the ACM · 116
FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science
2002 · Agrawal, Manindra, Seth, Anil · Lecture notes in computer science · 79
On TC0, AC0, and Arithmetic Circuits
2000 · Manindra Agrawal, Eric Allender, et al. · Journal of Computer and System Sciences · 56
FST TCS 2002 : foundations of software technology and theoretical computer science : 22nd conference, Kanpur, India, December 12-14, 2002 : proceedings
2002 · Manindra Agrawal, Anil K. Seth · Springer eBooks · 51
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
1998 · Manindra Agrawal, Eric Allender, et al. · Journal of Computer and System Sciences · 44
Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
2015 · Manindra Agrawal, Rohit Gurjar, et al. · SIAM Journal on Computing · 39
PDF
Jacobian hits circuits
2012 · Manindra Agrawal, Chandan Saha, et al. · ACM Symposium on Theory of Computing (STOC) · 39
Quasi-polynomial hitting-set for set-depth-Δ formulas
2013 · Manindra Agrawal, Chandan Saha, et al. · ACM Symposium on Theory of Computing (STOC) · 38
The Formula Isomorphism Problem
2000 · Manindra Agrawal, Thomas Thierauf · SIAM Journal on Computing · 38
The Query Complexity of Finding a Hidden Permutation
2013 · Peyman Afshani, Manindra Agrawal, et al. · Lecture notes in computer science · 29
Proceedings of the 5th international conference on Theory and applications of models of computation
2008 · Manindra Agrawal, Ding‐Zhu Du, et al. · 28
Modelling the spread of SARS-CoV-2 pandemic - Impact of lockdowns & interventions
2021 · Manindra Agrawal, Madhuri Kanitkar, et al. · The Indian Journal of Medical Research · 27
Approximate Verification of the Symbolic Dynamics of Markov Chains
2015 · Manindra Agrawal, S. Akshay, et al. · Journal of the ACM · 27
PDF
Determinant versus permanent
2007 · Manindra Agrawal · Proceedings of the International Congress of Mathematicians Madrid, August 22–30, 2006 · 26
The Discrete Time Behavior of Lazy Linear Hybrid Automata
2005 · Manindra Agrawal, P. S. Thiagarajan · Lecture notes in computer science · 25
Equivalence of $\mathbb{F}$ -Algebras and Cubic Forms
2006 · Manindra Agrawal, Nitin Saxena · Lecture notes in computer science · 24
Bootstrapping variables in algebraic circuits
2018 · Manindra Agrawal, Sumanta Ghosh, et al. · Proceedings of the National Academy of Sciences · 22
PDF
The Polynomially Bounded Perfect Matching Problem Is in NC 2
2007 · Manindra Agrawal, Thanh Minh Hoang, et al. · Springer eBooks · 22
The query complexity of a permutation-based variant of Mastermind
2019 · Peyman Afshani, Manindra Agrawal, et al. · Discrete Applied Mathematics · 21
Automorphisms of Finite Rings and Applications to Complexity of Problems
2005 · Manindra Agrawal, Nitin Saxena · Lecture notes in computer science · 20
Lazy Rectangular Hybrid Automata
2004 · Manindra Agrawal, P. S. Thiagarajan · Lecture notes in computer science · 19
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits
2016 · Manindra Agrawal, Chandan Saha, et al. · SIAM Journal on Computing · 17
PDF
Works count: 89
Citation count: 2,287
H-index: 21
I10-index: 37
Year
Topic
Type