Leo Harrington

1.9k total citations
49 papers, 905 citations indexed

About

Leo Harrington is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Artificial Intelligence. According to data from OpenAlex, Leo Harrington has authored 49 papers receiving a total of 905 indexed citations (citations by other indexed papers that have themselves been cited), including 39 papers in Computational Theory and Mathematics, 27 papers in Geometry and Topology and 9 papers in Artificial Intelligence. Recurrent topics in Leo Harrington's work include Computability, Logic, AI Algorithms (33 papers), Advanced Topology and Set Theory (24 papers) and semigroups and automata theory (17 papers). Leo Harrington is often cited by papers focused on Computability, Logic, AI Algorithms (33 papers), Advanced Topology and Set Theory (24 papers) and semigroups and automata theory (17 papers). Leo Harrington collaborates with scholars based in United States, Canada and Israel. Leo Harrington's co-authors include Alexander S. Kechris, Yuri Gurevich, Saharon Shelah, Alain Louveau, Robert I. Soare, Peter Cholak, A. H. Lachlan, Steffen Lempp, S. Barry Cooper and David Marker and has published in prestigious journals such as Gastroenterology, Radiology and Transactions of the American Mathematical Society.

In The Last Decade

Leo Harrington

46 papers receiving 760 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Leo Harrington United States 15 676 505 248 223 77 49 905
Boban Veličković France 15 338 0.5× 375 0.7× 238 1.0× 119 0.5× 57 0.7× 34 542
A. H. Lachlan Canada 25 1.2k 1.8× 818 1.6× 217 0.9× 381 1.7× 232 3.0× 75 1.6k
C. Ward Henson United States 17 403 0.6× 451 0.9× 473 1.9× 92 0.4× 56 0.7× 54 776
Haim Judah Israel 11 453 0.7× 700 1.4× 387 1.6× 43 0.2× 87 1.1× 44 775
Fred Galvin United States 14 487 0.7× 492 1.0× 241 1.0× 46 0.2× 226 2.9× 56 806
Alain Louveau France 16 382 0.6× 731 1.4× 578 2.3× 37 0.2× 67 0.9× 33 896
Tomek Bartoszyński United States 11 472 0.7× 793 1.6× 445 1.8× 42 0.2× 102 1.3× 40 855
Sławomir Solecki United States 14 260 0.4× 620 1.2× 454 1.8× 88 0.4× 104 1.4× 60 784
J. K. Truss United Kingdom 12 310 0.5× 340 0.7× 142 0.6× 63 0.3× 111 1.4× 79 501
Erik Ellentuck United States 9 205 0.3× 218 0.4× 145 0.6× 45 0.2× 68 0.9× 46 397

Countries citing papers authored by Leo Harrington

Since Specialization
Citations

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

Fields of papers citing papers by Leo Harrington

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Leo Harrington

This figure shows the co-authorship network connecting the top 25 collaborators of Leo Harrington. A scholar is included among the top collaborators of Leo Harrington 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 Leo Harrington. Leo Harrington 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.
Cholak, Peter, Rodney G. Downey, & Leo Harrington. (2008). On the orbits of computably enumerable sets. Journal of the American Mathematical Society. 21(4). 1105–1135. 1 indexed citations
2.
Cholak, Peter & Leo Harrington. (2007). Extension theorems, orbits, and automorphisms of the computably enumerable sets. Transactions of the American Mathematical Society. 360(4). 1759–1791. 2 indexed citations
3.
Cholak, Peter & Leo Harrington. (2003). Isomorphisms of splits of computably enumerable sets. Journal of Symbolic Logic. 68(3). 1044–1064. 4 indexed citations
4.
Harrington, Leo & André Nies. (1998). Coding in the Partial Order of Enumerable Sets. Advances in Mathematics. 133(1). 133–162. 10 indexed citations
5.
Harrington, Leo & Robert I. Soare. (1998). Definable properties of the computably enumerable sets. Annals of Pure and Applied Logic. 94(1-3). 97–125. 3 indexed citations
6.
Staddon, Jessica & Leo Harrington. (1997). A combinatorial study of communication, storage and traceability in broadcast encryption systems. 3 indexed citations
7.
Downey, Rod & Leo Harrington. (1996). There is no fat orbit. Annals of Pure and Applied Logic. 80(3). 277–289. 6 indexed citations
8.
Cooper, S. Barry, Leo Harrington, A. H. Lachlan, Steffen Lempp, & Robert I. Soare. (1991). The d.r.e. degrees are not dense. Annals of Pure and Applied Logic. 55(2). 125–151. 37 indexed citations
9.
Harrington, Leo, David Marker, & Saharon Shelah. (1988). Borel orderings. Transactions of the American Mathematical Society. 310(1). 293–302. 19 indexed citations
10.
Baldwin, John T. & Leo Harrington. (1987). Trivial pursuit: Remarks on the main gap. Annals of Pure and Applied Logic. 34(3). 209–230. 8 indexed citations
11.
Cherlin, Gregory, Leo Harrington, & A. H. Lachlan. (1985). ℵ0-Categorical, ℵ0-stable structures. Annals of Pure and Applied Logic. 28(2). 103–135. 3 indexed citations
12.
Harrington, Leo, et al.. (1984). Fundamentals of forking. Annals of Pure and Applied Logic. 26(3). 245–286. 35 indexed citations
13.
Gurevich, Yuri & Leo Harrington. (1982). Automata, Trees, and Games. 60–65. 8 indexed citations
14.
Gurevich, Yuri & Leo Harrington. (1982). Trees, automata, and games. 60–65. 140 indexed citations
15.
Harrington, Leo & Alexander S. Kechris. (1981). On the determinacy of games on ordinals. Annals of Mathematical Logic. 20(2). 109–154. 30 indexed citations
16.
Harrington, Leo. (1977). Long projective wellorderings. Annals of Mathematical Logic. 12(1). 1–24. 40 indexed citations
17.
Harrington, Leo, et al.. (1977). Flipping properties: A unifying thread in the theory of large cardinals. Annals of Mathematical Logic. 12(1). 25–58. 17 indexed citations
18.
Harrington, Leo & Alexander S. Kechris. (1977). $Π^1_2$ singletons and $O^#$. Fundamenta Mathematicae. 95(3). 167–171. 4 indexed citations
19.
Harrington, Leo & Thomas Jech. (1976). On Σ1 well-orderings of the universe. Journal of Symbolic Logic. 41(1). 167–170. 1 indexed citations
20.
Harrington, Leo, et al.. (1952). The significance of the post-fat Cholecystogram. The American Journal of Digestive Diseases. 19(9). 284–286. 1 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