| 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 | 305 | 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 | 290* | 2000 |
| P-printable sets EW Allender, RS Rubinstein SIAM Journal on Computing 17 (6), 1193-1202, 1988 | 257* | 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 | 237 | 2008 |
| Depth reduction for circuits of unbounded fan-in EW Allender, U Hertrampf Information and Computation 112 (2), 217-238, 1994 | 214* | 1994 |
| Power from random strings E Allender, H Buhrman, M Koucky, D Melkebeek, D Ronneburger SIAM Journal on Computing 35 (6), 1467-1493, 2006 | 200* | 2006 |
| Making nondeterminism unambiguous E Allender, K Reinhardt SIAM J. Comp 29 (4), 1118-1131, 2000 | 188* | 2000 |
| Relationships among PL,# L, and the determinant E Allender, M Ogihara Structure in Complexity Theory Conference, 1994., Proceedings of the Ninth …, 1994 | 178 | 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 |
| 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 | 133* | 1999 |
| The Complexity of Matrix Rank and Feasible Systems of Linear Equations E Allender, R Beals, M Ogihara Computational Complexity 8 (2), 99-126, 1999 | 133 | 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 | 118* | 2009 |
| 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 | 112* | 2008 |
| Amplifying lower bounds by means of self-reducibility E Allender, M Koucký Journal of the ACM (JACM) 57 (3), 1-36, 2010 | 111 | 2010 |
| 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 | 108* | 2009 |
| Arithmetic circuits and counting complexity classes E Allender Complexity of computations and proofs, 33-72, 2004 | 108* | 2004 |
| Measure on small complexity classes, with applications for BPP E Allender, M Strauss Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on …, 1994 | 104 | 1994 |
| The complexity of planarity testing E Allender, M Mahajan Information and Computation 189 (1), 117-134, 2004 | 93* | 2004 |
| The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory E Allender, M Koucký, D Ronneburger, S Roy Journal of Computer and System Sciences 77 (1), 14-40, 2011 | 83* | 2011 |
| 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 |
Samir DattaProfessor of Computer Science, Chennai Mathematical InstituteVerified email at cmi.ac.in
