John Rhodes

2.4k total citations
77 papers, 1.3k citations indexed

About

John Rhodes is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, John Rhodes has authored 77 papers receiving a total of 1.3k indexed citations (citations by other indexed papers that have themselves been cited), including 65 papers in Computational Theory and Mathematics, 23 papers in Artificial Intelligence and 20 papers in Geometry and Topology. Recurrent topics in John Rhodes's work include semigroups and automata theory (58 papers), Advanced Algebra and Logic (23 papers) and Computability, Logic, AI Algorithms (21 papers). John Rhodes is often cited by papers focused on semigroups and automata theory (58 papers), Advanced Algebra and Logic (23 papers) and Computability, Logic, AI Algorithms (21 papers). John Rhodes collaborates with scholars based in United States, Canada and United Kingdom. John Rhodes's co-authors include Kenneth Krohn, Benjamin Steinberg, Bret Tilson, Jean-Camille Birget, Chrystopher L. Nehaniv, Stuart Margolis, Jean-Éric Pin, Pascal Weil, Rudolph E. Langer and Ron Graham and has published in prestigious journals such as Proceedings of the National Academy of Sciences, Annals of Mathematics and Philosophical Transactions of the Royal Society A Mathematical Physical and Engineering Sciences.

In The Last Decade

John Rhodes

71 papers receiving 1.2k citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
John Rhodes United States 20 1.1k 458 405 182 99 77 1.3k
Dominique Perrin France 16 1.2k 1.2× 897 2.0× 129 0.3× 435 2.4× 59 0.6× 90 1.5k
M. P. Schützenberger France 21 1.4k 1.3× 1.0k 2.3× 314 0.8× 333 1.8× 287 2.9× 43 1.9k
Benjamin Steinberg Canada 19 934 0.9× 285 0.6× 666 1.6× 124 0.7× 233 2.4× 121 1.2k
Bruno Leclerc France 13 238 0.2× 115 0.3× 257 0.6× 47 0.3× 204 2.1× 37 660
Michael Drmota Austria 16 256 0.2× 275 0.6× 133 0.3× 72 0.4× 82 0.8× 72 920
M. Lothaire United Kingdom 2 912 0.9× 678 1.5× 193 0.5× 285 1.6× 112 1.1× 3 1.2k
John Myhill United States 16 849 0.8× 536 1.2× 221 0.5× 65 0.4× 50 0.5× 40 1.2k
Ákos Seress United States 20 361 0.3× 650 1.4× 358 0.9× 25 0.1× 96 1.0× 85 1.2k
Jack H. Koolen South Korea 18 614 0.6× 378 0.8× 873 2.2× 48 0.3× 87 0.9× 171 1.5k
David A. Klarner United States 15 295 0.3× 111 0.2× 154 0.4× 42 0.2× 92 0.9× 46 685

Countries citing papers authored by John Rhodes

Since Specialization
Citations

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

Fields of papers citing papers by John Rhodes

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of John Rhodes

This figure shows the co-authorship network connecting the top 25 collaborators of John Rhodes. A scholar is included among the top collaborators of John Rhodes 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 John Rhodes. John Rhodes 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.
Rhodes, John, et al.. (2011). An effective lower bound for group complexity of finite semigroups and automata. Transactions of the American Mathematical Society. 364(4). 1815–1857. 4 indexed citations
2.
Rhodes, John & Pedro V. Silva. (2008). Turing machines and bimachines. Theoretical Computer Science. 400(1-3). 182–224. 1 indexed citations
3.
Rhodes, John, et al.. (1990). Reduction theorem for the Type-II conjecture for finite monoids. Journal of Pure and Applied Algebra. 67(3). 269–284. 3 indexed citations
4.
Rhodes, John & Bret Tilson. (1989). The kernel of monoid morphisms. Journal of Pure and Applied Algebra. 62(3). 227–268. 48 indexed citations
5.
Rhodes, John & Pascal Weil. (1989). Decomposition techniques for finite semigroups, using categories I. Journal of Pure and Applied Algebra. 62(3). 269–284. 20 indexed citations
6.
Rhodes, John, et al.. (1988). Prime decomposition theorem for arbitrary semigroups: general holonomy decomposition and synthesis theorem. Journal of Pure and Applied Algebra. 55(1-2). 127–172. 13 indexed citations
7.
Rhodes, John. (1986). Infinite iteration of matrix semigroups I. Structure theorem for torsion semigroups. Journal of Algebra. 98(2). 422–451. 9 indexed citations
8.
Rhodes, John. (1986). Infinite iteration of matrix semigroups II. Structure theorem for arbitrary semigroups up to aperiodic morphism. Journal of Algebra. 100(1). 25–137. 23 indexed citations
9.
Birget, Jean-Camille & John Rhodes. (1984). Almost finite expansions of arbitrary semigroups. Journal of Pure and Applied Algebra. 32(3). 239–287. 64 indexed citations
10.
Rhodes, John. (1977). Kernel systems—A global study of homomorphisms on finite semigroups. Journal of Algebra. 49(1). 1–45. 16 indexed citations
11.
Rhodes, John & Bret Tilson. (1972). Improved lower bounds for the complexity of finite semigroups. Journal of Pure and Applied Algebra. 2(1). 13–71. 34 indexed citations
12.
Rhodes, John & Bret Tilson. (1971). Lower bounds for complexity of finite semigroups. Journal of Pure and Applied Algebra. 1(1). 79–95. 25 indexed citations
13.
Rhodes, John. (1971). Proof of the Fundamental Lemma of Complexity (weak version) for arbitrary finite semigroups. Journal of Combinatorial Theory Series A. 10(1). 22–73. 14 indexed citations
14.
Rhodes, John. (1970). Algebraic theory of finite semigroups. French digital mathematics library (Numdam). 23(2). 10 indexed citations
15.
Rhodes, John & Eliahu Shamir. (1968). Complexity of grammars by group theoretic methods. Journal of Combinatorial Theory. 4(3). 222–239. 4 indexed citations
16.
Krohn, Kenneth, Rudolph E. Langer, & John Rhodes. (1967). Algebraic principles for the analysis of a biochemical system. Journal of Computer and System Sciences. 1(2). 119–136. 26 indexed citations
17.
Krohn, Kenneth, Willi Maurer, & John Rhodes. (1966). Realizing complex boolean functions with simple groups. Information and Control. 9(2). 190–195. 8 indexed citations
18.
Rhodes, John, et al.. (1965). A Property of Finite Simple Non-Abelian Groups. Proceedings of the American Mathematical Society. 16(3). 552–552. 1 indexed citations
19.
Rhodes, John, et al.. (1965). A property of finite simple non-abelian groups. Proceedings of the American Mathematical Society. 16(3). 552–554. 31 indexed citations
20.
Krohn, Kenneth & John Rhodes. (1965). Nets of threshold elements. Information and Control. 8(6). 579–588. 3 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