James S. Royer

40 papers A* 7C 3Journal 22Unranked 6
YearRankTypeTitle / Venue / Authors
2022 J jnl
General Ramified Recurrence and Polynomial-time Completeness.
CoRR
Norman Danner, James S. Royer
2016 C conf
Program Size Complexity of Correction Grammars in the Ershov Hierarchy.
CiE
John Case, James S. Royer
2013 — conf
A static cost analysis for a higher-order language.
PLPV
Norman Danner, Jennifer Paykin, James S. Royer
2012 J jnl
Ramified Structural Recursion and Corecursion
CoRR
Norman Danner, James S. Royer
2012 J jnl
Semi-automatic complexity analysis of a higher-order language
CoRR
Norman Danner, Jennifer Paykin, James S. Royer
2011 J jnl
Axiomatizing Resource Bounds for Measure
CoRR
Xiaoyang Gu, Jack H. Lutz, Satyadev Nandakumar, James S. Royer
2011 C conf
Axiomatizing Resource Bounds for Measure.
CiE
Xiaoyang Gu, Jack H. Lutz, Satyadev Nandakumar, James S. Royer
2009 J jnl
Two Algorithms in Search of a Type-System.
Theory Comput. Syst.
Norman Danner, James S. Royer
2007 J jnl
Adventures in time and space.
Log. Methods Comput. Sci.
Norman Danner, James S. Royer
2007 C conf
Time-Complexity Semantics for Feasible Affine Recursions.
CiE
Norman Danner, James S. Royer
2007 J jnl
Time-complexity semantics for feasible affine recursions (extended abstract)
CoRR
Norman Danner, James S. Royer
2007 J jnl
Two algorithms in search of a type system
CoRR
Norman Danner, James S. Royer
2006 J jnl
Adventures in time and space
CoRR
Norman Danner, James S. Royer
2006 A* conf
Adventures in time and space.
POPL
Norman Danner, James S. Royer
2006 J jnl
Generality's price: Inescapable deficiencies in machine-learned programs.
Ann. Pure Appl. Log.
John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle, James S. Royer
2004 J jnl
Every polynomial-time 1-degree collapses if and only if P = PSPACE.
J. Symb. Log.
Stephen A. Fenner, Stuart A. Kurtz, James S. Royer
2004 J jnl
On the computational complexity of Longley's H functional.
Theor. Comput. Sci.
James S. Royer
2003 A* conf
Generality's Price: Inescapable Deficiencies in Machine-Learned Programs.
COLT
John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle, James S. Royer
2001 J jnl
On characterizations of the basic feasible functionals (Part I).
J. Funct. Program.
Robert J. Irwin, James S. Royer, Bruce M. Kapron
1998 J jnl
A Hierarchy Based on Output Multiplicity.
Theor. Comput. Sci.
Ashish V. Naik, John D. Rogers, James S. Royer, Alan L. Selman
1997 J jnl
Semantics vs Syntax vs Computations: Machine Models for Type-2 Polynomial-Time Bounded Functionals.
J. Comput. Syst. Sci.
James S. Royer
1996 — conf
Active transport in biological computing.
DNA Based Computers
Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer, Janos Simon
1995 J jnl
On Closure Properties of Bounded Two-Sided Error Complexity Classes.
Math. Syst. Theory
Kenneth W. Regan, James S. Royer
1995 — conf
Semantics versus Syntax versus Computations.
SCT
James S. Royer
1995 J jnl
The Isomorphism Conjecture Fails Relative to a Random Oracle.
J. ACM
Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
1994 — book
Subrecursive programming systems - complexity and succinctness.
James S. Royer, John Case
1993 J jnl
On A-Truth-Table-Hard Languages.
Theor. Comput. Sci.
Steven Homer, Stuart A. Kurtz, James S. Royer
1992 — conf
Average Dependence and Random Oracles.
SCT
Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
1989 A* conf
Every Polynomial-Time 1-Degree Collapses iff P=PSPACE
FOCS
Stephen A. Fenner, Stuart A. Kurtz, James S. Royer
1989 A* conf
The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract)
STOC
Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
1989 — conf
The Isomorphism Conjecture Fails Relative to a Random Oracle (abstract).
SCT
Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
1989 J jnl
Two Recursion Theoretic Characterizations of Proof Speed-Ups.
J. Symb. Log.
James S. Royer
1988 J jnl
Collapsing Degrees.
J. Comput. Syst. Sci.
Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
1988 A* conf
On the Power of 1-way Functions (Abstract).
CRYPTO
Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
1988 A* conf
Prudence in Language Learning.
COLT
Stuart A. Kurtz, James S. Royer
1987 — book
A Connotational Theory of Program Structure
James S. Royer
1987 J jnl
How to Prove Representation-Independent Independence Results.
Inf. Process. Lett.
Stuart A. Kurtz, Michael J. O'Donnell, James S. Royer
1987 — conf
Progress on collapsing degrees.
SCT
Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
1986 A* conf
Collapsing Degrees (Extended Abstract)
FOCS
Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
1986 J jnl
Inductive Inference of Approximations
Inf. Control.
James S. Royer