Rodney G. Downey - researchr alias

researchr

You are not signed in
Sign in
Sign up

2011

Euclidean Functions of Computable Euclidean DomainsRodney G. Downey, Asher M. Kach. ndjfl, 52(2):163-172, 2011. [doi]

2010

Decidability and Computability of Certain Torsion-Free Abelian GroupsRodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky. ndjfl, 51(1):85-96, 2010. [doi]

2009

On problems without polynomial kernelsHans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin. jcss, 75(8):423-434, 2009. [doi]

Space complexity of Abelian groupsDouglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin. AML, 48(1):115-140, 2009. [doi]

On computable self-embeddings of computable linear orderingsRodney G. Downey, Bart Kastermans, Steffen Lempp. JSYML, 74(4):1352-1366, 2009. [doi]

2008

2007

Online promise problems with online width metricsRodney G. Downey, Catherine McCartin. jcss, 73(1):57-72, 2007. [doi]

Undecidability of the structure of the Solovay degrees of c.e. realsRodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte. jcss, 73(5):769-787, 2007. [doi]

Algorithmic randomnessRodney G. Downey, Jan Reimann. scholarpedia, 2(10):2574, 2007. [doi]

2006

Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger, editors, Volume 05301 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2006.

Parameterized Approximation ProblemsRodney G. Downey, Michael R. Fellows, Catherine McCartin. iwpec 2006: 121-129 [doi]

Schnorr dimensionRodney G. Downey, Wolfgang Merkle, Jan Reimann. mscs, 16(5):789-811, 2006. [doi]

Calibrating RandomnessRodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn. bsl, 12(3):411-491, 2006. [doi]

On self-embeddings of computable linear orderingsRodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller. APAL, 138(1-3):52-76, 2006. [doi]

ForewordRodney G. Downey, Robert Goldblatt. APAL, 138(1-3):1, 2006. [doi]

2005

2004

Randomness and reducibilityRodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte. jcss, 68(1):96-114, 2004. [doi]

Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, ProceedingsRodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne, editors, Volume 3162 of Lecture Notes in Computer Science, Springer, 2004.

Some New Directions and Questions in Parameterized ComplexityRodney G. Downey, Catherine McCartin. dlt 2004: 12-26 [doi]

Online Problems, Pathwidth, and PersistenceRodney G. Downey, Catherine McCartin. iwpec 2004: 13-24 [doi]

On Kurtz randomnessRodney G. Downey, Evan J. Griffiths, Stephanie Reid. TCS, 321(2-3):249-270, 2004. [doi]

Some Recent Progress in Algorithmic RandomnessRodney G. Downey. mfcs 2004: 42-83 [doi]

Schnorr randomnessRodney G. Downey, Evan J. Griffiths. JSYML, 69(2):533-554, 2004. [doi]

The Kolmogorov complexity of random realsLiang Yu, Decheng Ding, Rodney G. Downey. APAL, 129(1-3):163-180, 2004. [doi]

2003

Decomposition and infima in the computably enumerable degreesRodney G. Downey, Geoffrey LaForte, Richard A. Shore. JSYML, 68(2):551-579, 2003.

Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related ProblemsRodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond. ENTCS, 78, 2003. [doi]

Uniformly hard languagesRodney G. Downey, Lance Fortnow. TCS, 2(298):303-315, 2003. [doi]

2002

Maximal Contiguous DegreesPeter Cholak, Rodney G. Downey, Stephen Walk. JSYML, 67(1):409-437, 2002.

Randomness, Computability, and DensityRodney G. Downey, Denis R. Hirschfeldt, André Nies. siamcomp, 31(4):1169-1183, 2002. [doi]

Computably Enumerable Reals and Uniformly Presentable IdealsRodney G. Downey, Sebastiaan Terwijn. mlq, 48(S1):29-40, 2002. [doi]

Trivial RealsRodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan. ENTCS, 66(1), 2002. [doi]

Presentations of computably enumerable realsRodney G. Downey, Geoffrey LaForte. TCS, 284(2):539-555, 2002. [doi]

Contiguity and Distributivity in The Enumerable Turing Degrees - CorrigendumRodney G. Downey, Steffen Lempp. JSYML, 67(4):1579-1580, 2002.

Schnorr RandomnessRodney G. Downey, Evan J. Griffiths. ENTCS, 66(1), 2002. [doi]

Roman Murawski, Recursive Functions and MetamathematicsRodney G. Downey. sLogica, 70(2):297-299, 2002.

2001

Some orbits for EPeter Cholak, Rodney G. Downey, Eberhard Herrmann. APAL, 107(1-3):193-226, 2001.

A delta:::0:::::2:: Set with No Infinite Low Subset in Either It or Its ComplementRodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon. JSYML, 66(3):1371-1381, 2001.

Index sets and parametric reductionsRodney G. Downey, Michael R. Fellows. AML, 40(5):329-348, 2001. [doi]

Randomness and ReducibilityRodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte. mfcs 2001: 316-327 [doi]

Randomness, Computability, and DensityRodney G. Downey, Denis R. Hirschfeldt, André Nies. STACS 2001: 195-205 [doi]

On Genericity and Ershov s HierarchyAmy Gale, Rodney G. Downey. mlq, 47(2):161-182, 2001. [doi]

2000

On computing graph minor obstruction setsKevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston. TCS, 233(1-2):107-127, 2000. [doi]

Undecidability Results for Low Complexity Time ClassesRodney G. Downey, André Nies. jcss, 60(2):465-479, 2000.

The complexity of irredundant sets parameterized by sizeRodney G. Downey, Michael R. Fellows, Venkatesh Raman. DAM, 100(3):155-167, 2000.

1999

1998

Parameterized Circuit Complexity and the W HierarchyRodney G. Downey, Michael R. Fellows, Kenneth W. Regan. TCS, 191(1-2):97-115, 1998. [doi]

Computably Enumerable Sets and Quasi-ReducibilityRodney G. Downey, Geoffrey LaForte, André Nies. APAL, 95(1-3):1-35, 1998.

Difference Sets and Computability TheoryRodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel. APAL, 93(1-3):63-72, 1998.

Threshold Dominating Sets and an Improved Characterization of ::::W::::[2]Rodney G. Downey, Michael R. Fellows. TCS, 209(1-2):123-140, 1998. [doi]

Uniformly Hard LanguagesRodney G. Downey, Lance Fortnow. cocoon 1998: 228 [doi]

Splitting Theorems and the Jump OperatorRodney G. Downey, Richard A. Shore. APAL, 94(1-3):45-52, 1998.

1997

Infima in the Recursively Enumerable Weak Truth Table DegreesRich Blaylock, Rodney G. Downey, Steffen Lempp. ndjfl, 38(3):406-418, 1997.

On the parameterized complexity of short computation and factorizationLiming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows. AML, 36(4-5):321-337, 1997. [doi]

Advice Classes of Parameterized TractabilityLiming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows. APAL, 84(1):119-138, 1997.

A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order IdealsBruno Courcelle, Rodney G. Downey, Michael R. Fellows. jucs, 3(11):1194-1198, 1997. [doi]

Undecidability Results for Low Complexity Degree StructuresRodney G. Downey, André Nies. cocoon 1997: 128-132 [doi]

Contiguity and Distributivity in the Enumerable Turing DegreesRodney G. Downey, Steffen Lempp. JSYML, 62(4):1215-1240, 1997.

On the Universal Splitting PropertyRodney G. Downey. mlq, 43:311-320, 1997.

1996

There is No Fat OrbitRodney G. Downey, Leo Harrington. APAL, 80(3):277-289, 1996.

1995

Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE AnaloguesKarl R. Abrahamson, Rodney G. Downey, Michael R. Fellows. APAL, 73(3):235-276, 1995.

The Parameterized Complexity of Sequence Alignment and ConsensusHans Leo Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham. TCS, 147(1&2):31-54, 1995. [doi]

Parameterized complexity analysis in computational biologyHans Leo Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham. bioinformatics, 11(1):49-57, 1995.

On the Structure of Parameterized Problems in NPLiming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows. iandc, 123(1):38-49, 1995.

Degree Theoretic Definitions of the low::2:: Recursively Enumerable SetsRodney G. Downey, Richard A. Shore. JSYML, 60(3):727-756, 1995.

Fixed-Parameter Tractability and Completeness I: Basic ResultsRodney G. Downey, Michael R. Fellows. siamcomp, 24(4):873-921, 1995.

Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]Rodney G. Downey, Michael R. Fellows. TCS, 141(1&2):109-131, 1995. [doi]

1994

1993

Fixed-Parameter Intractability II (Extended Abstract)Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows. STACS 1993: 374-385

Countable Thin Pi:::0:::::1:: ClassesDouglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore. APAL, 59(2):79-139, 1993.

On the Cantor-Bendixon Rank of Recursively Enumerable SetsPeter Cholak, Rodney G. Downey. JSYML, 58(2):629-640, 1993.

Lattice Nonembeddings and Intervals of the Recursively Enumerable DegreesPeter Cholak, Rodney G. Downey. APAL, 61(3):195-221, 1993.

Friedberg Splittings of Recursively Enumerable SetsRodney G. Downey, Michael Stob. APAL, 59(3):175-199, 1993.

Parameterized Learning ComplexityRodney G. Downey, Patricia A. Evans, Michael R. Fellows. colt 1993: 51-57 [doi]

Splitting Theorems in Recursion TheoryRodney G. Downey, Michael Stob. APAL, 65(1):1-106, 1993.

Every Recursive Boolean Algebra is Isomorphic to One with Incomplete AtomsRodney G. Downey. APAL, 60(3):193-206, 1993.

Highness and Bounding Minimal PairsSteffen Lempp, Rodney G. Downey, Richard A. Shore. mlq, 39:475-491, 1993.

1992

1991

On Pi::1:::::0::: Classes and their Ranked PointsRodney G. Downey. ndjfl, 32(4):499-512, 1991.

On Computational Complexity and Honest Polynomial DegreesRodney G. Downey. TCS, 78(2):305-317, 1991.

1990

Minimal Degrees Recursive in 1-Generic DegreesChi Tat Chong, Rodney G. Downey. APAL, 48(3):215-225, 1990.

Lattice Nonembeddings and Initial Segments of the Recursively Enumerable DegreesRodney G. Downey. APAL, 49(2):97-119, 1990.

PreviousNext