Manindra Agrawal

引用次数

	总计	2020 年至今
引用	4505	1038
h 指数	27	15
i10 指数	48	18

260

130

195

199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202514 16 20 28 17 19 31 29 100 119 139 143 175 187 207 181 201 197 222 244 209 225 198 212 197 174 252 227 166 205 14

开放获取的出版物数量

查看全部

10 篇文章

1 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Nitin SaxenaN.Rama.Rao.Professor & J.C.Bose.Fellow, CSE, IIT Kanpur; FNA FASc FNASc FNAE在 cse.iitk.ac.in 的电子邮件经过验证
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, India在 imsc.res.in 的电子邮件经过验证
Eric AllenderRutgers University在 cs.rutgers.edu 的电子邮件经过验证
P.S. ThiagarajanVisiting Professor, Laboratory of Systems Pharmacology, Harvard Medical School在 hms.harvard.edu 的电子邮件经过验证
Mathukumalli VidyasagarSERB National Science Chair, Indian Institute of Technology Hyderabad在 iith.ac.in 的电子邮件经过验证
Steven RudichProfessor of Computer Science, Carnegie Mellon University在 cmu.edu 的电子邮件经过验证
Chandan SahaIndian Institute of Science在 iisc.ac.in 的电子邮件经过验证
Rohit GurjarCalifornia institute of technology在 caltech.edu 的电子邮件经过验证
Vinay VJed-i Technologies Pvt Ltd在 jed-i.in 的电子邮件经过验证
Ramprasad SaptharishiTata Institute of Fundamental Research在 tifr.res.in 的电子邮件经过验证
Kasper Green LarsenProfessor, Computer Science, Aarhus University在 cs.au.dk 的电子邮件经过验证
peyman afshaniAarhus University在 madalgo.au.dk 的电子邮件经过验证
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics Campus在 mpi-inf.mpg.de 的电子邮件经过验证
Carola DoerrCNRS research director (DR) at Sorbonne Université, Paris, France在 mpi-inf.mpg.de 的电子邮件经过验证
Osamu WatanabeTokyo Institute of Technology在 c.titech.ac.jp 的电子邮件经过验证
Samir DattaProfessor of Computer Science, Chennai Mathematical Institute在 cmi.ac.in 的电子邮件经过验证
Sumanta GhoshAssistant Professor, ISI Kolkata在 isical.ac.in 的电子邮件经过验证
Arpita KorwarPost-doctorate, IMJ-PRG, University of Paris在 imj-prg.fr 的电子邮件经过验证
Benjamin DoerrProfessor at Ecole Polytechnique, France在 lix.polytechnique.fr 的电子邮件经过验证
Frank StephanNational University of Singapore, Department of Mathematics and Department of Computer Science在 comp.nus.edu.sg 的电子邮件经过验证

关注

Manindra Agrawal

Professor of Computer Science, IIT Kanpur

在 iitk.ac.in 的电子邮件经过验证 - 首页

Theory of Computation Complexity Theory


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
PRIMES is in P M Agrawal, N Kayal, N Saxena Annals of mathematics, 781-793, 2004	2266	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	192	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	81	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	52	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

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

关注

引用次数

合著作者