Manindra Agrawal

Cited by

	All	Since 2017
Citations	3996	1146
h-index	25	15
i10-index	46	18

260

130

195

199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202215 16 24 26 13 18 38 28 98 122 131 138 173 177 223 195 187 196 220 245 211 229 208 208 184 180 241 125

Public access

View all

8 articles

1 article

available

not available

Based on funding mandates

Co-authors

Nitin SaxenaCSE, IIT Kanpur; FASc FNAScVerified email at cse.iitk.ac.in
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaVerified email at imsc.res.in
P.S. ThiagarajanVisiting Professor, Laboratory of Systems Pharmacology, Harvard Medical SchoolVerified email at hms.harvard.edu
Steven RudichProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cs.cmu.edu
Chandan SahaIndian Institute of ScienceVerified email at iisc.ac.in
peyman afshaniMADALGO, Aarhus UniversityVerified email at madalgo.au.dk
Carola DoerrCNRS researcher at Sorbonne Université, Paris, FranceVerified email at mpi-inf.mpg.de
Russell ImpagliazzoUC, San DiegoVerified email at eng.ucsd.edu
Rohit GurjarCalifornia institute of technologyVerified email at caltech.edu
Vinay VAti Motors Pvt LtdVerified email at atimotors.com
Ramprasad SaptharishiTata Institute of Fundamental ResearchVerified email at tifr.res.in
Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteVerified email at cmi.ac.in
Kasper Green LarsenProfessor, Computer Science, Aarhus UniversityVerified email at cs.au.dk
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Benjamin DoerrProfessor at Ecole Polytechnique, FranceVerified email at lix.polytechnique.fr
Arpita KorwarPost-doctorate, IMJ-PRG, University of ParisVerified email at imj-prg.fr
S AkshayIIT BombayVerified email at cse.iitb.ac.in
Richard BeigelTemple UniversityVerified email at temple.edu
Frank StephanNational University of SingaporeVerified email at comp.nus.edu.sg

Manindra Agrawal

Professor of Computer Science, IIT Kanpur

Verified email at iitk.ac.in - Homepage

Theory of Computation Complexity Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
PRIMES is in P M Agrawal, N Kayal, N Saxena Annals of mathematics, 781-793, 2004	2016	2004
Arithmetic circuits: A chasm at depth four M Agrawal, V Vinay 2008 49th Annual IEEE Symposium on Foundations of Computer Science, 67-75, 2008	251	2008
Primality and identity testing via Chinese remaindering M Agrawal, S Biswas Journal of the ACM (JACM) 50 (4), 429-443, 2003	187	2003
Proving lower bounds via pseudo-random generators M Agrawal International Conference on Foundations of Software Technology and …, 2005	157	2005
On TC0, AC0, and arithmetic circuits M Agrawal, E Allender, S Datta Journal of Computer and System Sciences 60 (2), 395-421, 2000	81	2000
Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth- Occur- Formulas and Depth-3 Transcendence Degree- Circuits M Agrawal, C Saha, R Saptharishi, N Saxena SIAM Journal on Computing 45 (4), 1533-1562, 2016	80	2016
Annals of Mathematics M Agrawal, N Kayal, N Saxena PRIMES is in P 160, 781-798, 2004	62	2004
Hitting-sets for ROABP and sum of set-multilinear circuits M Agrawal, R Gurjar, A Korwar, N Saxena SIAM Journal on Computing 44 (3), 669-697, 2015	61	2015
Quasi-polynomial hitting-set for set-depth-Δ formulas M Agrawal, C Saha, N Saxena Proceedings of the forty-fifth annual ACM symposium on Theory of computing …, 2013	57	2013
Reductions in circuit complexity: An isomorphism theorem and a gap theorem M Agrawal, E Allender, S Rudich Journal of Computer and System Sciences 57 (2), 127-143, 1998	56	1998
Approximate verification of the symbolic dynamics of Markov chains M Agrawal, S Akshay, B Genest, PS Thiagarajan Journal of the ACM (JACM) 62 (1), 1-34, 2015	52	2015
The Boolean isomorphism problem M Agrawal, T Thierauf Proceedings of 37th Conference on Foundations of Computer Science, 422-430, 1996	50	1996
Reducing the complexity of reductions M Agrawal, E Allender, R Impagliazzo, T Pitassi, S Rudich Computational Complexity 10 (2), 117-138, 2001	49	2001
The formula isomorphism problem M Agrawal, T Thierauf SIAM Journal on Computing 30 (3), 990-1009, 2000	47	2000
Polynomial time truth-table reductions to P-selective sets M Agrawal, V Arvind Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory …, 1994	40	1994
Pseudo-random generators and structure of complete degrees M Agrawal Proceedings 17th IEEE Annual Conference on Computational Complexity, 139-147, 2002	38	2002
Determinant versus permanent M Agrawal European Mathematical Society, 2006	33	2006
Equivalence of -Algebras and Cubic Forms M Agrawal, N Saxena Annual Symposium on Theoretical Aspects of Computer Science, 115-126, 2006	32	2006
The discrete time behavior of lazy linear hybrid automata M Agrawal, PS Thiagarajan International Workshop on Hybrid Systems: Computation and Control, 55-69, 2005	32	2005
The Polynomially Bounded Perfect Matching Problem Is in NC ² M Agrawal, TM Hoang, T Thierauf Annual Symposium on Theoretical Aspects of Computer Science, 489-499, 2007	31	2007

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors