 | 2007 |
|---|
| 28 |       | Norman Danner,
James S. Royer:
Time-Complexity Semantics for Feasible Affine Recursions.
CiE 2007: 205-217 |
| 27 | | Norman Danner,
James S. Royer:
Two algorithms in search of a type system
CoRR abs/0710.0824: (2007) |
| 26 | | Norman Danner,
James S. Royer:
Time-complexity semantics for feasible affine recursions (extended abstract)
CoRR abs/cs/0701076: (2007) |
| 25 | | Norman Danner,
James S. Royer:
Adventures in time and space.
Logical Methods in Computer Science 3(1): (2007) |
| 2006 |
|---|
| 24 | | Norman Danner,
James S. Royer:
Adventures in time and space.
POPL 2006: 168-179 |
| 23 | | John Case,
Keh-Jiann Chen,
Sanjay Jain,
Wolfgang Merkle,
James S. Royer:
Generality's price: Inescapable deficiencies in machine-learned programs.
Ann. Pure Appl. Logic 139(1-3): 303-326 (2006) |
| 22 | | Norman Danner,
James S. Royer:
Adventures in time and space
CoRR abs/cs/0612116: (2006) |
| 2004 |
|---|
| 21 | | James S. Royer:
On the computational complexity of Longley's H functional.
Theor. Comput. Sci. 318(1-2): 225-241 (2004) |
| 2003 |
|---|
| 20 | | John Case,
Keh-Jiann Chen,
Sanjay Jain,
Wolfgang Merkle,
James S. Royer:
Generality's Price: Inescapable Deficiencies in Machine-Learned Programs.
COLT 2003: 684-698 |
| 2001 |
|---|
| 19 |  | Robert J. Irwin,
James S. Royer,
Bruce M. Kapron:
On characterizations of the basic feasible functionals (Part I).
J. Funct. Program. 11(1): 117-153 (2001) |
| 1998 |
|---|
| 18 | | Ashish V. Naik,
John D. Rogers,
James S. Royer,
Alan L. Selman:
A Hierarchy Based on Output Multiplicity.
Theor. Comput. Sci. 207(1): 131-157 (1998) |
| 1997 |
|---|
| 17 | | James S. Royer:
Semantics vs Syntax vs Computations: Machine Models for Type-2 Polynomial-Time Bounded Functionals.
J. Comput. Syst. Sci. 54(3): 424-436 (1997) |
| 1995 |
|---|
| 16 | | James S. Royer:
Semantics versus Syntax versus Computations.
Structure in Complexity Theory Conference 1995: 37-48 |
| 15 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
The Isomorphism Conjecture Fails Relative to a Random Oracle.
J. ACM 42(2): 401-420 (1995) |
| 14 | | Kenneth W. Regan,
James S. Royer:
On Closure Properties of Bounded Two-Sided Error Complexity Classes.
Mathematical Systems Theory 28(3): 229-243 (1995) |
| 1993 |
|---|
| 13 | | Steven Homer,
Stuart A. Kurtz,
James S. Royer:
On A-Truth-Table-Hard Languages.
Theor. Comput. Sci. 115(2): 383-389 (1993) |
| 1992 |
|---|
| 12 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
Average Dependence and Random Oracles.
Structure in Complexity Theory Conference 1992: 306-317 |
| 1989 |
|---|
| 11 | | Stephen A. Fenner,
Stuart A. Kurtz,
James S. Royer:
Every Polynomial-Time 1-Degree Collapses iff P=PSPACE
FOCS 1989: 624-629 |
| 10 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract)
STOC 1989: 157-166 |
| 9 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
The Isomorphism Conjecture Fails Relative to a Random Oracle (abstract).
Structure in Complexity Theory Conference 1989: 2 |
| 8 | | James S. Royer:
Two Recursion Theoretic Characterizations of Proof Speed-Ups.
J. Symb. Log. 54(2): 522-526 (1989) |
| 1988 |
|---|
| 7 | | Stuart A. Kurtz,
James S. Royer:
Prudence in Language Learning.
COLT 1988: 206-219 |
| 6 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
On the Power of 1-way Functions (Abstract).
CRYPTO 1988: 578-579 |
| 5 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
Collapsing Degrees.
J. Comput. Syst. Sci. 37(2): 247-268 (1988) |
| 1987 |
|---|
| 4 | | James S. Royer:
A Connotational Theory of Program Structure
Springer 1987 |
| 3 | | Stuart A. Kurtz,
Michael J. O'Donnell,
James S. Royer:
How to Prove Representation-Independent Independence Results.
Inf. Process. Lett. 24(1): 5-10 (1987) |
| 1986 |
|---|
| 2 | | Stuart A. Kurtz,
Stephen R. Mahaney,
James S. Royer:
Collapsing Degrees (Extended Abstract)
FOCS 1986: 380-389 |
| 1 | | James S. Royer:
Inductive Inference of Approximations
Information and Control 70(2/3): 156-178 (1986) |
