Collapsing Degrees (Extended Abstract) - Stuart A. Kurtz; Stephen R. Mahaney; James S. Royer (FOCS, 1986)

Inductive Inference of Approximations - James S. Royer (Inf. Control., 1986)

A Connotational Theory of Program Structure - James S. Royer (Springer, 1987)

Progress on collapsing degrees. - Stuart A. Kurtz; Stephen R. Mahaney; James S. Royer (SCT, 1987)

How to Prove Representation-Independent Independence Results. - Stuart A. Kurtz; Michael J. O'Donnell; James S. Royer (Inf. Process. Lett., 1987)

Prudence in Language Learning. - Stuart A. Kurtz; James S. Royer (COLT, 1988)

On the Power of 1-way Functions (Abstract). - Stuart A. Kurtz; Stephen R. Mahaney; James S. Royer (CRYPTO, 1988)

Collapsing Degrees. - Stuart A. Kurtz; Stephen R. Mahaney; James S. Royer (J. Comput. Syst. Sci., 1988)

The Isomorphism Conjecture Fails Relative to a Random Oracle (abstract). - Stuart A. Kurtz; Stephen R. Mahaney; James S. Royer (SCT, 1989)

Every Polynomial-Time 1-Degree Collapses iff P=PSPACE - Stephen A. Fenner; Stuart A. Kurtz; James S. Royer (FOCS, 1989)

The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract) - Stuart A. Kurtz; Stephen R. Mahaney; James S. Royer (STOC, 1989)

Two Recursion Theoretic Characterizations of Proof Speed-Ups. - James S. Royer (J. Symb. Log., 1989)

Average Dependence and Random Oracles. - Stuart A. Kurtz; Stephen R. Mahaney; James S. Royer (SCT, 1992)

On A-Truth-Table-Hard Languages. - Steven Homer; Stuart A. Kurtz; James S. Royer (Theor. Comput. Sci., 1993)

Subrecursive programming systems - complexity and succinctness. - James S. Royer; John Case (Birkhäuser, 1994)

Semantics versus Syntax versus Computations. - James S. Royer (SCT, 1995)

The Isomorphism Conjecture Fails Relative to a Random Oracle. - Stuart A. Kurtz; Stephen R. Mahaney; James S. Royer (J. ACM, 1995)

On Closure Properties of Bounded Two-Sided Error Complexity Classes. - Kenneth W. Regan; James S. Royer (Math. Syst. Theory, 1995)

Active transport in biological computing. - Stuart A. Kurtz; Stephen R. Mahaney; James S. Royer; Janos Simon (DNA Based Computers, 1996)

Semantics vs Syntax vs Computations: Machine Models for Type-2 Polynomial-Time Bounded Functionals. - James S. Royer (J. Comput. Syst. Sci., 1997)

A Hierarchy Based on Output Multiplicity. - Ashish V. Naik; John D. Rogers; James S. Royer; Alan L. Selman (Theor. Comput. Sci., 1998)

On characterizations of the basic feasible functionals (Part I). - Robert J. Irwin; James S. Royer; Bruce M. Kapron (J. Funct. Program., 2001)

Every polynomial-time 1-degree collapses if and only if P = PSPACE. - Stephen A. Fenner; Stuart A. Kurtz; James S. Royer (J. Symb. Log., 2004)

On the computational complexity of Longley's H functional. - James S. Royer (Theor. Comput. Sci., 2004)

Generality's price: Inescapable deficiencies in machine-learned programs. - John Case; Keh-Jiann Chen; Sanjay Jain 001; Wolfgang Merkle; James S. Royer (Ann. Pure Appl. Log., 2006)

Time-Complexity Semantics for Feasible Affine Recursions. - Norman Danner; James S. Royer (CiE, 2007)

Time-complexity semantics for feasible affine recursions (extended abstract) - Norman Danner; James S. Royer (CoRR, 2007)

Adventures in time and space. - Norman Danner; James S. Royer (Log. Methods Comput. Sci., 2007)

Two Algorithms in Search of a Type-System. - Norman Danner; James S. Royer (Theory Comput. Syst., 2009)

Axiomatizing Resource Bounds for Measure. - Xiaoyang Gu; Jack H. Lutz; Satyadev Nandakumar; James S. Royer (CiE, 2011)

Ramified Structural Recursion and Corecursion - Norman Danner; James S. Royer (CoRR, 2012)

Semi-automatic complexity analysis of a higher-order language - Norman Danner; Jennifer Paykin; James S. Royer (CoRR, 2012)

A static cost analysis for a higher-order language. - Norman Danner; Jennifer Paykin; James S. Royer (PLPV, 2013)

Program Size Complexity of Correction Grammars in the Ershov Hierarchy. - John Case; James S. Royer (CiE, 2016)

General Ramified Recurrence and Polynomial-time Completeness. - Norman Danner; James S. Royer (CoRR, 2022)