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.
- 1 Similar Profiles
Network
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
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
-
Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity
Allender, E., Gouwar, J., Hirahara, S. & Robelle, C., Dec 1 2021, 32nd International Symposium on Algorithms and Computation, ISAAC 2021. Ahn, H-K. & Sadakane, K. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 54. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 212).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
Depth-First Search in Directed Planar Graphs, Revisited
Allender, E., Chauhan, A. & Datta, S., Aug 1 2021, 46th International Symposium on Mathematical Foundations of Computer Science, MFCS 2021. Bonchi, F. & Puglisi, S. J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 202).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
One-Way Functions and a Conditional Variant of MKTP
Allender, E., Cheraghchi, M., Myrisiotis, D., Tirumala, H. & Volkovich, I., Dec 1 2021, 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2021. Bojanczyk, M. & Chekuri, C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 7. (Leibniz International Proceedings in Informatics, LIPIcs; vol. 213).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
-
The Non-hardness of Approximating Circuit Size
Allender, E., Ilango, R. & Vafa, N., Apr 2021, In: Theory of Computing Systems. 65, 3, p. 559-578 20 p.Research output: Contribution to journal › Article › peer-review
2 Scopus citations -
Vaughan Jones, Kolmogorov complexity, and the new complexity landscape around circuit minimization
Allender, E., 2021, In: New Zealand Journal of Mathematics. 52, p. 585-604 20 p.Research output: Contribution to journal › Review article › peer-review
Open Access