Reed Solomon

600 total citations
29 papers, 281 citations indexed

About

Reed Solomon is a scholar working on Computational Theory and Mathematics, Geometry and Topology and Statistics and Probability. According to data from OpenAlex, Reed Solomon has authored 29 papers receiving a total of 281 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 16 papers in Geometry and Topology and 5 papers in Statistics and Probability. Recurrent topics in Reed Solomon's work include Computability, Logic, AI Algorithms (26 papers), semigroups and automata theory (18 papers) and Advanced Topology and Set Theory (16 papers). Reed Solomon is often cited by papers focused on Computability, Logic, AI Algorithms (26 papers), semigroups and automata theory (18 papers) and Advanced Topology and Set Theory (16 papers). Reed Solomon collaborates with scholars based in United States, New Zealand and Russia. Reed Solomon's co-authors include Steffen Lempp, С. С. Гончаров, Julia A. Knight, Valentina Harizanov, Russell Miller, Joseph S. Miller, Denis R. Hirschfeldt, Peter Cholak, Manuel Lerman and Alberto Marcone and has published in prestigious journals such as Advances in Mathematics, Bulletin of the London Mathematical Society and Proceedings of the American Mathematical Society.

In The Last Decade

Reed Solomon

25 papers receiving 251 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Reed Solomon United States 10 262 134 50 44 33 29 281
Alberto Marcone Italy 9 184 0.7× 111 0.8× 25 0.5× 53 1.2× 51 1.5× 32 218
Steffen Lempp United States 14 527 2.0× 169 1.3× 103 2.1× 154 3.5× 29 0.9× 77 543
Menachem Kojman Israel 9 149 0.6× 207 1.5× 12 0.2× 20 0.5× 98 3.0× 41 233
Lee Stanley Israel 6 143 0.5× 177 1.3× 8 0.2× 17 0.4× 101 3.1× 19 214
Toshiyasu Arai Japan 10 136 0.5× 51 0.4× 10 0.2× 79 1.8× 23 0.7× 42 181
Alexander Kreuzer Germany 8 47 0.2× 123 0.9× 14 0.3× 26 0.6× 20 0.6× 48 222
Mirna Džamonja United Kingdom 11 160 0.6× 276 2.1× 12 0.2× 19 0.4× 191 5.8× 59 322
Sebastiaan A. Terwijn Netherlands 10 371 1.4× 83 0.6× 109 2.2× 147 3.3× 26 0.8× 32 383
Árpád Száz Hungary 8 111 0.4× 58 0.4× 6 0.1× 24 0.5× 25 0.8× 44 194
Dan Saracino United States 9 87 0.3× 114 0.9× 7 0.1× 53 1.2× 39 1.2× 37 232

Countries citing papers authored by Reed Solomon

Since Specialization
Citations

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

Fields of papers citing papers by Reed Solomon

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Reed Solomon

This figure shows the co-authorship network connecting the top 25 collaborators of Reed Solomon. A scholar is included among the top collaborators of Reed Solomon 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 Reed Solomon. Reed Solomon 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.
Solomon, Reed, et al.. (2025). THE TREE PIGEONHOLE PRINCIPLE IN THE WEIHRAUCH DEGREES. Journal of Symbolic Logic. 1–23.
2.
Solomon, Reed, et al.. (2024). On the first-order parts of problems in the Weihrauch degrees. 1–13.
3.
Solomon, Reed, et al.. (2014). Degrees that Are Low for Isomorphism. 3(2). 73–89. 9 indexed citations
4.
Solomon, Reed, et al.. (2013). Degrees of orders on torsion-free Abelian groups. Annals of Pure and Applied Logic. 164(7-8). 822–836. 2 indexed citations
5.
Miller, Joseph S., et al.. (2012). Lowness notions, measure and domination. Journal of the London Mathematical Society. 85(3). 869–888. 20 indexed citations
6.
Solomon, Reed, et al.. (2011). The complexity of central series in nilpotent computable groups. Annals of Pure and Applied Logic. 162(8). 667–678. 2 indexed citations
7.
Lerman, Manuel, et al.. (2011). CAPPABLE CEA SETS AND RAMSEY'S THEOREM. 114–127.
8.
Lerman, Manuel, et al.. (2008). Self-Embeddings of Computable Trees. Notre Dame Journal of Formal Logic. 49(1). 2 indexed citations
9.
Гончаров, С. С., et al.. (2005). Enumerations in computable structure theory. Annals of Pure and Applied Logic. 136(3). 219–246. 56 indexed citations
10.
Lempp, Steffen, et al.. (2005). Computable categoricity of trees of finite height. Journal of Symbolic Logic. 70(1). 151–215. 19 indexed citations
11.
Cholak, Peter, Alberto Marcone, & Reed Solomon. (2004). Reverse mathematics and the equivalence of definitions for well and better quasi-orders. Journal of Symbolic Logic. 69(3). 683–712. 19 indexed citations
12.
Гончаров, С. С., Steffen Lempp, & Reed Solomon. (2003). The computable dimension of ordered abelian groups. Advances in Mathematics. 175(1). 102–143. 22 indexed citations
13.
Solomon, Reed. (2002). Π10 classes and orderable groups. Annals of Pure and Applied Logic. 115(1-3). 279–302. 5 indexed citations
14.
Lempp, Steffen, et al.. (2002). Group Theoretic Properties of the Group of Computable Automorphisms of a Countable Dense Linear Order. Order. 19(4). 343–364. 1 indexed citations
15.
Lempp, Steffen, et al.. (2002). THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS. Journal of Mathematical Logic. 2(2). 145–225. 1 indexed citations
16.
Downey, Rod, Denis R. Hirschfeldt, Steffen Lempp, & Reed Solomon. (2001). A Δ20 set with no infinite low subset in either it or its complement. Journal of Symbolic Logic. 66(3). 1371–1381. 19 indexed citations
17.
Solomon, Reed. (2001). – CA0 and order types of countable ordered groups. Journal of Symbolic Logic. 66(1). 192–206. 3 indexed citations
18.
Solomon, Reed. (1999). Ordered Groups: A Case Study in Reverse Mathematics. Bulletin of Symbolic Logic. 5(1). 45–58. 7 indexed citations
19.
Solomon, Reed. (1998). Reverse Mathematics and Fully Ordered Groups. Notre Dame Journal of Formal Logic. 39(2). 8 indexed citations
20.
Solomon, Reed. (1977). Families of sets and functions. Czechoslovak Mathematical Journal. 27(4). 556–559. 27 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

Breakdown of academic impact, for papers by Alberto Marcone Breakdown of academic impact, for papers by Steffen Lempp Breakdown of academic impact, for papers by Menachem Kojman Breakdown of academic impact, for papers by Lee Stanley Breakdown of academic impact, for papers by Toshiyasu Arai Breakdown of academic impact, for papers by Alexander Kreuzer Breakdown of academic impact, for papers by Mirna Džamonja Breakdown of academic impact, for papers by Sebastiaan A. Terwijn Breakdown of academic impact, for papers by Árpád Száz Breakdown of academic impact, for papers by Dan Saracino
Rankless by CCL
2026