Eric Allender

Cited by

	All	Since 2019
Citations	5407	1292
h-index	43	21
i10-index	80	40

300

150

225

198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202434 45 66 75 80 97 89 81 93 103 108 85 91 116 67 133 132 108 137 187 153 177 198 133 230 185 234 144 168 198 179 195 233 191 206 291 168

Public access

View all

26 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteVerified email at cmi.ac.in
Michal KouckyCharles University, PragueVerified email at iuuk.mff.cuni.cz
Mitsunori OgiharaUniversity of MiamiVerified email at cs.miami.edu
Meena MahajanThe Institute of Mathematical Sciences, (a CI of Homi Bhabha National Institute), Chennai, IndiaVerified email at imsc.res.in
Judy GoldsmithUniversity of KentuckyVerified email at cs.uky.edu
Manindra AgrawalProfessor of Computer Science, IIT KanpurVerified email at iitk.ac.in
Harry BuhrmanChief Scientist Q Algorithms @ Quantinuum, Professor Univ. of Amsterdam & Founding Director QuSoftVerified email at quantinuum.com
Michael SaksRutgers University-New BrunswickVerified email at math.rutgers.edu
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of RochesterVerified email at cs.rochester.edu
Sambuddha RoyUnaffiliated - Deep Learning Consultant/PractitionerVerified email at in.ibm.com
Steven RudichProfessor of Computer Science, Carnegie Mellon UniversityVerified email at cmu.edu
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, IndiaVerified email at imsc.res.in
Osamu WatanabeTokyo Institute of TechnologyVerified email at c.titech.ac.jp
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität HannoverVerified email at thi.uni-hannover.de
Neil ImmermanCollege of Computer and Information Sciences, UMass, AmherstVerified email at cs.umass.edu
Lisa HellersteinProfessor of Computer Science, NYU Tandon School of EngineeringVerified email at nyu.edu
Cristopher MooreSanta Fe InstituteVerified email at santafe.edu
Vinay VJed-i Technologies Pvt LtdVerified email at jed-i.in
Michael C. LouiPurdue University; University of Illinois at Urbana-ChampaignVerified email at illinois.edu
Kenneth ReganAssociate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)Verified email at buffalo.edu

Eric Allender

Rutgers University

Verified email at cs.rutgers.edu - Homepage

Computational Complexity Theory


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
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	278	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	273*	2000
P-printable sets EW Allender, RS Rubinstein SIAM Journal on Computing 17 (6), 1193-1202, 1988	249*	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	222	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	191*	2006
Relationships among PL,# L, and the determinant E Allender, M Ogihara Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth …, 1994	172	1994
Making nondeterminism unambiguous E Allender, K Reinhardt SIAM J. Comp 29 (4), 1118-1131, 2000	171*	2000
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	131*	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	125	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	123*	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	109*	2009
Amplifying lower bounds by means of self-reducibility E Allender, M Koucký Journal of the ACM (JACM) 57 (3), 1-36, 2010	106	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	104*	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	101	1994
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	100*	2009
Arithmetic circuits and counting complexity classes E Allender Complexity of Computations and Proofs, Quaderni di Matematica 13, 33-72, 2004	100*	2004
The complexity of planarity testing E Allender, M Mahajan Information and Computation 189 (1), 117-134, 2004	90*	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	82	2000
Lower bounds for the low hierarchy E Allender, LA Hemachandra Journal of the ACM (JACM) 39 (1), 234-251, 1992	82	1992

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