Michael Stob

1.7k total citations
38 papers, 793 citations indexed

About

Michael Stob is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Geometry and Topology. According to data from OpenAlex, Michael Stob has authored 38 papers receiving a total of 793 indexed citations (citations by other indexed papers that have themselves been cited), including 26 papers in Computational Theory and Mathematics, 17 papers in Artificial Intelligence and 6 papers in Geometry and Topology. Recurrent topics in Michael Stob's work include Computability, Logic, AI Algorithms (23 papers), semigroups and automata theory (14 papers) and Machine Learning and Algorithms (14 papers). Michael Stob is often cited by papers focused on Computability, Logic, AI Algorithms (23 papers), semigroups and automata theory (14 papers) and Machine Learning and Algorithms (14 papers). Michael Stob collaborates with scholars based in United States, New Zealand and Switzerland. Michael Stob's co-authors include Daniel N. Osherson, Scott Weinstein, Rodney G. Downey, Rod Downey, Julia F. Knight, Edward E. Smith, Martin Davis, Wolfgang Maass, Richard A. Shore and Peter Cholak and has published in prestigious journals such as Management Science, Information Sciences and Machine Learning.

In The Last Decade

Michael Stob

38 papers receiving 711 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Michael Stob United States 16 486 482 76 50 46 38 793
Scott Weinstein United States 17 524 1.1× 981 2.0× 10 0.1× 66 1.3× 46 1.0× 53 1.3k
H. B. Enderton United States 6 440 0.9× 573 1.2× 65 0.9× 8 0.2× 6 0.1× 23 913
Benedikt Löwe Netherlands 13 283 0.6× 211 0.4× 131 1.7× 14 0.3× 7 0.2× 107 581
Jonathan Stavi Israel 7 515 1.1× 594 1.2× 71 0.9× 25 0.5× 19 0.4× 20 846
J. R. Shoenfield United States 11 874 1.8× 792 1.6× 228 3.0× 7 0.1× 5 0.1× 30 1.5k
Elliott Mendelson United States 11 443 0.9× 500 1.0× 31 0.4× 11 0.2× 3 0.1× 38 948
Haim Gaifman Israel 15 420 0.9× 585 1.2× 114 1.5× 6 0.1× 7 0.2× 46 994
J.F.A.K. van Benthem Netherlands 16 453 0.9× 971 2.0× 4 0.1× 35 0.7× 16 0.3× 82 1.3k
Richmond H. Thomason United States 20 372 0.8× 1.1k 2.3× 4 0.1× 26 0.5× 25 0.5× 79 1.6k
J. Michael Dunn United States 22 1.7k 3.4× 1.9k 4.0× 23 0.3× 15 0.3× 4 0.1× 61 2.5k

Countries citing papers authored by Michael Stob

Since Specialization
Citations

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

Fields of papers citing papers by Michael Stob

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Michael Stob

This figure shows the co-authorship network connecting the top 25 collaborators of Michael Stob. A scholar is included among the top collaborators of Michael Stob 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 Michael Stob. Michael Stob 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.
Knight, Julia F. & Michael Stob. (2000). Computable Boolean algebras. Journal of Symbolic Logic. 65(4). 1605–1623. 33 indexed citations
2.
Osherson, Daniel N., Michael Stob, & Scott Weinstein. (1994). Logic and learning. Conference on Learning Theory. 3–23. 1 indexed citations
3.
Osherson, Daniel N., et al.. (1994). Extrapolating human probability judgment. Theory and Decision. 36(2). 103–129. 18 indexed citations
4.
Downey, Rod & Michael Stob. (1993). Splitting theorems in recursion theory. Annals of Pure and Applied Logic. 65(1). 1–106. 25 indexed citations
5.
Downey, Rod & Michael Stob. (1993). Friedberg splittings of recursively enumerable sets. Annals of Pure and Applied Logic. 59(3). 175–199. 4 indexed citations
6.
Cholak, Peter, Rodney G. Downey, & Michael Stob. (1992). Automorphisms of the lattice of recursively enumerable sets: promptly simple sets. Transactions of the American Mathematical Society. 332(2). 555–570. 12 indexed citations
7.
Downey, Rodney G. & Michael Stob. (1992). Automorphisms of the lattice of recursively enumerable sets: Orbits. Advances in Mathematics. 92(2). 237–265. 23 indexed citations
8.
Osherson, Daniel N., Michael Stob, & Scott Weinstein. (1991). New directions in automated scientific discovery. Information Sciences. 57. 217–230. 4 indexed citations
9.
Osherson, Daniel N., Michael Stob, & Scott Weinstein. (1990). A mechanical method of successful scientific inquiry. Conference on Learning Theory. 187–201. 2 indexed citations
10.
Osherson, Daniel N., Michael Stob, & Scott Weinstein. (1989). On approximate truth. Conference on Learning Theory. 88–101. 1 indexed citations
11.
Osherson, Daniel N., Michael Stob, & Scott A. Weinstein. (1988). Synthesizing inductive expertise. Information and Computation. 77(2). 138–161. 9 indexed citations
12.
Osherson, Daniel N., Michael Stob, & Scott Weinstein. (1988). Mechanical learners pay a price for Bayesianism. Journal of Symbolic Logic. 53(4). 1245–1251. 4 indexed citations
13.
Osherson, Daniel N., Michael Stob, & Scott Weinstein. (1986). Aggregating inductive expertise. Information and Control. 70(1). 69–95. 19 indexed citations
14.
Stob, Michael. (1984). A Supplement to “A Mathematician's Guide to Popular Sports”. American Mathematical Monthly. 91(5). 277–282. 15 indexed citations
15.
Osherson, Daniel N., Michael Stob, & Scott Weinstein. (1983). Formal theories of language acquisition: practical and theoretical perspectives. International Joint Conference on Artificial Intelligence. 566–572. 3 indexed citations
16.
Maass, Wolfgang & Michael Stob. (1983). The intervals of the lattice of recursively enumerable sets determined by major subsets. Annals of Pure and Applied Logic. 24(2). 189–212. 14 indexed citations
17.
Stob, Michael. (1983). Wtt-degrees and T-degrees of r.e. sets. Journal of Symbolic Logic. 48(4). 921–930. 22 indexed citations
18.
Stob, Michael. (1982). Invariance of properties under automorphisms of the lattice of recursively enumerable sets. Pacific Journal of Mathematics. 100(2). 445–471. 19 indexed citations
19.
Osherson, Daniel N., Michael Stob, & Scott Weinstein. (1982). Learning strategies. Information and Control. 53(1-2). 32–51. 15 indexed citations
20.
Maass, Wolfgang, Richard A. Shore, & Michael Stob. (1981). Splitting properties and jump classes. Israel Journal of Mathematics. 39(3). 210–224. 22 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