This map shows the geographic impact of Frank Stephan'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 Frank Stephan with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Frank Stephan more than expected).
This network shows the impact of papers produced by Frank Stephan. 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 Frank Stephan. The network helps show where Frank Stephan may publish in the future.
Co-authorship network of co-authors of Frank Stephan
This figure shows the co-authorship network connecting the top 25 collaborators of Frank Stephan.
A scholar is included among the top collaborators of Frank Stephan 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 Frank Stephan. Frank Stephan is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Hölzl, Rupert, Wolfgang Merkle, Joseph S. Miller, Frank Stephan, & Liang Yu. (2019). CHAITIN’S Ω AS A CONTINUOUS FUNCTION. Journal of Symbolic Logic. 85(1). 486–510.
Beigel, Richard, Harry Buhrman, Lance Fortnow, et al.. (2004). Enumerations of the Kolmogorov Function. UvA-DARE (University of Amsterdam).1 indexed citations
15.
Stephan, Frank, et al.. (2003). Meta-S: A Strategy-Oriented Meta-Solver Framework.. The Florida AI Research Society. 177–181.4 indexed citations
Beigel, Richard, et al.. (2000). The Complexity of Odd$^A_n$. Journal of Symbolic Logic. 65(1). 1–18.1 indexed citations
18.
Stephan, Frank. (1998). Learning via queries and oracles. Annals of Pure and Applied Logic. 94(1-3). 273–296.3 indexed citations
19.
Fortnow, Lance, William Gasarch, Martin Kummer, et al.. (1998). On the relative sizes of learnable sets. Theoretical Computer Science. 197(1-2). 139–156.4 indexed citations
20.
Stephan, Frank, et al.. (1959). Action de l'insuffisance thyroïdienne sur l'excrétion rénale de l'eau, du sodium et du potassium chez le rat.. Comptes rendus hebdomadaires des séances de l Académie des sciences. 248(8).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.