Eric Allender

academic, SAS - Computer Science

Emailallender@rutgers.edu

Source: Scopus
Calculated based on no. of publications stored in Pure and citations from Scopus

Research activity per year

If you made any changes in Pure these will be visible here soon.

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.

6 Similar Profiles

Network

Recent external collaboration on country level. Dive into details by clicking on the dots.

4 Finished

AF: STUDENT TRAVEL TO CLAY MATHEMATICS INSTITUTE COMPLEXITY WORKSHOP
Allender, E.
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
Allender, E.
National Science Foundation (National Science Foundation (NSF))
9/1/15 → 8/31/16
Project: Research project
AF: MEDIUM: COMPUTATIONAL COMPLEXITY THEORY AND CIRCUIT COMPLEXITY
Allender, E.
National Science Foundation (National Science Foundation (NSF))
6/1/11 → 5/31/14
Project: Research project
COMPUTATIONAL COMPLEXITY THEORY AND CIRCUIT COMPLEXITY
Allender, E.
National Science Foundation (National Science Foundation (NSF))
8/1/08 → 7/31/12
Project: Research project

2012 Citations
25 h-Index
61 Conference contribution
56 Article
9 Conference article
4 Chapter
More
- 3 Editorial
- 1 Comment/debate

Ker-I ko and the study of resource-bounded kolmogorov complexity
Allender, E., 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
1 Scopus citations
The new complexity landscape around circuit minimization
Allender, E., 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
3 Scopus citations
The Non-hardness of Approximating Circuit Size
Allender, E., Ilango, R. & Vafa, N., 2020, (Accepted/In press) In: Theory of Computing Systems.
Research output: Contribution to journal › Article › peer-review
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 › peer-review
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 › peer-review
6 Scopus citations