Manindra Agrawal

Cited by

	All	Since 2019
Citations	4479	1214
h-index	27	16
i10-index	48	20

260

130

195

19951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202414 16 20 28 17 19 31 29 99 118 139 143 176 187 207 180 200 197 222 244 207 224 199 211 198 175 250 226 165 200

Public access

View all

10 articles

1 article

available

not available

Based on funding mandates

Co-authors

Nitin SaxenaN.Rama.Rao.Professor & J.C.Bose.Fellow, CSE, IIT Kanpur; FNA 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
Mathukumalli VidyasagarSERB National Science Chair, Indian Institute of Technology HyderabadVerified email at iith.ac.in
Steven RudichProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cmu.edu
Chandan SahaIndian Institute of ScienceVerified email at iisc.ac.in
Rohit GurjarCalifornia institute of technologyVerified email at caltech.edu
Vinay VJed-i Technologies Pvt LtdVerified email at jed-i.in
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
Osamu WatanabeTokyo Institute of TechnologyVerified email at c.titech.ac.jp
Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteVerified email at cmi.ac.in
Sumanta GhoshPostdoctoral Fellow, CaltechVerified email at caltech.edu
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 Singapore, Department of Mathematics and Department of Computer ScienceVerified 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	2246	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	272	2008
Primality and identity testing via Chinese remaindering M Agrawal, S Biswas Journal of the ACM (JACM) 50 (4), 429-443, 2003	191	2003
Proving lower bounds via pseudo-random generators M Agrawal FSTTCS 2005: Foundations of Software Technology and Theoretical Computer …, 2005	169	2005
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	88	2012
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
Annals of Mathematics M Agrawal, N Kayal, N Saxena PRIMES is in P 160, 781-798, 2004	80	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	76	2015
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	69	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	63	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	60	1998
Reducing the complexity of reductions M Agrawal, E Allender, R Impagliazzo, T Pitassi, S Rudich Computational Complexity 10 (2), 117-138, 2001	55	2001
The Boolean isomorphism problem M Agrawal, T Thierauf Proceedings of 37th Conference on Foundations of Computer Science, 422-430, 1996	53	1996
The formula isomorphism problem M Agrawal, T Thierauf SIAM Journal on Computing 30 (3), 990-1009, 2000	51	2000
Equivalence of-algebras and cubic forms M Agrawal, N Saxena Annual Symposium on Theoretical Aspects of Computer Science, 115-126, 2006	42	2006
Automorphisms of finite rings and applications to complexity of problems M Agrawal, N Saxena Annual Symposium on Theoretical Aspects of Computer Science, 1-17, 2005	42	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	41	2018
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	40	2002
Determinant versus permanent M Agrawal European Mathematical Society, 2006	39	2006

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