Eric Allender

Citado por

	Todos	Desde 2020
Citações	5519	1165
Índice h	43	18
Índice i10	80	36

300

150

225

1988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202534 45 67 75 82 97 90 87 97 103 109 86 90 105 62 133 147 108 137 187 151 187 206 133 228 191 233 152 168 200 182 194 229 193 208 295 201 33

Acesso público

Ver todos

26 artigos

0 artigo

disponível

não disponível

Com base nas autorizações de financiamento

Coautores

Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteE-mail confirmado em cmi.ac.in
Michal KouckyCharles University, PragueE-mail confirmado em iuuk.mff.cuni.cz
Mitsunori OgiharaUniversity of MiamiE-mail confirmado em cs.miami.edu
Meena MahajanThe Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, IndiaE-mail confirmado em imsc.res.in
Judy GoldsmithUniversity of KentuckyE-mail confirmado em cs.uky.edu
Manindra AgrawalProfessor of Computer Science, IIT KanpurE-mail confirmado em iitk.ac.in
Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftE-mail confirmado em quantinuum.com
Michael SaksRutgers University-New BrunswickE-mail confirmado em math.rutgers.edu
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterE-mail confirmado em cs.rochester.edu
Sambuddha RoyUnaffiliated - Deep Learning Consultant/PractitionerE-mail confirmado em in.ibm.com
Steven RudichProfessor of Computer Science, Carnegie Mellon UniversityE-mail confirmado em cmu.edu
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaE-mail confirmado em imsc.res.in
Osamu WatanabeTokyo Institute of TechnologyE-mail confirmado em c.titech.ac.jp
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverE-mail confirmado em thi.uni-hannover.de
Neil ImmermanCollege of Computer and Information Sciences, UMass, AmherstE-mail confirmado em cs.umass.edu
Cristopher MooreSanta Fe InstituteE-mail confirmado em santafe.edu
Vinay VJed-i Technologies Pvt LtdE-mail confirmado em jed-i.in
Michael C. LouiPurdue University; University of Illinois at Urbana-ChampaignE-mail confirmado em illinois.edu
Kenneth ReganAssociate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)E-mail confirmado em buffalo.edu
Henning SchnoorResearcher of Computer Science, Dept. of Computer Science, Kiel UniversityE-mail confirmado em ti.informatik.uni-kiel.de

Seguir

Eric Allender

Rutgers University

E-mail confirmado em cs.rutgers.edu - Página inicial

Computational Complexity Theory


Título Ordenar por citações Ordenar por ano Ordenar por título	Citado por Citado por	Ano
Uniform constant-depth threshold circuits for division and iterated multiplication W Hesse, E Allender, DAM Barrington Journal of Computer and System Sciences 65 (4), 695-716, 2002	293	2002
Complexity of finite-horizon Markov decision process problems M Mundhenk, J Goldsmith, C Lusena, E Allender Journal of the ACM (JACM) 47 (4), 681-720, 2000	278*	2000
P-printable sets EW Allender, RS Rubinstein SIAM Journal on Computing 17 (6), 1193-1202, 1988	252*	1988
On the complexity of numerical analysis E Allender, P Bürgisser, J Kjeldgaard-Pedersen, PB Miltersen SIAM Journal on Computing 38 (5), 1987-2006, 2008	233	2008
Depth reduction for circuits of unbounded fan-in EW Allender, U Hertrampf Information and Computation 112 (2), 217-238, 1994	218*	1994
Power from random strings E Allender, H Buhrman, M Koucky, D Melkebeek, D Ronneburger SIAM Journal on Computing 35 (6), 1467-1493, 2006	197*	2006
Making nondeterminism unambiguous E Allender, K Reinhardt SIAM J. Comp 29 (4), 1118-1131, 2000	173*	2000
Relationships among PL,# L, and the determinant E Allender, M Ogihara Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth …, 1994	172	1994
Non-commutative arithmetic circuits: depth reduction and size lower bounds E Allender, J Jiao, M Mahajan, V Vinay Theoretical Computer Science 209 (1-2), 47-86, 1998	137*	1998
The Complexity of Matrix Rank and Feasible Systems of Linear Equations E Allender, R Beals, M Ogihara Computational Complexity 8 (2), 99-126, 1999	127	1999
Isolation, matching, and counting uniform and nonuniform upper bounds E Allender, K Reinhardt, S Zhou Journal of Computer and System Sciences 59 (2), 164-181, 1999	126*	1999
Planar and grid graph reachability problems E Allender, DA Mix Barrington, T Chakraborty, S Datta, S Roy Theory of Computing Systems 45 (4), 675-723, 2009	112*	2009
Amplifying lower bounds by means of self-reducibility E Allender, M Koucký Journal of the ACM (JACM) 57 (3), 1-36, 2010	110	2010
Minimizing Disjunctive Normal Form Formulas and Circuits Given a Truth Table E Allender, L Hellerstein, P McCabe, T Pitassi, M Saks SIAM Journal on Computing 38, 63, 2008	105*	2008
Measure on small complexity classes, with applications for BPP E Allender, M Strauss Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on …, 1994	105	1994
Arithmetic circuits and counting complexity classes E Allender Complexity of computations and proofs, 33-72, 2004	102*	2004
The complexity of satisfiability problems: Refining Schaefer's theorem E Allender, M Bauland, N Immerman, H Schnoor, H Vollmer Journal of Computer and System Sciences 75 (4), 245-254, 2009	101*	2009
The complexity of planarity testing E Allender, M Mahajan Information and Computation 189 (1), 117-134, 2004	91*	2004
On TC 0, AC 0, and arithmetic circuits M Agrawal, E Allender, S Datta Journal of Computer and System Sciences 60 (2), 395-421, 2000	83	2000
The permanent requires large uniform threshold circuits E Allender Chicago Journal of Theoretical Computer Science, 1-19, 1999	80	1999

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