Kenneth W. Regan

757 total citations
47 papers, 269 citations indexed

About

Kenneth W. Regan is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Economics and Econometrics. According to data from OpenAlex, Kenneth W. Regan has authored 47 papers receiving a total of 269 indexed citations (citations by other indexed papers that have themselves been cited), including 32 papers in Computational Theory and Mathematics, 29 papers in Artificial Intelligence and 6 papers in Economics and Econometrics. Recurrent topics in Kenneth W. Regan's work include semigroups and automata theory (13 papers), Complexity and Algorithms in Graphs (13 papers) and Computability, Logic, AI Algorithms (13 papers). Kenneth W. Regan is often cited by papers focused on semigroups and automata theory (13 papers), Complexity and Algorithms in Graphs (13 papers) and Computability, Logic, AI Algorithms (13 papers). Kenneth W. Regan collaborates with scholars based in United States, United Kingdom and Germany. Kenneth W. Regan's co-authors include D. Sivakumar, Michael R. Fellows, Rodney G. Downey, Giuseppe Di Fatta, Jacobo Torán, Ashish V. Naik, Jin‐Yi Cai, Johannes Köbler, Heribert Vollmer and Thomas Schwentick and has published in prestigious journals such as Neurocomputing, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Kenneth W. Regan

46 papers receiving 248 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Kenneth W. Regan United States 10 181 145 33 20 18 47 269
Monroe Newborn Canada 8 44 0.2× 112 0.8× 43 1.3× 25 1.3× 3 0.2× 20 174
Angelo Gilio Italy 15 211 1.2× 491 3.4× 8 0.2× 21 1.1× 9 0.5× 41 537
Arcot Rajasekar United States 9 159 0.9× 319 2.2× 5 0.2× 95 4.8× 10 0.6× 32 408
Étienne Birmelé France 7 45 0.2× 54 0.4× 5 0.2× 20 1.0× 6 0.3× 26 221
Juan Carlos González Moreno Spain 6 93 0.5× 139 1.0× 2 0.1× 29 1.4× 2 0.1× 14 178
Antti Hyttinen Finland 9 37 0.2× 163 1.1× 7 0.2× 19 0.9× 6 0.3× 29 237
Verena Heidrich-Meisner Germany 8 43 0.2× 125 0.9× 3 0.1× 13 0.7× 3 0.2× 21 211
Piotr Kulicki Poland 8 29 0.2× 156 1.1× 5 0.2× 20 1.0× 11 0.6× 35 211
David Stoutamire United States 5 100 0.6× 363 2.5× 6 0.2× 101 5.0× 2 0.1× 8 413
Erik Talvitie United States 8 18 0.1× 127 0.9× 8 0.2× 8 0.4× 2 0.1× 16 140

Countries citing papers authored by Kenneth W. Regan

Since Specialization
Citations

This map shows the geographic impact of Kenneth W. Regan'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 Kenneth W. Regan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Kenneth W. Regan more than expected).

Fields of papers citing papers by Kenneth W. Regan

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Kenneth W. Regan. 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 Kenneth W. Regan. The network helps show where Kenneth W. Regan may publish in the future.

Co-authorship network of co-authors of Kenneth W. Regan

This figure shows the co-authorship network connecting the top 25 collaborators of Kenneth W. Regan. A scholar is included among the top collaborators of Kenneth W. Regan 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 Kenneth W. Regan. Kenneth W. Regan is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Regan, Kenneth W., et al.. (2015). Quantifying Depth and Complexity of Thinking and Knowledge. 602–607. 3 indexed citations
2.
Regan, Kenneth W., et al.. (2015). Measuring Level-K Reasoning, Satisficing, and Human Error in Game-Play Data. 9 indexed citations
3.
Regan, Kenneth W., et al.. (2014). Human and Computer Preferences at Chess.. National Conference on Artificial Intelligence. 6 indexed citations
4.
Regan, Kenneth W., et al.. (2008). A nonlinear lower bound for constant depth arithmetical circuits via the discrete uncertainty principle. Theoretical Computer Science. 409(3). 617–622. 3 indexed citations
5.
Liu, Hong & Kenneth W. Regan. (2006). Improved construction for universality of determinant and permanent. Information Processing Letters. 100(6). 233–237. 3 indexed citations
6.
Regan, Kenneth W.. (2002). Understanding the Mulmuley-Sohoni Approach to P vs. NP.. Bulletin of the European Association for Theoretical Computer Science. 78. 86–99. 5 indexed citations
7.
Regan, Kenneth W.. (2002). On the difference between Turing machine time and random-access machine time. 36–40. 1 indexed citations
8.
Regan, Kenneth W.. (2002). On superlinear lower bounds in complexity theory. a. 50–64.
9.
Regan, Kenneth W., et al.. (2002). UPSILON: Universal Programming System with Incomplete Lazy Object Notation. Fundamenta Informaticae. 50(3-4). 325–359. 1 indexed citations
10.
Downey, Rodney G., Michael R. Fellows, & Kenneth W. Regan. (1998). Parameterized circuit complexity and the W hierarchy. Theoretical Computer Science. 191(1-2). 97–115. 19 indexed citations
11.
Regan, Kenneth W.. (1996). Linear Time and Memory-Efficient Computation. SIAM Journal on Computing. 25(1). 133–168. 3 indexed citations
12.
Köbler, Johannes, et al.. (1995). The Power of the Middle Bit of a #P Function. Journal of Computer and System Sciences. 50(3). 456–467. 29 indexed citations
13.
Regan, Kenneth W.. (1994). Linear Speed-Up, Information Vicinity, and Finite-State Machines. Scopus. 609–614. 4 indexed citations
14.
Regan, Kenneth W.. (1994). Linear-Time Algorithms in Memory Hierarchies.. IFIP Congress. 288–293. 1 indexed citations
15.
Regan, Kenneth W.. (1993). Efficient Reductions from NP to Parity using Error-Correcting Codes. 1 indexed citations
16.
Regan, Kenneth W.. (1992). Minimum-complexity pairing functions. Journal of Computer and System Sciences. 45(3). 285–295. 7 indexed citations
17.
Regan, Kenneth W.. (1992). Diagonalization, uniformity, and fixed-point theorems. Information and Computation. 98(1). 1–40. 4 indexed citations
18.
Regan, Kenneth W.. (1990). You Can’t Build That Here: The Constitutionality of Aesthetic Zoning and Architectural Review. Fordham law review. 58(5). 1013. 3 indexed citations
19.
Regan, Kenneth W.. (1989). Finitary Substructure Languages.. 7(1). 87–96. 4 indexed citations
20.
Regan, Kenneth W.. (1988). The topology of provability in complexity theory. Journal of Computer and System Sciences. 36(3). 384–432. 9 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

Rankless by CCL
2026