| 2021 | ISAAC | Cryptographic Hardness Under Projections for Time-Bounded Kolmogorov Complexity. | Eric Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle |
| 2021 | MFCS | Depth-First Search in Directed Planar Graphs, Revisited. | Eric Allender, Archit Chauhan, Samir Datta |
| 2020 | LATA | The New Complexity Landscape Around Circuit Minimization. | Eric Allender |
| 2019 | CSR | The Non-hardness of Approximating Circuit Size. | Eric Allender, Rahul Ilango, Neekon Vafa |
| 2017 | MFCS | New Insights on the (Non-)Hardness of Circuit Minimization and Related Problems. | Eric Allender, Shuichi Hirahara |
| 2017 | MFCS | Better Complexity Bounds for Cost Register Automata. | Eric Allender, Andreas Krebs, Pierre McKenzie |
| 2015 | LATA | Complexity of Regular Functions. | Eric Allender, Ian Mertz |
| 2015 | MFCS | Dual VP Classes. | Eric Allender, Anna Gl, Ian Mertz |
| 2015 | STACS | The Minimum Oracle Circuit Size Problem. | Eric Allender, Dhiraj Holden, Valentine Kabanets |
| 2014 | MFCS | Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. | Eric Allender, Nikhil Balaji, Samir Datta |
| 2014 | MFCS | Zero Knowledge and Circuit Minimization. | Eric Allender, Bireswar Das |
| 2012 | CiE | Curiouser and Curiouser: The Link between Incompressibility and Complexity. | Eric Allender |
| 2012 | MFCS | Reductions to the Set of Random Strings: The Resource-Bounded Case. | Eric Allender, Harry Buhrman, Luke Friedman, Bruno Loff |
| 2011 | ICALP | Limits on the Computational Power of Random Strings. | Eric Allender, Luke Friedman, William I. Gasarch |
| 2011 | ICALP | On the Power of Algebraic Branching Programs of Width Two. | Eric Allender, Fengming Wang |
| 2010 | CiE | Avoiding Simplicity Is Complex. | Eric Allender |
| 2008 | CSR | Cracks in the Defenses: Scouting Out Approaches on Circuit Lower Bounds. | Eric Allender |
| 2007 | CiE | Reachability Problems: An Update. | Eric Allender |
| 2005 | MFCS | The Complexity of Satisfiability Problems: Refining Schaefer's Theorem. | Eric Allender, Michael Bauland, Neil Immerman, Henning Schnoor, Heribert Vollmer |
| 2004 | STACS | What Can be Efficiently Reduced to the K-Random Strings? | Eric Allender, Harry Buhrman, Michal Kouck |
| 2002 | FOCS | Power from Random Strings. | Eric Allender, Harry Buhrman, Michal Kouck, Dieter van Melkebeek, Detlef Ronneburger |
| 2000 | STACS | The Complexity of Planarity Testing. | Eric Allender, Meena Mahajan |
| 1999 | ICALP | Bounded Depth Arithmetic Circuits: Counting and Closure. | Eric Allender, Andris Ambainis, David A. Mix Barrington, Samir Datta, Huong LeThanh |
| 1997 | FOCS | Making Nondeterminism Unambiguous. | Klaus Reinhardt, Eric Allender |
| 1997 | MFCS | The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes. | Martin Mundhenk, Judy Goldsmith, Eric Allender |
| 1997 | STOC | Reducing the Complexity of Reductions. | Manindra Agrawal, Eric Allender, Russell Impagliazzo, Toniann Pitassi, Steven Rudich |
| 1996 | COCOON | A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy (Extended Abstract). | Eric Allender |
| 1996 | ISAAC | StUSPACE(log n) <= DSPACE(log²n / log log n). | Eric Allender, Klaus-Jrn Lange |
| 1996 | STOC | The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract). | Eric Allender, Robert Beals, Mitsunori Ogihara |
| 1995 | MFCS | Measure on P: Robustness of the Notion. | Eric Allender, Martin Strauss |
| 1994 | FOCS | Measure on Small Complexity Classes, with Applications for BPP | Eric Allender, Martin Strauss |
| 1993 | STOC | Depth reduction for noncommutative arithmetic circuits. | Eric Allender, Jia Jiao |
| 1993 | STACS | A First-Order Isomorphism Theorem. | Eric Allender, Jos L. Balczar, Neil Immerman |
| 1991 | FCT | On Strong Separations from AC | Eric Allender, Vivek Gore |
| 1990 | MFCS | On the Power of Uniform Families of Constant Depth Treshold Circuits. | Eric Allender, Ulrich Hertrampf |
| 1990 | STACS | A Note on the Almost-Everywhere Hierarchy for Nondeterministic Time. | Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer |
| 1989 | FOCS | A Note on the Power of Threshold Circuits | Eric Allender |
| 1989 | ICALP | Limitations of the Upward Separation Technique (Preliminary Version). | Eric Allender |
| 1989 | ICALP | Lower Bounds for the Low Hierarchy (Extended Abstract). | Eric Allender, Lane A. Hemachandra |
| 1988 | CRYPTO | On Generating Solved Instances of Computational Problems. | Martn Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra |
| 1987 | STOC | Some Consequences of the Existence of Pseudorandom Generators | Eric Allender |
| 1986 | ICALP | Characterizations on PUNC and Precomputation (Extended Abstract). | Eric Allender |