Eric Allender
Affiliations: | Rutgers University, New Brunswick, New Brunswick, NJ, United States |
Area:
Computer ScienceGoogle:
"Eric Allender"Children
Sign in to add traineeMichal Koucky | grad student | 2003 | Rutgers, New Brunswick |
Samir Datta | grad student | 2004 | Rutgers, New Brunswick |
Detlef Ronneburger | grad student | 2004 | Rutgers, New Brunswick |
Sambuddha Roy | grad student | 2006 | Rutgers, New Brunswick |
Fengming Wang | grad student | 2012 | Rutgers, New Brunswick |
Luke Friedman | grad student | 2013 | Rutgers, New Brunswick |
BETA: Related publications
See more...
Publications
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
Allender E, Ilango R, Vafa N. (2020) The Non-hardness of Approximating Circuit Size Theory of Computing Systems \/ Mathematical Systems Theory. 1-20 |
Allender E. (2020) Ker-I Ko and the Study of Resource-Bounded Kolmogorov Complexity Lecture Notes in Computer Science. 12000: 8-18 |
Allender E, Hirahara S. (2019) New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems Acm Transactions On Computation Theory. 11: 1-27 |
Allender E, Grochow JA, van Melkebeek D, et al. (2018) Minimum Circuit Size, Graph Isomorphism, and Related Problems Siam Journal On Computing. 47: 1339-1372 |
Allender E, Krebs A, McKenzie P. (2018) Better Complexity Bounds for Cost Register Automata Theory of Computing Systems. 63: 367-385 |
Allender E, Holden D, Kabanets V. (2016) The Minimum Oracle Circuit Size Problem Computational Complexity. 1-28 |
Allender E, Wang F. (2016) On the power of algebraic branching programs of width two Computational Complexity. 25: 217-253 |
Allender E, Mertz I. (2015) Complexity of regular functions Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8977: 449-460 |
Allender E, Gál A, Mertz I. (2015) Dual VP classes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 9235: 14-25 |
Allender E, Chen S, Lou T, et al. (2014) Width-Parameterized SAT: Time-Space Tradeoffs Theory of Computing. 10: 297-339 |