Manindra Agrawal

Citado por

	Todos	Desde 2020
Citações	4554	1069
Índice h	26	16
Índice i10	49	20

260

130

195

199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202514 17 21 28 16 19 29 29 99 121 137 142 172 188 218 180 183 200 225 248 214 229 199 216 200 178 252 233 173 210 23

Acesso público

Ver todos

10 artigos

1 artigo

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

Nitin SaxenaN.Rama.Rao.Professor & J.C.Bose.Fellow, CSE, IIT Kanpur; FNA FASc FNASc FNAEE-mail confirmado em cse.iitk.ac.in
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaE-mail confirmado em imsc.res.in
Eric AllenderRutgers UniversityE-mail confirmado em cs.rutgers.edu
P.S. ThiagarajanVisiting Professor, Laboratory of Systems Pharmacology, Harvard Medical SchoolE-mail confirmado em hms.harvard.edu
Mathukumalli VidyasagarSERB National Science Chair, Indian Institute of Technology HyderabadE-mail confirmado em iith.ac.in
Steven RudichProfessor of Computer Science, Carnegie Mellon UniversityE-mail confirmado em cmu.edu
Chandan SahaIndian Institute of ScienceE-mail confirmado em iisc.ac.in
Rohit GurjarCalifornia institute of technologyE-mail confirmado em caltech.edu
Vinay VJed-i Technologies Pvt LtdE-mail confirmado em jed-i.in
Ramprasad SaptharishiTata Institute of Fundamental ResearchE-mail confirmado em tifr.res.in
Kasper Green LarsenProfessor, Computer Science, Aarhus UniversityE-mail confirmado em cs.au.dk
peyman afshaniAarhus UniversityE-mail confirmado em madalgo.au.dk
Kurt MehlhornProfessor of Computer Science, Max Planck Institute for Informatics, Saarland Informatics CampusE-mail confirmado em mpi-inf.mpg.de
Carola DoerrCNRS research director (DR) at Sorbonne Université, Paris, FranceE-mail confirmado em mpi-inf.mpg.de
Osamu WatanabeTokyo Institute of TechnologyE-mail confirmado em c.titech.ac.jp
Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteE-mail confirmado em cmi.ac.in
Sumanta GhoshAssistant Professor, ISI KolkataE-mail confirmado em isical.ac.in
Arpita KorwarPost-doctorate, IMJ-PRG, University of ParisE-mail confirmado em imj-prg.fr
Benjamin DoerrProfessor at Ecole Polytechnique, FranceE-mail confirmado em lix.polytechnique.fr
Frank StephanNational University of Singapore, Department of Mathematics and Department of Computer ScienceE-mail confirmado em comp.nus.edu.sg

Seguir

Manindra Agrawal

Professor of Computer Science, IIT Kanpur

E-mail confirmado em iitk.ac.in - Página inicial

Theory of Computation Complexity Theory


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
PRIMES is in P M Agrawal, N Kayal, N Saxena Annals of mathematics, 781-793, 2004	2268	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	274	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 International Conference on Foundations of Software Technology and …, 2005	170	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	89	2012
On TC0, AC0, and arithmetic circuits M Agrawal, E Allender, S Datta Journal of Computer and System Sciences 60 (2), 395-421, 2000	83	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	75	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	68	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	57	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	54	1996
The formula isomorphism problem M Agrawal, T Thierauf SIAM Journal on Computing 30 (3), 990-1009, 2000	51	2000
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	44	2005
Proceedings of the 5th international conference on Theory and applications of models of computation M Agrawal, D Du, Z Duan, A Li Springer-Verlag, 2008	43	2008
Bootstrapping variables in algebraic circuits M Agrawal, S Ghosh, N Saxena Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing …, 2018	42	2018
Equivalence of-algebras and cubic forms M Agrawal, N Saxena Annual Symposium on Theoretical Aspects of Computer Science, 115-126, 2006	42	2006
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	39	2002

O sistema não pode executar a operação agora. Tente novamente mais tarde.

Artigos 1–20

Citações por ano

Citações duplicadas

Citações mescladas

Adicionar coautoresCoautores

Seguir

Citado por

Coautores