John D. Rogers - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2025

Scalable Alignment-Free Phylogenomics Using Normalized Compression Distance (NCD): A Case Study in Tomato (Solanum Lycopersicum) Whole GenomesHongzhi Hu, Thiruvarangan Ramaraj, John D. Rogers. bibm 2025: 6535-6542 [doi]

2023

Evaluating Compression-Based Phylogeny Estimation in the Presence of Incomplete Lineage SortingDeAngelo Wilson, John D. Rogers. jcb, 30(3):250-260, March 2023. [doi]

2018

Review of The Art of Computer Programming Fascicle 6 'Satisfiability' by Donald E. KnuthJohn D. Rogers. sigact, 49(1):12-15, 2018. [doi]

Using Quartets to Compare the NCD and MCMC Methods for Constructing Phylogenetic TreesJohn D. Rogers. bibm 2018: 1699-1702 [doi]

2015

Combinatorial Game Complexity: An Introduction with Poset GamesStephen A. Fenner, John D. Rogers. eatcs, 116, 2015. [doi]

2013

Review of the art of computer programming: volume 4a by Donald E. KnuthJohn D. Rogers. sigact, 44(2):36-39, 2013. [doi]

2010

Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?Harry Buhrman, Lance Fortnow, Michal KouckÃ½, John D. Rogers, Nikolai K. Vereshchagin. mst, 46(1):143-156, 2010. [doi]

2008

Review of The Art of Computer Programming, Volume 4, Fascicles 2, 3, and 4 by Donald E. Knuth, Pearson Education (Addison-Wesley), 2005John D. Rogers. sigact, 39(2):32-35, 2008. [doi]

2007

Inverting Onto Functions and Polynomial HierarchyHarry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin. csr 2007: 92-103 [doi]

2006

Inverting onto functions might not be hardHarry Buhrman, Lance Fortnow, Michal Koucký, John D. Rogers, Nikolai K. Vereshchagin. eccc, 13(024), 2006. [doi]

2003

ForewordAndré Berthiaume, John D. Rogers. TCS, 292(3):573, 2003.

Inverting onto functionsStephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers. iandc, 186(1):90-103, 2003. [doi]

2002

Separability and one-way functionsLance Fortnow, John D. Rogers. cc, 11(3-4):137-157, 2002. [doi]

1999

Complexity Limitations on Quantum ComputationLance Fortnow, John D. Rogers. jcss, 59(2):240-252, 1999.

1998

Complexity Limitations on Quantum ComputationLance Fortnow, John D. Rogers. cocoon 1998: 202-209 [doi]

A Hierarchy Based on Output MultiplicityAshish V. Naik, John D. Rogers, James S. Royer, Alan L. Selman. TCS, 207(1):131-157, 1998. [doi]

1997

The Isomorphism Conjecture Holds and One-Way Functions Exists Relative to an OracleJohn D. Rogers. jcss, 54(3):412-423, 1997.

1996

Inverting Onto FunctionsStephen A. Fenner, Lance Fortnow, Ashish V. Naik, John D. Rogers. cocoon 1996: 213-222 [doi]

1995

The Isomorphism Conjecture Holds and One-Way Functions Exist Relative to an OracleJohn D. Rogers. cocoon 1995: 90-101

1994

Separability and One-Way FunctionsLance Fortnow, John D. Rogers. isaac 1994: 396-404

1988

On the exact maximum likelihood estimation of Gaussian autoregressive processesBruno Cernuschi-Frías, John D. Rogers. tsp, 36(6):922-924, 1988. [doi]

Sign in or sign up to see more results.

runs on WebDSL