default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJames S. Royer
Person information
- affiliation: Syracuse University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[i7]Norman Danner, James S. Royer:
General Ramified Recurrence and Polynomial-time Completeness. CoRR abs/2205.10348 (2022)
2010 – 2019
- 2016
- [c16]John Case, James S. Royer:
Program Size Complexity of Correction Grammars in the Ershov Hierarchy. CiE 2016: 240-250 - 2013
- [c15]Norman Danner, Jennifer Paykin, James S. Royer:
A static cost analysis for a higher-order language. PLPV 2013: 25-34 - 2012
- [i6]Norman Danner, James S. Royer:
Ramified Structural Recursion and Corecursion. CoRR abs/1201.4567 (2012) - [i5]Norman Danner, Jennifer Paykin, James S. Royer:
Semi-automatic complexity analysis of a higher-order language. CoRR abs/1206.3523 (2012) - 2011
- [c14]Xiaoyang Gu, Jack H. Lutz, Satyadev Nandakumar
, James S. Royer:
Axiomatizing Resource Bounds for Measure. CiE 2011: 102-111 - [i4]Xiaoyang Gu, Jack H. Lutz, Satyadev Nandakumar, James S. Royer:
Axiomatizing Resource Bounds for Measure. CoRR abs/1102.2095 (2011)
2000 – 2009
- 2009
- [j15]Norman Danner, James S. Royer:
Two Algorithms in Search of a Type-System. Theory Comput. Syst. 45(4): 787-821 (2009) - 2007
- [j14]Norman Danner, James S. Royer:
Adventures in time and space. Log. Methods Comput. Sci. 3(1) (2007) - [c13]Norman Danner, James S. Royer:
Time-Complexity Semantics for Feasible Affine Recursions. CiE 2007: 205-217 - [i3]Norman Danner, James S. Royer:
Two algorithms in search of a type system. CoRR abs/0710.0824 (2007) - [i2]Norman Danner, James S. Royer:
Time-complexity semantics for feasible affine recursions (extended abstract). CoRR abs/cs/0701076 (2007) - 2006
- [j13]John Case, Keh-Jiann Chen, Sanjay Jain, Wolfgang Merkle, James S. Royer:
Generality's price: Inescapable deficiencies in machine-learned programs. Ann. Pure Appl. Log. 139(1-3): 303-326 (2006) - [c12]Norman Danner, James S. Royer:
Adventures in time and space. POPL 2006: 168-179 - [i1]Norman Danner, James S. Royer:
Adventures in time and space. CoRR abs/cs/0612116 (2006) - 2004
- [j12]Stephen A. Fenner, Stuart A. Kurtz, James S. Royer:
Every polynomial-time 1-degree collapses if and only if P = PSPACE. J. Symb. Log. 69(3): 713-741 (2004) - [j11]James S. Royer:
On the computational complexity of Longley's H functional. Theor. Comput. Sci. 318(1-2): 225-241 (2004) - 2003
- [c11]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
- [j10]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)
1990 – 1999
- 1998
- [j9]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
- [j8]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) - 1996
- [c10]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer, Janos Simon:
Active transport in biological computing. DNA Based Computers 1996: 171-179 - 1995
- [j7]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) - [j6]Kenneth W. Regan, James S. Royer:
On Closure Properties of Bounded Two-Sided Error Complexity Classes. Math. Syst. Theory 28(3): 229-243 (1995) - [c9]James S. Royer:
Semantics versus Syntax versus Computations. SCT 1995: 37-48 - 1994
- [b2]James S. Royer, John Case:
Subrecursive programming systems - complexity and succinctness. Progress in theoretical computer science, Birkhäuser 1994, ISBN 978-3-7643-3767-4, pp. I-VII, 1-252 - 1993
- [j5]Steven Homer, Stuart A. Kurtz, James S. Royer:
On A-Truth-Table-Hard Languages. Theor. Comput. Sci. 115(2): 383-389 (1993) - 1992
- [c8]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
Average Dependence and Random Oracles. SCT 1992: 306-317
1980 – 1989
- 1989
- [j4]James S. Royer:
Two Recursion Theoretic Characterizations of Proof Speed-Ups. J. Symb. Log. 54(2): 522-526 (1989) - [c7]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
The Isomorphism Conjecture Fails Relative to a Random Oracle (abstract). SCT 1989: 2 - [c6]Stephen A. Fenner, Stuart A. Kurtz, James S. Royer:
Every Polynomial-Time 1-Degree Collapses iff P=PSPACE. FOCS 1989: 624-629 - [c5]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
The Isomorphism Conjecture Fails Relative to a Random Oracle (Extended Abstract). STOC 1989: 157-166 - 1988
- [j3]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
Collapsing Degrees. J. Comput. Syst. Sci. 37(2): 247-268 (1988) - [c4]Stuart A. Kurtz, James S. Royer:
Prudence in Language Learning. COLT 1988: 206-219 - [c3]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
On the Power of 1-way Functions (Abstract). CRYPTO 1988: 578-579 - 1987
- [b1]James S. Royer:
A Connotational Theory of Program Structure. University at Buffalo, NY, USA, Lecture Notes in Computer Science 273, Springer 1987, ISBN 3-540-18253-5, pp. 1-186 - [j2]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) - [c2]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
Progress on collapsing degrees. SCT 1987: 126-131 - 1986
- [j1]James S. Royer:
Inductive Inference of Approximations. Inf. Control. 70(2/3): 156-178 (1986) - [c1]Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
Collapsing Degrees (Extended Abstract). FOCS 1986: 380-389
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
