Stuart A. Kurtz

1.2k total citations
39 papers, 541 citations indexed

About

Stuart A. Kurtz is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Molecular Biology. According to data from OpenAlex, Stuart A. Kurtz has authored 39 papers receiving a total of 541 indexed citations (citations by other indexed papers that have themselves been cited), including 30 papers in Computational Theory and Mathematics, 21 papers in Artificial Intelligence and 3 papers in Molecular Biology. Recurrent topics in Stuart A. Kurtz's work include Computability, Logic, AI Algorithms (22 papers), Complexity and Algorithms in Graphs (16 papers) and semigroups and automata theory (9 papers). Stuart A. Kurtz is often cited by papers focused on Computability, Logic, AI Algorithms (22 papers), Complexity and Algorithms in Graphs (16 papers) and semigroups and automata theory (9 papers). Stuart A. Kurtz collaborates with scholars based in United States, Germany and Latvia. Stuart A. Kurtz's co-authors include Lance Fortnow, Stephen Fenner, James S. Royer, Stephen R. Mahaney, Joan Boyar, Mark W. Krentel, Carl H. Smith, Rodney G. Downey, Steven Homer and Martin Kummer and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Stuart A. Kurtz

37 papers receiving 486 citations

Peers

Stuart A. Kurtz
V. Arvind India
Stuart A. Kurtz
Citations per year, relative to Stuart A. Kurtz Stuart A. Kurtz (= 1×) peers V. Arvind

Countries citing papers authored by Stuart A. Kurtz

Since Specialization
Citations

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

Fields of papers citing papers by Stuart A. Kurtz

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of Stuart A. Kurtz

This figure shows the co-authorship network connecting the top 25 collaborators of Stuart A. Kurtz. A scholar is included among the top collaborators of Stuart A. Kurtz 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 Stuart A. Kurtz. Stuart A. Kurtz 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.
Feldman, Ariel J., et al.. (2017). Lemonade from Lemons. ACM SIGARCH Computer Architecture News. 45(2). 361–374. 2 indexed citations
2.
Feldman, Ariel J., et al.. (2017). Lemonade from Lemons. 361–374. 4 indexed citations
3.
Fenner, Stephen, et al.. (2003). An oracle builder’s toolkit. Information and Computation. 182(2). 95–136. 9 indexed citations
4.
Fenner, Stephen, et al.. (2002). On oracle builder's toolkit. 120–131. 19 indexed citations
5.
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
6.
Fenner, Stephen, Lance Fortnow, & Stuart A. Kurtz. (1996). The Isomorphism Conjecture Holds Relative to an Oracle. SIAM Journal on Computing. 25(1). 193–206. 13 indexed citations
7.
Fenner, Stephen, Lance Fortnow, & Stuart A. Kurtz. (1994). Gap-definable counting classes. Journal of Computer and System Sciences. 48(1). 116–148. 94 indexed citations
8.
Fortnow, Lance, Sanjay Jain, Efim Kinber, et al.. (1994). Extremes in the degrees of inferability. Annals of Pure and Applied Logic. 66(3). 231–276. 26 indexed citations
9.
Homer, Steven, Stuart A. Kurtz, & James S. Royer. (1993). On 1-truth-table-hard languages. Theoretical Computer Science. 115(2). 383–389. 17 indexed citations
10.
Kurtz, Stuart A., Stephen R. Mahaney, & James S. Royer. (1989). The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract). 157–166. 6 indexed citations
11.
Kurtz, Stuart A. & Carl H. Smith. (1989). On the role of search for learning. Conference on Learning Theory. 303–311. 10 indexed citations
12.
Fenner, Stephen, et al.. (1989). Every polynomial-time 1-degree collapses iff P=PSPACE. 624–629. 7 indexed citations
13.
Kurtz, Stuart A., Stephen R. Mahaney, & James S. Royer. (1988). Collapsing degrees. Journal of Computer and System Sciences. 37(2). 247–268. 23 indexed citations
14.
Kurtz, Stuart A. & James S. Royer. (1988). Prudence in language learning. Conference on Learning Theory. 206–219. 8 indexed citations
15.
Kurtz, Stuart A., Stephen R. Mahaney, & James S. Royer. (1987). Progress on collapsing degrees.. 126–131. 10 indexed citations
16.
Kurtz, Stuart A., Stephen R. Mahaney, & James S. Royer. (1987). Progress on Collapsing Degrees Extended Abstract. 126–131. 4 indexed citations
17.
Boyar, Joan, Mark W. Krentel, & Stuart A. Kurtz. (1987). A discrete logarithm implementation of zero-knowledge blobs. 10 indexed citations
18.
Kurtz, Stuart A.. (1987). A Note on Randomized Polynomial Time. SIAM Journal on Computing. 16(5). 852–853. 12 indexed citations
19.
Downey, Rodney G. & Stuart A. Kurtz. (1986). Recursion theory and ordered groups. Annals of Pure and Applied Logic. 32. 137–151. 14 indexed citations
20.
Kurtz, Stuart A.. (1982). On the random oracle hypothesis. 224–230. 8 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