Eric Allender

3.3k total citations
117 papers, 1.4k citations indexed

About

Eric Allender is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Eric Allender has authored 117 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 103 papers in Computational Theory and Mathematics, 56 papers in Artificial Intelligence and 13 papers in Computer Networks and Communications. Recurrent topics in Eric Allender's work include Complexity and Algorithms in Graphs (72 papers), Computability, Logic, AI Algorithms (47 papers) and semigroups and automata theory (34 papers). Eric Allender is often cited by papers focused on Complexity and Algorithms in Graphs (72 papers), Computability, Logic, AI Algorithms (47 papers) and semigroups and automata theory (34 papers). Eric Allender collaborates with scholars based in United States, Netherlands and India. Eric Allender's co-authors include Michal Koucký, Mitsunori Ogihara, David A. Mix Barrington, Klaus Reinhardt, Judy Goldsmith, Martin Mundhenk, Lane A. Hemachandra, Manindra Agrawal, Ulrich Hertrampf and Samir Datta and has published in prestigious journals such as Journal of the ACM, Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences and SIAM Journal on Computing.

In The Last Decade

Eric Allender

108 papers receiving 1.2k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Eric Allender United States	20	1.2k	802	180	88	52	117	1.4k
Alan L. Selman United States	25	1.6k 1.4×	1.1k 1.4×	215 1.2×	82 0.9×	39 0.8×	91	1.9k
Lane A. Hemachandra United States	17	771 0.7×	567 0.7×	146 0.8×	87 1.0×	42 0.8×	55	983
Miklós Sántha France	17	665 0.6×	1.0k 1.3×	92 0.5×	72 0.8×	31 0.6×	68	1.2k
Ravi B. Boppana United States	13	744 0.6×	532 0.7×	216 1.2×	117 1.3×	46 0.9×	26	1.1k
Prasad Raghavendra United States	19	689 0.6×	358 0.4×	256 1.4×	70 0.8×	66 1.3×	57	950
Christopher Umans United States	14	536 0.5×	597 0.7×	147 0.8×	107 1.2×	15 0.3×	36	829
Ker‐I Ko United States	20	1.3k 1.1×	687 0.9×	307 1.7×	105 1.2×	102 2.0×	82	1.7k
Richard Beigel United States	24	1.3k 1.1×	1.0k 1.3×	285 1.6×	128 1.5×	43 0.8×	97	1.7k
Amir Yehudayoff Israel	15	514 0.4×	410 0.5×	90 0.5×	74 0.8×	48 0.9×	88	755
Ilan Newman Israel	23	1.1k 0.9×	687 0.9×	429 2.4×	113 1.3×	48 0.9×	86	1.4k

Countries citing papers authored by Eric Allender

Since Specialization

Citations

This map shows the geographic impact of Eric Allender's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Eric Allender with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eric Allender more than expected).

Fields of papers citing papers by Eric Allender

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Eric Allender. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Eric Allender. The network helps show where Eric Allender may publish in the future.

Co-authorship network of co-authors of Eric Allender

This figure shows the co-authorship network connecting the top 25 collaborators of Eric Allender. A scholar is included among the top collaborators of Eric Allender based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Eric Allender. Eric Allender is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Allender, Eric, et al.. (2024). Robustness for Space-Bounded Statistical Zero Knowledge. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 17(1). 1–25.

Allender, Eric, et al.. (2022). Cryptographic hardness under projections for time-bounded Kolmogorov complexity. Theoretical Computer Science. 940. 206–224. 2 indexed citations

Allender, Eric, et al.. (2022). Depth-first search in directed planar graphs, revisited. Acta Informatica. 59(4). 289–319. 1 indexed citations

Allender, Eric, et al.. (2021). One-Way Functions and a Conditional Variant of MKTP. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 4 indexed citations

Allender, Eric, et al.. (2020). The Non-hardness of Approximating Circuit Size. Theory of Computing Systems. 65(3). 559–578. 3 indexed citations

Allender, Eric, et al.. (2020). A note on hardness under projections for graph isomorphism and time-bounded Kolmogorov complexity. View. 27. 158. 1 indexed citations

Allender, Eric, Andreas Krebs, & Pierre McKenzie. (2018). Better Complexity Bounds for Cost Register Automata. Theory of Computing Systems. 63(3). 367–385. 1 indexed citations

Allender, Eric, Andreas Krebs, & Pierre McKenzie. (2017). Better Complexity Bounds for Cost Register Automata. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations

Allender, Eric, et al.. (2015). Arithmetic circuit classes over Z m. View. 22. 145. 1 indexed citations

10.

Allender, Eric, et al.. (2014). Reductions to the set of random strings: The resource-bounded case. Logical Methods in Computer Science. Volume 10, Issue 3. 1 indexed citations

11.

Allender, Eric, et al.. (2014). Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs. View. 20. 177. 1 indexed citations

12.

Allender, Eric, et al.. (2012). Kolmogorov Complexity, Circuits, and the Strength of Formal Theories of Arithmetic. View. 19. 28. 1 indexed citations

13.

Allender, Eric & Michal Koucký. (2008). Amplifying Lower Bounds by Means of Self-Reducibility.. Electronic colloquium on computational complexity. 15. 1 indexed citations

14.

Allender, Eric, Sanjeev Arora, Michael Kearns, Cristopher Moore, & Alexander Russell. (2002). A Note on the Representational Incompatibility of Function Approximation and Factored Dynamics. Neural Information Processing Systems. 15. 447–454. 2 indexed citations

15.

Agrawal, Manindra, Eric Allender, Samir Datta, Heribert Vollmer, & Klaus W. Wagner. (2000). Characterizing Small Depth and Small Space Classes by Operators of Higher Type.. 2000. 3 indexed citations

16.

Allender, Eric. (1998). News from the Isomorphism Front.. Bulletin of the European Association for Theoretical Computer Science. 66. 73. 2 indexed citations

17.

Allender, Eric & Shiyu Zhou. (1998). Uniform Inclusions in Nondeterministic Logspace. Electronic colloquium on computational complexity. 5. 2 indexed citations

18.

Allender, Eric. (1996). A Note on Uniform Circuit Lower Bounds for the Counting Hierarchy. Electronic colloquium on computational complexity. 3. 5 indexed citations

19.

Agrawal, Manindra & Eric Allender. (1996). An Isomorphism Theorem for Circuit Complexity. Electronic colloquium on computational complexity. 3. 1 indexed citations

20.

Allender, Eric & Klaus W. Wagner. (1990). Counting Hierarchies: Polynomial Time and Constant.. Bulletin of the European Association for Theoretical Computer Science. 40. 182–194. 5 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact