Eric Allender
Orcid: 0000-0002-0650-028XAffiliations:
- Rutgers University, USA
According to our database1,
Eric Allender
authored at least 149 papers
between 1985 and 2023.
Collaborative distances:
Collaborative distances:
Awards
ACM Fellow
ACM Fellow 2006, "For contributions to computational complexity theory.".
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2023
Guest Column: Parting Thoughts and Parting Shots (Read On for Details on How to Win Valuable Prizes!
SIGACT News, March, 2023
Theor. Comput. Sci., 2023
2022
Electron. Colloquium Comput. Complex., 2022
Electron. Colloquium Comput. Complex., 2022
On the Complexity of Algebraic Numbers, and the Bit-Complexity of Straight-Line Programs.
Electron. Colloquium Comput. Complex., 2022
2021
Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021
2020
Electron. Colloquium Comput. Complex., 2020
A Note on Hardness under Projections for Graph Isomorphism and Time-Bounded Kolmogorov Complexity.
Electron. Colloquium Comput. Complex., 2020
Electron. Colloquium Comput. Complex., 2020
Proceedings of the Complexity and Approximation - In Memory of Ker-I Ko, 2020
2019
Proceedings of the Approximation, 2019
2018
Electron. Colloquium Comput. Complex., 2018
2017
Electron. Colloquium Comput. Complex., 2017
Electron. Colloquium Comput. Complex., 2017
Bull. EATCS, 2017
2016
2015
2014
Introduction to the Special Issue on Innovations in Theoretical Computer Science 2012 - Part II.
ACM Trans. Comput. Theory, 2014
Corrigendum to "Uniform constant-depth threshold circuits for division and iterated multiplication" [J. Comput. System Sci. 65(4) (2002) 695-716].
J. Comput. Syst. Sci., 2014
Complexity Theory.
Proceedings of the Computing Handbook, 2014
2013
Introduction to the special issue on innovations in theoretical computer science 2012.
ACM Trans. Comput. Theory, 2013
Theory Comput. Syst., 2013
Low-depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs.
Electron. Colloquium Comput. Complex., 2013
Chic. J. Theor. Comput. Sci., 2013
2012
Electron. Colloquium Comput. Complex., 2012
Electron. Colloquium Comput. Complex., 2012
Proceedings of the How the World Computes, 2012
2011
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory.
J. Comput. Syst. Sci., 2011
2010
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
Exposition of the Muchnik-Positselsky Construction of a Prefix Free Entropy Function that is not Complete under Truth-Table Reductions.
Electron. Colloquium Comput. Complex., 2010
Electron. Colloquium Comput. Complex., 2010
2009
Special Section On The Thirty-Ninth Annual ACM Symposium On Theory Of Computing (STOC 2007).
SIAM J. Comput., 2009
J. Comput. Syst. Sci., 2009
2008
Proceedings of the Wiley Encyclopedia of Computer Science and Engineering, 2008
Minimizing Disjunctive Normal Form Formulas and AC<sup>0</sup> Circuits Given a Truth Table.
SIAM J. Comput., 2008
Electron. Colloquium Comput. Complex., 2008
Circuit Complexity, Kolmogorov Complexity, and Prospects for Lower Bounds.
Proceedings of the 10th International Workshop on Descriptional Complexity of Formal Systems, 2008
Proceedings of the Computer Science, 2008
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008
2007
Proceedings of the Computation and Logic in the Real World, 2007
2006
Theor. Comput. Sci., 2006
Proceedings of the 21st Annual IEEE Conference on Computational Complexity (CCC 2006), 2006
2005
Electron. Colloquium Comput. Complex., 2005
Special issue, final part "Conference on <i>Computational Complexity</i> 2004 " Guest Editor's foreword.
Comput. Complex., 2005
Comput. Complex., 2005
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005
2004
Electron. Colloquium Comput. Complex., 2004
Proceedings of the STACS 2004, 2004
2003
Comput. Complex., 2003
Proceedings of the 18th Annual IEEE Conference on Computational Complexity (Complexity 2003), 2003
2002
J. Comput. Syst. Sci., 2002
A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics.
Proceedings of the Advances in Neural Information Processing Systems 15 [Neural Information Processing Systems, 2002
2001
Electron. Colloquium Comput. Complex., 2001
Electron. Colloquium Comput. Complex., 2001
The Division Breakthroughs.
Bull. EATCS, 2001
Proceedings of the FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science, 2001
Some Pointed Questions Concerning Asymptotic Lower Bounds, and News from the Isomorphism Front.
Proceedings of the Current Trends in Theoretical Computer Science, 2001
2000
Report on the annual summer meeting of the New Zealand mathematics research institute.
SIGACT News, 2000
J. Comput. Syst. Sci., 2000
Electron. Colloquium Comput. Complex., 2000
Chic. J. Theor. Comput. Sci., 2000
1999
J. Comput. Syst. Sci., 1999
Electron. Colloquium Comput. Complex., 1999
Electron. Colloquium Comput. Complex., 1999
Chic. J. Theor. Comput. Sci., 1999
Comput. Complex., 1999
Proceedings of the Algorithms and Theory of Computation Handbook., 1999
Proceedings of the Algorithms and Theory of Computation Handbook., 1999
Proceedings of the Algorithms and Theory of Computation Handbook., 1999
1998
Theor. Comput. Sci., 1998
RUSPACE(log <i>n</i>) $\subseteq$ DSPACE (log<sup>2</sup> <i>n</i> / log log <i>n</i>).
Theory Comput. Syst., 1998
J. Comput. Syst. Sci., 1998
Electron. Colloquium Comput. Complex., 1998
Electron. Colloquium Comput. Complex., 1998
News from the Isomorphism Front.
Bull. EATCS, 1998
1997
The Complexity of Policy Evaluation for Finite-Horizon Partially-Observable Markov Decision Processes.
Proceedings of the Mathematical Foundations of Computer Science 1997, 1997
1996
RAIRO Theor. Informatics Appl., 1996
Electron. Colloquium Comput. Complex., 1996
Electron. Colloquium Comput. Complex., 1996
Electron. Colloquium Comput. Complex., 1996
The Complexity of Matrix Rank and Feasible Systems of Linear Equations (Extended Abstract).
Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, 1996
Proceedings of the Algorithms and Computation, 7th International Symposium, 1996
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1996
A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy (Extended Abstract).
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996
1995
1994
Electron. Colloquium Comput. Complex., 1994
1993
Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993
Theor. Comput. Sci., 1993
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993
1992
1991
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991
1990
Counting Hierarchies: Polynomial Time and Constant.
Bull. EATCS, 1990
Proceedings of the STACS 90, 1990
Proceedings of the Algorithms, 1990
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990
Proceedings of the Advances In Computational Complexity Theory, 1990
Proceedings of the Proceedings: Fifth Annual Structure in Complexity Theory Conference, 1990
1989
J. Comput. Syst. Sci., 1989
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989
Proceedings of the Automata, Languages and Programming, 16th International Colloquium, 1989
Proceedings of the 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October, 1989
Proceedings of the Proceedings: Fourth Annual Structure in Complexity Theory Conference, 1989
1988
Proceedings of the Advances in Cryptology, 1988
1986
Proceedings of the Automata, Languages and Programming, 13th International Colloquium, 1986
Proceedings of the Structure in Complexity Theory, 1986
1985
Discret. Appl. Math., 1985