default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn D. Rogers
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j13]DeAngelo Wilson
, John D. Rogers:
Evaluating Compression-Based Phylogeny Estimation in the Presence of Incomplete Lineage Sorting. J. Comput. Biol. 30(3): 250-260 (2023)
2010 – 2019
- 2018
- [j12]John D. Rogers:
Review of The Art of Computer Programming Fascicle 6 'Satisfiability' by Donald E. Knuth. SIGACT News 49(1): 12-15 (2018) - [c6]John D. Rogers:
Using Quartets to Compare the NCD and MCMC Methods for Constructing Phylogenetic Trees. BIBM 2018: 1699-1702 - 2015
- [j11]Stephen A. Fenner, John D. Rogers:
Combinatorial Game Complexity: An Introduction with Poset Games. Bull. EATCS 116 (2015) - [i3]Stephen A. Fenner, John D. Rogers:
Combinatorial Game Complexity: An Introduction with Poset Games. CoRR abs/1505.07416 (2015) - 2013
- [j10]John D. Rogers:
Review of the art of computer programming: volume 4a by Donald E. Knuth. SIGACT News 44(2): 36-39 (2013) - 2010
- [j9]Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin:
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible? Theory Comput. Syst. 46(1): 143-156 (2010)
2000 – 2009
- 2008
- [j8]John D. Rogers:
Review of "The Art of Computer Programming, Volume 4, Fascicles 2, 3, and 4 by Donald E. Knuth, " Pearson Education (Addison-Wesley), 2005. SIGACT News 39(2): 32-35 (2008) - 2007
- [c5]Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin:
Inverting Onto Functions and Polynomial Hierarchy. CSR 2007: 92-103 - 2006
- [i2]Harry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin:
Inverting onto functions might not be hard. Electron. Colloquium Comput. Complex. TR06 (2006) - 2003
- [j7]Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers:
Inverting onto functions. Inf. Comput. 186(1): 90-103 (2003) - [j6]André Berthiaume, John D. Rogers:
Foreword. Theor. Comput. Sci. 292(3): 573 (2003) - 2002
- [j5]Lance Fortnow, John D. Rogers:
Separability and one-way functions. Comput. Complex. 11(3-4): 137-157 (2002)
1990 – 1999
- 1999
- [j4]Lance Fortnow, John D. Rogers:
Complexity Limitations on Quantum Computation. J. Comput. Syst. Sci. 59(2): 240-252 (1999) - 1998
- [j3]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) - [c4]Lance Fortnow, John D. Rogers:
Complexity Limitations on Quantum Computation. CCC 1998: 202-209 - [i1]Lance Fortnow, John D. Rogers:
Complexity limitations on quantum computation. CoRR cs.CC/9811023 (1998) - 1997
- [j2]John D. Rogers:
The Isomorphism Conjecture Holds and One-Way Functions Exists Relative to an Oracle. J. Comput. Syst. Sci. 54(3): 412-423 (1997) - 1996
- [c3]Stephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers:
Inverting Onto Functions. CCC 1996: 213-222 - 1995
- [c2]John D. Rogers:
The Isomorphism Conjecture Holds and One-Way Functions Exist Relative to an Oracle. SCT 1995: 90-101 - 1994
- [c1]Lance Fortnow, John D. Rogers:
Separability and One-Way Functions. ISAAC 1994: 396-404
1980 – 1989
- 1988
- [j1]Bruno Cernuschi-Frías, John D. Rogers:
On the exact maximum likelihood estimation of Gaussian autoregressive processes. IEEE Trans. Acoust. Speech Signal Process. 36(6): 922-924 (1988)
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 22:58 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:
