Eric Allender

Eric Allender

Rutgers, The State University of New Jersey

H-index: 44

North America-United States

About Eric Allender

Eric Allender, With an exceptional h-index of 44 and a recent h-index of 19 (since 2020), a distinguished researcher at Rutgers, The State University of New Jersey, specializes in the field of Computational Complexity Theory.

His recent articles reflect a diverse array of research interests and contributions to the field:

Kolmogorov complexity characterizes statistical zero knowledge

Robustness for space-bounded statistical zero knowledge

On the complexity of algebraic numbers, and the bit-complexity of straight-line programs 1

Guest Column: Parting Thoughts and Parting Shots (Read On for Details on How to Win Valuable Prizes!

Cryptographic hardness under projections for time-bounded Kolmogorov complexity

Depth-first search in directed planar graphs, revisited

Vaughan Jones, Kolmogorov Complexity, and the new complexity landscape around circuit minimization

The non-hardness of approximating circuit size

Eric Allender Information

University

Position

___

Citations(all)

5375

Citations(since 2020)

1134

Cited By

4634

hIndex(all)

44

hIndex(since 2020)

19

i10Index(all)

83

i10Index(since 2020)

31

Email

University Profile Page

Rutgers, The State University of New Jersey

Google Scholar

View Google Scholar Profile

Eric Allender Skills & Research Interests

Computational Complexity Theory

Top articles of Eric Allender

Title

Journal

Author(s)

Publication Date

Kolmogorov complexity characterizes statistical zero knowledge

Eric Allender

Shuichi Hirahara

Harsha Tirumala

2023

Robustness for space-bounded statistical zero knowledge

LIPIcs: Leibniz international proceedings in informatics

Eric Allender

Jacob Gray

Saachi Mutreja

Harsha Tirumala

Pengxiang Wang

2023/9/4

On the complexity of algebraic numbers, and the bit-complexity of straight-line programs 1

Computability

Eric Allender

Nikhil Balaji

Samir Datta

Rameshwar Pratap

2023/6/21

Guest Column: Parting Thoughts and Parting Shots (Read On for Details on How to Win Valuable Prizes!

ACM SIGACT News

Eric Allender

2023/3/1

Cryptographic hardness under projections for time-bounded Kolmogorov complexity

Theoretical computer science

Eric Allender

John Gouwar

Shuichi Hirahara

Caleb Robelle

2023/1/9

Depth-first search in directed planar graphs, revisited

Acta informatica

Eric Allender

Archit Chauhan

Samir Datta

2022/8

Vaughan Jones, Kolmogorov Complexity, and the new complexity landscape around circuit minimization

New Zealand journal of mathematics

Eric Allender

2021/9/22

The non-hardness of approximating circuit size

Theory of computing systems

Eric Allender

Rahul Ilango

Neekon Vafa

2021/4

One-way functions and a conditional variant of MKTP

41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2021)

Eric Allender

Mahdi Cheraghchi

Dimitrios Myrisiotis

Harsha Tirumala

Ilya Volkovoch

2021

A note on hardness under projections for graph isomorphism and time-bounded Kolmogorov complexity

Eric Allender

Azucena Garvıa Bosshard

Amulya Musipatla

2020/10/26

Ker-I Ko and the study of resource-bounded Kolmogorov complexity

Eric Allender

2020/2/21

See List of Professors in Eric Allender University(Rutgers, The State University of New Jersey)

Co-Authors

H-index: 57
Michael Saks

Michael Saks

Rutgers, The State University of New Jersey

H-index: 56
Mitsunori Ogihara

Mitsunori Ogihara

University of Miami

H-index: 46
Lane A. Hemaspaandra (premarriage name: Hemachandra)

Lane A. Hemaspaandra (premarriage name: Hemachandra)

University of Rochester

H-index: 46
Osamu Watanabe

Osamu Watanabe

Tokyo Institute of Technology

H-index: 44
Neil Immerman

Neil Immerman

University of Massachusetts Amherst

H-index: 33
Heribert Vollmer

Heribert Vollmer

Leibniz Universität Hannover

academic-engine