World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
41
Citations
5123
World Ranking
8987
National Ranking
3815

Research.com Recognitions

  • 2006 - ACM Distinguished Member
  • 2006 - ACM Fellow For contributions to computational complexity theory.

Overview

Eric Allender is affiliated with Rutgers, The State University of New Jersey in the United States. Their research primarily falls within the field of Computer Science, with a focus on Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Computer Networks and Communications, and Molecular Biology.

They have made contributions across multiple main topics including:

  • Complexity and Algorithms in Graphs
  • Computability, Logic, AI Algorithms
  • Advanced Graph Theory Research
  • Low-power high-performance VLSI design
  • Machine Learning and Algorithms
  • Cryptography and Data Security
  • Semigroups and Automata Theory

Their publication record includes papers in notable venues, with frequent publications in:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Rutgers University Community Repository (Rutgers University)
  • New Zealand journal of mathematics
  • Acta Informatica
  • ACM SIGACT News

Recent papers authored by Eric Allender are:

  • "Pseudorandomness and the Minimum Circuit Size Problem," 2020, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Vaughan Jones, Kolmogorov Complexity, and the New Complexity Landscape around Circuit Minimization," 2021, New Zealand journal of mathematics
  • "One-Way Functions and a Conditional Variant of MKTP," 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • "Depth-first search in directed planar graphs, revisited," 2022, Acta Informatica
  • "The Non-hardness of Approximating Circuit Size," 2020, Theory of Computing Systems

Eric Allender has collaborated frequently with several researchers, including:

  • Samir Datta
  • Archit Chauhan
  • Harsha Tirumala
  • John Gouwar
  • Shuichi Hirahara

The scientist has been recognized with awards within the computing community, such as:

  • ACM Distinguished Member, 2006
  • ACM Fellow, 2006, for contributions to computational complexity theory

Best Publications

  • Relationships among $PL$, $\#L$, and the determinant

    Eric Allender;Mitsunori Ogihara

  • Uniform constant-depth threshold circuits for division and iterated multiplication

    William Hesse;Eric Allender;David A. Mix Barrington

  • On the Complexity of Numerical Analysis

    Eric Allender;Peter Bürgisser;Johan Kjeldgaard-Pedersen;Peter Bro Miltersen

  • Complexity of finite-horizon Markov decision process problems

    Martin Mundhenk;Judy Goldsmith;Christopher Lusena;Eric Allender

  • P-printable sets

    Eric W. Allender;Roy S. Rubinstein

  • Making Nondeterminism Unambiguous

    Klaus Reinhardt;Eric Allender

  • A note on the power of threshold circuits

    E. Allender

  • Power from Random Strings

    Eric Allender;Harry Buhrman;Michal Koucký;Dieter van Melkebeek

  • The complexity of matrix rank and feasible systems of linear equations

    Eric Allender;Robert Beals;Mitsunori Ogihara

  • The complexity of sparse sets in P

    Eric Allender

  • Non-commutative arithmetic circuits: depth reduction and size lower bounds

    Eric Allender;Jia Jiao;Meena Mahajan;V. Vinay

  • Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds

    Eric Allender;Klaus Reinhardt;Shiyu Zhou

  • Measure on small complexity classes, with applications for BPP

    E. Allender;M. Strauss

  • Amplifying lower bounds by means of self-reducibility

    Eric Allender;Michal Koucký

  • The complexity of satisfiability problems: Refining Schaefer's theorem

    Eric Allender;Michael Bauland;Neil Immerman;Henning Schnoor

  • On TC0, AC0, and Arithmetic Circuits

    Manindra Agrawal;Eric Allender;Samir Datta

  • The complexity of planarity testing

    Eric Allender;Meena Mahajan

  • Lower bounds for the low hierarchy

    Eric Allender;Lane A. Hemachandra

  • On the complexity of numerical analysis

    E. Allender;J. Kjeldgaard-Pedersen;P. Burgisser;P. Miltersen

  • Circuit Complexity before the Dawn of the New Millennium

    Eric Allender

  • Power from random strings

    E. Allender;H. Buhrman;M. Koucky;D. van Melkebeek

  • The complexity of matrix rank and feasible systems of linear equations (extended abstract)

    Eric Allender;Robert Beals;Mitsunori Ogihara

  • Amplifying Lower Bounds by Means of Self-Reducibility

    E. Allender;M. Koucky

Frequent Co-Authors

Harry Buhrman
Harry Buhrman University of Amsterdam
Toniann Pitassi
Toniann Pitassi Columbia University
Cristopher Moore
Cristopher Moore Santa Fe Institute
Mitsunori Ogihara
Mitsunori Ogihara University of Miami
Michael Saks
Michael Saks Rutgers, The State University of New Jersey
Neil Immerman
Neil Immerman University of Massachusetts Amherst
Osamu Watanabe
Osamu Watanabe Tokyo Institute of Technology
Martin J. Strauss
Martin J. Strauss University of Michigan–Ann Arbor
Peter Bro Miltersen
Peter Bro Miltersen Aarhus University
Russell Impagliazzo
Russell Impagliazzo University of California, San Diego

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA can open doors to many thriving career pathways. Many students start by looking into the best college majors for the future, helping them choose the right undergraduate degree that aligns with fast-growing fields and evolving job markets.

For those aiming to advance their qualifications, online graduate programs provide flexibility and accessibility. Some students might opt for easy masters programs to quickly upskill and boost their credentials without overcommitting their time and resources.

Cost and time are significant factors for professionals seeking higher education. Affordable options like a cheap doctorate degree online make it possible to reach the highest levels of academia without substantial financial strain.

Educators and leaders interested in management or curriculum innovation may consider online edd programs, which offer fast-track study options to help accelerate your progression into advanced educational roles.

Best Scientists Citing Eric Allender

Trending Scientists

Recently Published Articles