James S. Royer

1.2k total citations
30 papers, 473 citations indexed

About

James S. Royer is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, James S. Royer has authored 30 papers receiving a total of 473 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 18 papers in Artificial Intelligence and 2 papers in Computer Networks and Communications. Recurrent topics in James S. Royer's work include Computability, Logic, AI Algorithms (17 papers), Complexity and Algorithms in Graphs (9 papers) and Logic, programming, and type systems (9 papers). James S. Royer is often cited by papers focused on Computability, Logic, AI Algorithms (17 papers), Complexity and Algorithms in Graphs (9 papers) and Logic, programming, and type systems (9 papers). James S. Royer collaborates with scholars based in United States, Singapore and Germany. James S. Royer's co-authors include Stuart A. Kurtz, Arun Sharma, Daniel N. Osherson, Sanjay K. Jain, Stephen R. Mahaney, John Case, Steven Homer, Robert J. Irwin, Bruce M. Kapron and Alan L. Selman and has published in prestigious journals such as Journal of the ACM, Theoretical Computer Science and Journal of Computer and System Sciences.

In The Last Decade

James S. Royer

27 papers receiving 439 citations

Peers

James S. Royer
Arun Sharma Australia
Félix Bou Spain
Jean-Philippe Bernardy Sweden
Dale Gerdemann Germany
Nelma Moreira Portugal
Gregory E. Shannon United States
Seiki Akama Japan
Claus-Peter Schnorr Germany
Joachim Niehren Germany
Christian Choffrut France
Arun Sharma Australia
James S. Royer
Citations per year, relative to James S. Royer James S. Royer (= 1×) peers Arun Sharma

Countries citing papers authored by James S. Royer

Since Specialization
Citations

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

Fields of papers citing papers by James S. Royer

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authorship network of co-authors of James S. Royer

This figure shows the co-authorship network connecting the top 25 collaborators of James S. Royer. A scholar is included among the top collaborators of James S. Royer 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 James S. Royer. James S. Royer 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.
Royer, James S., et al.. (2009). Two Algorithms in Search of a Type-System. Theory of Computing Systems. 45(4). 787–821. 2 indexed citations
2.
Case, John, Sanjay Jain, Wolfgang Merkle, & James S. Royer. (2006). Generality’s price: Inescapable deficiencies in machine-learned programs. 1 indexed citations
3.
Fenner, Stephen, Stuart A. Kurtz, & James S. Royer. (2004). Every polynomial-time 1-degree collapses if and only if P = PSPACE. Journal of Symbolic Logic. 69(3). 713–741.
4.
Royer, James S.. (2003). On the computational complexity of Longley's H functional. Theoretical Computer Science. 318(1-2). 225–241. 3 indexed citations
5.
6.
Irwin, Robert J., James S. Royer, & Bruce M. Kapron. (2001). On characterizations of the basic feasible functionals, Part I. Journal of Functional Programming. 11(1). 117–153. 15 indexed citations
7.
Jain, Sanjay K., Daniel N. Osherson, James S. Royer, & Arun Sharma. (1999). Systems That Learn. The MIT Press eBooks. 67 indexed citations
8.
Royer, James S., Sanjay K. Jain, Arun Sharma, & Daniel N. Osherson. (1999). Systems That Learn: An Introduction to Learning Theory. Medical Entomology and Zoology. 101 indexed citations
9.
Naik, Ashish V., John D. Rogers, James S. Royer, & Alan L. Selman. (1998). A hierarchy based on output multiplicity. Theoretical Computer Science. 207(1). 131–157. 11 indexed citations
10.
Royer, James S. & John Case. (1994). Subrecursive Programming Systems: Complexity & Succinctness. Medical Entomology and Zoology. 35 indexed citations
11.
Royer, James S. & John Case. (1994). Subrecursive Programming Systems. Birkhäuser Boston eBooks. 24 indexed citations
12.
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
13.
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
14.
Royer, James S.. (1989). Two recursion theoretic characterizations of proof speed-ups. Journal of Symbolic Logic. 54(2). 522–526. 1 indexed citations
15.
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
16.
Kurtz, Stuart A. & James S. Royer. (1988). Prudence in language learning. Conference on Learning Theory. 206–219. 8 indexed citations
17.
Kurtz, Stuart A., Stephen R. Mahaney, & James S. Royer. (1987). Progress on collapsing degrees.. 126–131. 10 indexed citations
18.
Kurtz, Stuart A., Stephen R. Mahaney, & James S. Royer. (1987). Progress on Collapsing Degrees Extended Abstract. 126–131. 4 indexed citations
19.
Royer, James S.. (1987). A Connotational Theory of Program Structure. Lecture notes in computer science. 32 indexed citations
20.
Kurtz, Stuart A., Michael J. O’Donnell, & James S. Royer. (1987). How to prove representation-independent independence results. Information Processing Letters. 24(1). 5–10. 5 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 Arun Sharma Breakdown of academic impact, for papers by Félix Bou Breakdown of academic impact, for papers by Jean-Philippe Bernardy Breakdown of academic impact, for papers by Dale Gerdemann Breakdown of academic impact, for papers by Nelma Moreira Breakdown of academic impact, for papers by Gregory E. Shannon Breakdown of academic impact, for papers by Seiki Akama Breakdown of academic impact, for papers by Claus-Peter Schnorr Breakdown of academic impact, for papers by Joachim Niehren Breakdown of academic impact, for papers by Christian Choffrut
Rankless by CCL
2026