Eric Allender

引用先

	すべて	2016 年以来
引用	4569	984
h 指標	39	17
i10 指標	76	31

260

130

195

198819891990199119921993199419951996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202135 54 78 71 79 90 97 93 86 117 109 85 93 114 64 111 131 118 130 173 150 188 209 148 245 190 238 131 159 211 168 185 242 17

共著者

Samir DattaProfessor of Computer Science, Chennai Mathematical Institute確認したメールアドレス: cmi.ac.in
Michal KouckyCharles University, Prague確認したメールアドレス: iuuk.mff.cuni.cz
Mitsunori OgiharaUniversity of Miami確認したメールアドレス: cs.miami.edu
Meena MahajanProfessor at The Institute of Mathematical Sciences, HBNI, Chennai, India確認したメールアドレス: imsc.res.in
Harry BuhrmanGroup leader CWI & Distinguished Research Professor University of Amsterdam & Director QuSoft確認したメールアドレス: cwi.nl
Judy GoldsmithUniversity of Kentucky確認したメールアドレス: cs.uky.edu
Manindra AgrawalProfessor of Computer Science, IIT Kanpur確認したメールアドレス: iitk.ac.in
Michael SaksRutgers University-New Brunswick確認したメールアドレス: math.rutgers.edu
Lane A. Hemaspaandra (premarriage...Professor of Computer Science, University of Rochester確認したメールアドレス: cs.rochester.edu
Sambuddha RoyUnaffiliated - Deep Learning Consultant/Practitioner確認したメールアドレス: in.ibm.com
Steven RudichProfessor of Computer Science, Carnegie Mellon University確認したメールアドレス: cs.cmu.edu
Neil ImmermanCollege of Computer and Information Sciences, UMass, Amherst確認したメールアドレス: cs.umass.edu
VIkraman ArvindProfessor, Computer Science, Institute of Mathematical Sciences, Chennai, India確認したメールアドレス: imsc.res.in
Heribert VollmerProfessor für Theoretische Informatik, Leibniz Universität Hannover確認したメールアドレス: thi.uni-hannover.de
Lisa HellersteinProfessor of Computer Science, NYU Tandon School of Engineering確認したメールアドレス: nyu.edu
Vinay VAti Motors Pvt Ltd確認したメールアドレス: atimotors.com
Cristopher MooreSanta Fe Institute確認したメールアドレス: santafe.edu
Michael C. LouiPurdue University; University of Illinois at Urbana-Champaign確認したメールアドレス: illinois.edu
Kenneth ReganAssociate Professor, Department of Computer Science and Engineering, University at Buffalo (SUNY)確認したメールアドレス: buffalo.edu
Henning SchnoorResearcher of Computer Science, Dept. of Computer Science, Kiel University確認したメールアドレス: ti.informatik.uni-kiel.de

Eric Allender

Rutgers University

確認したメールアドレス: cs.rutgers.edu - ホームページ

Computational Complexity Theory


タイトル引用回数順公開年順タイトル順	引用先引用先	年
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	216	2002
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	186	2008
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	167	2000
P-printable sets EW Allender, RS Rubinstein SIAM Journal on Computing 17 (6), 1193-1202, 1988	161	1988
Relationships among PL,# L, and the determinant E Allender, M Ogihara Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth …, 1994	157	1994
A note on the power of threshold circuits E Allender 30th Annual Symposium on Foundations of Computer Science, 580-584, 1989	151	1989
Making nondeterminism unambiguous E Allender, K Reinhardt SIAM J. Comp 29 (4), 1118-1131, 2000	143*	2000
Power from random strings E Allender, H Buhrman, M Koucky, D Melkebeek, D Ronneburger SIAM Journal on Computing 35 (6), 1467-1493, 2006	131*	2006
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	123*	1998
The complexity of sparse sets in P EW Allender Structure in Complexity Theory, 1-11, 1986	121	1986
The complexity of matrix rank and feasible systems of linear equations E Allender, R Beals, M Ogihara Computational Complexity 8 (2), 99-126, 1999	111	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	108*	1999
Measure on small complexity classes, with applications for BPP E Allender, M Strauss Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on …, 1994	99	1994
Arithmetic circuits and counting complexity classes E Allender Complexity of Computations and Proofs, Quaderni di Matematica 13, 33-72, 2004	93*	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	86*	2009
Planar and grid graph reachability problems E Allender, DAM Barrington, T Chakraborty, S Datta, S Roy Theory of Computing Systems 45 (4), 675-723, 2009	82*	2009
Lower bounds for the low hierarchy E Allender, LA Hemachandra Journal of the ACM (JACM) 39 (1), 234-251, 1992	82	1992
The complexity of planarity testing E Allender, M Mahajan Information and Computation 189 (1), 117-134, 2004	78*	2004
Amplifying lower bounds by means of self-reducibility E Allender, M Koucký Journal of the ACM (JACM) 57 (3), 1-36, 2010	77	2010
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	75	2000

現在システムで処理を実行できません。しばらくしてからもう一度お試しください。

論文 1–20

年間引用数

重複した引用

結合された引用

共著者を追加共著者

PDF のアップロード

この著者をフォローする

引用先

共著者