Manindra Agrawal

Cited by

	All	Since 2018
Citations	4078	1037
h-index	26	14
i10-index	46	17

240

120

180

1995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202313 16 23 25 15 19 35 27 106 114 134 136 172 188 208 188 197 193 216 240 207 226 211 210 189 181 239 204 14

Public access

View all

9 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Nitin SaxenaN.Rama.Rao.Professor, CSE, IIT Kanpur; FASc FNASc FNAEVerified email at cse.iitk.ac.in
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaVerified email at imsc.res.in
Eric AllenderRutgers UniversityVerified email at cs.rutgers.edu
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
Rohit GurjarCalifornia institute of technologyVerified email at caltech.edu
Russell ImpagliazzoUC, San DiegoVerified email at eng.ucsd.edu
Vinay VAti Motors Pvt LtdVerified email at atimotors.com
Ramprasad SaptharishiTata Institute of Fundamental ResearchVerified email at tifr.res.in
Kasper Green LarsenProfessor, Computer Science, Aarhus UniversityVerified email at cs.au.dk
peyman afshaniAarhus UniversityVerified email at madalgo.au.dk
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusVerified email at mpi-inf.mpg.de
Carola DoerrCNRS research director (DR) at Sorbonne Université, Paris, FranceVerified email at mpi-inf.mpg.de
Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteVerified email at cmi.ac.in
Arpita KorwarPost-doctorate, IMJ-PRG, University of ParisVerified email at imj-prg.fr
Benjamin DoerrProfessor at Ecole Polytechnique, FranceVerified email at lix.polytechnique.fr
Frank StephanNational University of SingaporeVerified email at comp.nus.edu.sg
Richard BeigelTemple UniversityVerified email at temple.edu
S AkshayIIT BombayVerified email at cse.iitb.ac.in

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	2055	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	254	2008
Primality and identity testing via Chinese remaindering M Agrawal, S Biswas Journal of the ACM (JACM) 50 (4), 429-443, 2003	185	2003
Proving lower bounds via pseudo-random generators M Agrawal FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …, 2005	158	2005
On TC0, AC0, and arithmetic circuits M Agrawal, E Allender, S Datta Journal of Computer and System Sciences 60 (2), 395-421, 2000	82	2000
Jacobian hits circuits: hitting-sets, lower bounds for depth-d occur-k formulas & depth-3 transcendence degree-k circuits M Agrawal, C Saha, R Saptharishi, N Saxena Proceedings of the forty-fourth annual ACM symposium on Theory of computing …, 2012	81	2012
Annals of Mathematics M Agrawal, N Kayal, N Saxena PRIMES is in P 160, 781-798, 2004	68	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	67	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	58	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	54	2015
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 Boolean isomorphism problem M Agrawal, T Thierauf Proceedings of 37th Conference on Foundations of Computer Science, 422-430, 1996	49	1996
The formula isomorphism problem M Agrawal, T Thierauf SIAM Journal on Computing 30 (3), 990-1009, 2000	48	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	41	1994
Pseudo-random generators and structure of complete degrees M Agrawal Proceedings 17th IEEE Annual Conference on Computational Complexity, 139-147, 2002	38	2002
Equivalence of -Algebras and Cubic Forms M Agrawal, N Saxena STACS 2006: 23rd Annual Symposium on Theoretical Aspects of Computer Science …, 2006	35	2006
Automorphisms of finite rings and applications to complexity of problems M Agrawal, N Saxena STACS 2005: 22nd Annual Symposium on Theoretical Aspects of Computer Science …, 2005	33	2005
Bootstrapping variables in algebraic circuits M Agrawal, S Ghosh, N Saxena Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	32	2018
The Polynomially Bounded Perfect Matching Problem Is in NC ² M Agrawal, TM Hoang, T Thierauf STACS 2007: 24th Annual Symposium on Theoretical Aspects of Computer Science …, 2007	32	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