Projects per year
Fingerprint Dive into the research topics where Eric Allender is active. These topic labels come from the works of this person. Together they form a unique fingerprint.
- 3 Similar Profiles
Network
Recent external collaboration on country level. Dive into details by clicking on the dots.
Projects
- 4 Finished
AF: STUDENT TRAVEL TO CLAY MATHEMATICS INSTITUTE COMPLEXITY WORKSHOP
National Science Foundation (National Science Foundation (NSF))
4/1/18 → 3/31/19
Project: Research project
EAGER: AF: NEW APPROACHES TO HARDNESS FOR CIRCUIT MINIMIZATION
National Science Foundation (National Science Foundation (NSF))
9/1/15 → 8/31/16
Project: Research project
AF: MEDIUM: COMPUTATIONAL COMPLEXITY THEORY AND CIRCUIT COMPLEXITY
National Science Foundation (National Science Foundation (NSF))
6/1/11 → 5/31/14
Project: Research project
COMPUTATIONAL COMPLEXITY THEORY AND CIRCUIT COMPLEXITY
National Science Foundation (National Science Foundation (NSF))
8/1/08 → 7/31/12
Project: Research project
Research Output
Ker-I ko and the study of resource-bounded kolmogorov complexity
Allender, E., Jan 1 2020, Complexity and Approximation - In Memory of Ker-I Ko. Du, D-Z. & Wang, J. (eds.). Springer, p. 8-18 11 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12000 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
The new complexity landscape around circuit minimization
Allender, E., Jan 1 2020, Language and Automata Theory and Applications - 14th International Conference, LATA 2020, Proceedings. Leporati, A., Martín-Vide, C., Shapira, D. & Zandron, C. (eds.). Springer, p. 3-16 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); vol. 12038 LNCS).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
Better Complexity Bounds for Cost Register Automata
Allender, E., Krebs, A. & McKenzie, P., Apr 15 2019, In : Theory of Computing Systems. 63, 3, p. 367-385 19 p.Research output: Contribution to journal › Article
New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems
Allender, E. & Hirahara, S., Sep 2019, In : ACM Transactions on Computation Theory. 11, 4, 27.Research output: Contribution to journal › Article
4
Scopus
citations
Syntactic separation of subset satisfiability problems
Allender, E., Farach-Colton, M. & Tsai, M. T., Sep 2019, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2019. Achlioptas, D. & Vegh, L. A. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 145).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution