Stuart A. Kurtz
- Computational Theory and Mathematics top 1%
- Artificial Intelligence top 5%
- Geometry and Topology top 10%
- Computer Networks and Communications
- Electrical and Electronic Engineering
- Co-authors
- Lance FortnowStephen FennerJames S. RoyerStephen R. MahaneyJoan BoyarMark W. KrentelCarl H. SmithRodney G. Downey
- Topics
- Computability, Logic, AI Algorithms (22 papers)Complexity and Algorithms in Graphs (16 papers)semigroups and automata theory (9 papers)
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceDiscrete Mathematics and Combinatorics
- Partner nations
- United StatesGermanyLatvia
In The Last Decade
Stuart A. Kurtz
37 papers receiving 486 citations
Peers
Comparison fields: 5 of 41
- Computational Theory and Mathematics 468
- Artificial Intelligence 327
- Geometry and Topology 34
- Computer Networks and Communications 33
- Electrical and Electronic Engineering 27
Countries citing papers authored by Stuart A. Kurtz
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
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
| # | Work | Indexed citations |
|---|---|---|
| 1 | 2 | |
| 2 | 4 | |
| 3 | 9 | |
| 4 | 19 | |
| 5 | 4 | |
| 6 | 13 | |
| 7 | 94 | |
| 8 | 26 | |
| 9 | 17 | |
| 10 | The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract) | 6 |
| 11 | 10 | |
| 12 | 7 | |
| 13 | 23 | |
| 14 | 8 | |
| 15 | Progress on collapsing degrees. | 10 |
| 16 | 4 | |
| 17 | A discrete logarithm implementation of zero-knowledge blobs | 10 |
| 18 | 12 | |
| 19 | 14 | |
| 20 | 8 |
About Stuart A. Kurtz
Stuart A. Kurtz is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Algebra and Number Theory, having authored 39 papers that have together received 541 indexed citations. Recurring topics across this work include Computability, Logic, AI Algorithms (22 papers), Complexity and Algorithms in Graphs (16 papers) and semigroups and automata theory (9 papers). The work is most often cited by research in Computational Theory and Mathematics (468 citations), Artificial Intelligence (327 citations) and Discrete Mathematics and Combinatorics (17 citations). Stuart A. Kurtz has collaborated with scholars based in United States, Germany and Latvia. Frequent 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. Their work appears in journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.
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.