Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Rodney G. Downey
Rod Downey
2010 – today
- 2013
[j110]- 2012
- [j109]
- [c31]Rod Downey: The Birth and Early Years of Parameterized Complexity. The Multivariate Algorithmic Revolution and Beyond 2012: 17-38
- [c30]Paul Brodhead, Rod Downey, Keng Meng Ng: Bounded Randomness. Computation, Physics and Beyond 2012: 59-70
- [c29]Rod Downey: A Basic Parameterized Complexity Primer. The Multivariate Algorithmic Revolution and Beyond 2012: 91-128
- [c28]
- [c27]
- [e5]Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx (Eds.): The Multivariate Algorithmic Revolution and Beyond - Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday. Lecture Notes in Computer Science 7370, Springer 2012, ISBN 978-3-642-30890-1
- [i3]Verónica Becher, Laurent Bienvenu, Rodney G. Downey, Elvira Mayordomo: Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports 2(1): 19-38 (2012)
- 2011
- [j108]Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans: Binary subtrees with few labeled paths. Combinatorica 31(3): 285-303 (2011)
- [j107]Rodney G. Downey, Dimitrios M. Thilikos: Confronting intractability via parameters. Computer Science Review 5(4): 279-317 (2011)
- [j106]George Barmpalias, Rod Downey, Keng Meng Ng: Jump inversions inside effectively closed sets and applications to randomness. J. Symb. Log. 76(2): 491-518 (2011)
- [j105]Barbara F. Csima, Rod Downey, Keng Meng Ng: Limits on jump inversion for strong reducibilities. J. Symb. Log. 76(4): 1287-1296 (2011)
- [j104]Rodney G. Downey, Asher M. Kach: Euclidean Functions of Computable Euclidean Domains. Notre Dame Journal of Formal Logic 52(2): 163-172 (2011)
- [i2]Rodney G. Downey, Dimitrios M. Thilikos: Confronting Intractability via Parameters. CoRR abs/1106.3161 (2011)
- 2010
- [b1]Rodney G. Downey, Denis R. Hirschfeldt: Algorithmic Randomness and Complexity. Theory and Applications of Computability, Springer 2010, ISBN 978-0-387-95567-4, pp. 1-766
- [j103]Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky: Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame Journal of Formal Logic 51(1): 85-96 (2010)
- [j102]Rod Downey, Keng Meng Ng: Effective Packing Dimension and Traceability. Notre Dame Journal of Formal Logic 51(2): 279-290 (2010)
2000 – 2009
- 2009
- [j101]Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin: Space complexity of Abelian groups. Arch. Math. Log. 48(1): 115-140 (2009)
- [j100]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8): 423-434 (2009)
- [j99]Rodney G. Downey, Bart Kastermans, Steffen Lempp: On computable self-embeddings of computable linear orderings. J. Symb. Log. 74(4): 1352-1366 (2009)
- [c26]
- [c25]
- [e4]Rod Downey, Prabhu Manyem (Eds.): Theory of Computing 2009, Fifteenth Computing: The Australasian Theory Symposium, CATS 2009, Wellington, New Zealand, January 2009. CRPIT 94, Australian Computer Society 2009, ISBN 978-1-920682-75-0
- [i1]Laurent Bienvenu, Rod Downey: Kolmogorov Complexity and Solovay Functions. CoRR abs/0902.1041 (2009)
- 2008
- [j98]Rod Downey, Noam Greenberg, Joseph S. Miller: The upward closure of a perfect thin class. Ann. Pure Appl. Logic 156(1): 51-58 (2008)
- [j97]Peter Cholak, Rodney G. Downey, Leo Harrington: The Complexity of Orbits of Computably Enumerable Sets. Bulletin of Symbolic Logic 14(1): 69-87 (2008)
- [j96]Rodney G. Downey, Michael R. Fellows, Michael A. Langston: The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. Comput. J. 51(1): 1-6 (2008)
- [j95]Rod Downey, Noam Greenberg: Turing degrees of reals of positive effective packing dimension. Inf. Process. Lett. 108(5): 298-303 (2008)
- [j94]Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond: Parameterized approximation of dominating set problems. Inf. Process. Lett. 109(1): 68-70 (2008)
- [c24]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin: On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) 2008: 563-574
- [e3]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi (Eds.): Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007. Dagstuhl Seminar Proceedings 07441, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008
- 2007
- [j93]Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer: Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Logic 148(1-3): 1-19 (2007)
- [j92]Rodney G. Downey, Catherine McCartin: Online promise problems with online width metrics. J. Comput. Syst. Sci. 73(1): 57-72 (2007)
- [j91]Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte: Undecidability of the structure of the Solovay degrees of c.e. reals. J. Comput. Syst. Sci. 73(5): 769-787 (2007)
- [j90]
- [j89]
- [c23]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi: 07441 Summary -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007
- [c22]Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, Moshe Y. Vardi: 07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures. Algorithmic-Logical Theory of Infinite Structures 2007
- 2006
- [j88]
- [j87]
- [j86]Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller: On self-embeddings of computable linear orderings. Ann. Pure Appl. Logic 138(1-3): 52-76 (2006)
- [j85]Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn: Calibrating Randomness. Bulletin of Symbolic Logic 12(3): 411-491 (2006)
- [j84]Rod Downey, André Nies, Rebecca Weber, Liang Yu: Lowness and Pi20 nullsets. J. Symb. Log. 71(3): 1044-1052 (2006)
- [j83]Barbara F. Csima, Rod Downey, Noam Greenberg, Denis R. Hirschfeldt, Joseph S. Miller: Every 1-generic computes a properly 1-generic. J. Symb. Log. 71(4): 1385-1393 (2006)
- [j82]Rodney G. Downey, Wolfgang Merkle, Jan Reimann: Schnorr dimension. Mathematical Structures in Computer Science 16(5): 789-811 (2006)
- [j81]Rod Downey, Michael A. Langston, Rolf Niedermeier: Editorial. Theor. Comput. Sci. 351(3): 295 (2006)
- [c21]Rodney G. Downey, Michael R. Fellows, Catherine McCartin: Parameterized Approximation Problems. IWPEC 2006: 121-129
- [c20]Rod Downey, Noam Greenberg: Totally < ωω Computably Enumerable and m-topped Degrees. TAMC 2006: 46-60
- [e2]Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger (Eds.): Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005. Dagstuhl Seminar Proceedings 05301, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany 2006
- 2005
- [j80]Richard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte: Completing pseudojump operators. Ann. Pure Appl. Logic 136(3): 297-333 (2005)
- [c19]
- [c18]
- [c17]Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger: 05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005
- [c16]Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger: 05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005
- 2004
- [j79]Rod Downey, Angsheng Li, Guohua Wu: Complementing cappable degrees in the difference hierarchy. Ann. Pure Appl. Logic 125(1-3): 101-118 (2004)
- [j78]Liang Yu, Decheng Ding, Rodney G. Downey: The Kolmogorov complexity of random reals. Ann. Pure Appl. Logic 129(1-3): 163-180 (2004)
- [j77]Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte: Randomness and reducibility. J. Comput. Syst. Sci. 68(1): 96-114 (2004)
- [j76]
- [j75]Rod Downey, Guohua Wu, Xizhong Zheng: Degrees of d. c. e. reals. Math. Log. Q. 50(4-5): 345-350 (2004)
- [j74]Rod Downey, Evan J. Griffiths, Geoffrey LaForte: On Schnorr and computable randomness, martingales, and machines. Math. Log. Q. 50(6): 613-627 (2004)
- [j73]Rod Downey, Liang Yu: There Are No Maximal Low D.C.E. Degrees. Notre Dame Journal of Formal Logic 45(3): 147-159 (2004)
- [j72]Rodney G. Downey, Evan J. Griffiths, Stephanie Reid: On Kurtz randomness. Theor. Comput. Sci. 321(2-3): 249-270 (2004)
- [c15]Rodney G. Downey, Catherine McCartin: Some New Directions and Questions in Parameterized Complexity. Developments in Language Theory 2004: 12-26
- [c14]Rodney G. Downey, Catherine McCartin: Online Problems, Pathwidth, and Persistence. IWPEC 2004: 13-24
- [c13]
- [e1]Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne (Eds.): Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings. Lecture Notes in Computer Science 3162, Springer 2004, ISBN 3-540-23071-8
- 2003
- [j71]Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto, Frances A. Rosamond: Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. Electr. Notes Theor. Comput. Sci. 78: 209-222 (2003)
- [j70]Rodney G. Downey, Geoffrey LaForte, Richard A. Shore: Decomposition and infima in the computably enumerable degrees. J. Symb. Log. 68(2): 551-579 (2003)
- [j69]Rodney G. Downey, Lance Fortnow: Uniformly hard languages. Theor. Comput. Sci. 2(298): 303-315 (2003)
- 2002
- [j68]Rodney G. Downey, Evan J. Griffiths: Schnorr Randomness. Electr. Notes Theor. Comput. Sci. 66(1): 25-35 (2002)
- [j67]Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan: Trivial Reals. Electr. Notes Theor. Comput. Sci. 66(1): 36-52 (2002)
- [j66]Peter Cholak, Rodney G. Downey, Stephen Walk: Maximal Contiguous Degrees. J. Symb. Log. 67(1): 409-437 (2002)
- [j65]Rodney G. Downey, Steffen Lempp: Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum. J. Symb. Log. 67(4): 1579-1580 (2002)
- [j64]Rodney G. Downey, Sebastiaan Terwijn: Computably Enumerable Reals and Uniformly Presentable Ideals. Math. Log. Q. 48(S1): 29-40 (2002)
- [j63]Rodney G. Downey: Roman Murawski, Recursive Functions and Metamathematics. Studia Logica 70(2): 297-299 (2002)
- [j62]Rodney G. Downey, Denis R. Hirschfeldt, André Nies: Randomness, Computability, and Density. SIAM J. Comput. 31(4): 1169-1183 (2002)
- [j61]Rodney G. Downey, Geoffrey LaForte: Presentations of computably enumerable reals. Theor. Comput. Sci. 284(2): 539-555 (2002)
- 2001
- [j60]Rodney G. Downey, Michael R. Fellows: Index sets and parametric reductions. Arch. Math. Log. 40(5): 329-348 (2001)
- [j59]Peter Cholak, Rodney G. Downey, Eberhard Herrmann: Some orbits for E. Ann. Pure Appl. Logic 107(1-3): 193-226 (2001)
- [j58]Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon: A delta02 Set with No Infinite Low Subset in Either It or Its Complement. J. Symb. Log. 66(3): 1371-1381 (2001)
- [j57]Amy Gale, Rodney G. Downey: On Genericity and Ershov's Hierarchy. Math. Log. Q. 47(2): 161-182 (2001)
- [c12]Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte: Randomness and Reducibility. MFCS 2001: 316-327
- [c11]Rodney G. Downey, Denis R. Hirschfeldt, André Nies: Randomness, Computability, and Density. STACS 2001: 195-205
- 2000
- [j56]Rodney G. Downey, Michael R. Fellows, Venkatesh Raman: The complexity of irredundant sets parameterized by size. Discrete Applied Mathematics 100(3): 155-167 (2000)
- [j55]Rodney G. Downey, André Nies: Undecidability Results for Low Complexity Time Classes. J. Comput. Syst. Sci. 60(2): 465-479 (2000)
- [j54]Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston: On computing graph minor obstruction sets. Theor. Comput. Sci. 233(1-2): 107-127 (2000)
1990 – 1999
- 1999
- [j53]Rodney G. Downey, Michael R. Fellows, Ulrike Stege: Computational Tractability: The View From Mars. Bulletin of the EATCS 69: 73-97 (1999)
- [j52]Rodney G. Downey, Carl G. Jockusch Jr.: Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1. J. Symb. Log. 64(1): 45-52 (1999)
- [j51]Rodney G. Downey, Geoffrey LaForte, Steffen Lempp: A Delta02 Set With Barely Sigma02 Degree. J. Symb. Log. 64(4): 1700-1718 (1999)
- [j50]Rodney G. Downey, Michael R. Fellows, Alexander Vardy, Geoff Whittle: The Parametrized Complexity of Some Fundamental Problems in Coding Theory. SIAM J. Comput. 29(2): 545-570 (1999)
- 1998
- [j49]Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel: Difference Sets and Computability Theory. Ann. Pure Appl. Logic 93(1-3): 63-72 (1998)
- [j48]Rodney G. Downey, Richard A. Shore: Splitting Theorems and the Jump Operator. Ann. Pure Appl. Logic 94(1-3): 45-52 (1998)
- [j47]Rodney G. Downey, Geoffrey LaForte, André Nies: Computably Enumerable Sets and Quasi-Reducibility. Ann. Pure Appl. Logic 95(1-3): 1-35 (1998)
- [j46]Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan: Parameterized Circuit Complexity and the W Hierarchy. Theor. Comput. Sci. 191(1-2): 97-115 (1998)
- [j45]Rodney G. Downey, Michael R. Fellows: Threshold Dominating Sets and an Improved Characterization of W[2]. Theor. Comput. Sci. 209(1-2): 123-140 (1998)
- [c10]Rodney G. Downey, Lance Fortnow: Uniformly Hard Languages. IEEE Conference on Computational Complexity 1998: 228-
- 1997
- [j44]Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the parameterized complexity of short computation and factorization. Arch. Math. Log. 36(4-5): 321-337 (1997)
- [j43]Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: Advice Classes of Parameterized Tractability. Ann. Pure Appl. Logic 84(1): 119-138 (1997)
- [j42]Rodney G. Downey, Steffen Lempp: Contiguity and Distributivity in the Enumerable Turing Degrees. J. Symb. Log. 62(4): 1215-1240 (1997)
- [j41]Bruno Courcelle, Rodney G. Downey, Michael R. Fellows: A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. J. UCS 3(11): 1194-1198 (1997)
- [j40]
- [j39]Rich Blaylock, Rodney G. Downey, Steffen Lempp: Infima in the Recursively Enumerable Weak Truth Table Degrees. Notre Dame Journal of Formal Logic 38(3): 406-418 (1997)
- [c9]Rodney G. Downey, André Nies: Undecidability Results for Low Complexity Degree Structures. IEEE Conference on Computational Complexity 1997: 128-132
- 1996
- [j38]Rodney G. Downey, Leo Harrington: There is No Fat Orbit. Ann. Pure Appl. Logic 80(3): 277-289 (1996)
- 1995
- [j37]Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. Ann. Pure Appl. Logic 73(3): 235-276 (1995)
- [j36]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham: Parameterized complexity analysis in computational biology. Computer Applications in the Biosciences 11(1): 49-57 (1995)
- [j35]Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the Structure of Parameterized Problems in NP. Inf. Comput. 123(1): 38-49 (1995)
- [j34]Rodney G. Downey, Richard A. Shore: Degree Theoretic Definitions of the low2 Recursively Enumerable Sets. J. Symb. Log. 60(3): 727-756 (1995)
- [j33]Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Tractability and Completeness I: Basic Results. SIAM J. Comput. 24(4): 873-921 (1995)
- [j32]Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. Theor. Comput. Sci. 141(1&2): 109-131 (1995)
- [j31]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham: The Parameterized Complexity of Sequence Alignment and Consensus. Theor. Comput. Sci. 147(1&2): 31-54 (1995)
- 1994
- [j30]
- [j29]Rodney G. Downey, William I. Gasarch, Michael Moses: The Structure of the Honest Polynomial m-Degrees. Ann. Pure Appl. Logic 70(2): 113-139 (1994)
- [j28]Rodney G. Downey, Christine Ann Haught: Embedding Lattices into the wtt-Degrees below 0'. J. Symb. Log. 59(4): 1360-1382 (1994)
- [c8]Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham: The Parameterized Complexity of Sequence Alignment and Consensus. CPM 1994: 15-30
- [c7]Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows: On the Structure of Parameterized Problems in NP (Extended Abstract). STACS 1994: 509-520
- 1993
- [j27]Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore: Countable Thin Pi01 Classes. Ann. Pure Appl. Logic 59(2): 79-139 (1993)
- [j26]Rodney G. Downey, Michael Stob: Friedberg Splittings of Recursively Enumerable Sets. Ann. Pure Appl. Logic 59(3): 175-199 (1993)
- [j25]Rodney G. Downey: Every Recursive Boolean Algebra is Isomorphic to One with Incomplete Atoms. Ann. Pure Appl. Logic 60(3): 193-206 (1993)
- [j24]Peter Cholak, Rodney G. Downey: Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees. Ann. Pure Appl. Logic 61(3): 195-221 (1993)
- [j23]Rodney G. Downey, Michael Stob: Splitting Theorems in Recursion Theory. Ann. Pure Appl. Logic 65(1): 1-106 (1993)
- [j22]Peter Cholak, Rodney G. Downey: On the Cantor-Bendixon Rank of Recursively Enumerable Sets. J. Symb. Log. 58(2): 629-640 (1993)
- [j21]Steffen Lempp, Rodney G. Downey, Richard A. Shore: Highness and Bounding Minimal Pairs. Math. Log. Q. 39: 475-491 (1993)
- [c6]Rodney G. Downey, Patricia A. Evans, Michael R. Fellows: Parameterized Learning Complexity. COLT 1993: 51-57
- [c5]Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Intractability II (Extended Abstract). STACS 1993: 374-385
- 1992
- [j20]Colin Bailey, Rodney G. Downey: Tabular Degrees in alpha-Recursion Theory. Ann. Pure Appl. Logic 55(3): 205-236 (1992)
- [j19]Rodney G. Downey, Theodore A. Slaman: On co-Simple Isols and Their Intersection Types. Ann. Pure Appl. Logic 56(1-3): 221-237 (1992)
- [j18]Rodney G. Downey: Nondiamond Theorems for Polynomial Time Reducibility. J. Comput. Syst. Sci. 45(3): 385-395 (1992)
- [c4]Rodney G. Downey, Michael R. Fellows: Fixed-Parameter Intractability. Structure in Complexity Theory Conference 1992: 36-49
- [c3]Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman: Degrees of Inferability. COLT 1992: 180-192
- [c2]Rodney G. Downey, Michael R. Fellows: Fixed Parameter Tractability and Completeness. Complexity Theory: Current Research 1992: 191-225
- 1991
- [j17]Rodney G. Downey: On Pi10 Classes and their Ranked Points. Notre Dame Journal of Formal Logic 32(4): 499-512 (1991)
- [j16]Rodney G. Downey: On Computational Complexity and Honest Polynomial Degrees. Theor. Comput. Sci. 78(2): 305-317 (1991)
- 1990
- [j15]Chi Tat Chong, Rodney G. Downey: Minimal Degrees Recursive in 1-Generic Degrees. Ann. Pure Appl. Logic 48(3): 215-225 (1990)
- [j14]Rodney G. Downey: Corrigendum: Correction to ``Undecidability of L(Finfty) and Other Lattices of r.e. Substructures''. Ann. Pure Appl. Logic 48(3): 299-301 (1990)
- [j13]Rodney G. Downey: Lattice Nonembeddings and Initial Segments of the Recursively Enumerable Degrees. Ann. Pure Appl. Logic 49(2): 97-119 (1990)
1980 – 1989
- 1989
- [j12]Rodney G. Downey: Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part I: Density. Ann. Pure Appl. Logic 41(1): 1-26 (1989)
- [j11]Rodney G. Downey, Theodore A. Slaman: Completely Mitotic r.e. Degrees. Ann. Pure Appl. Logic 41(2): 119-152 (1989)
- [j10]Rodney G. Downey, Jeffrey B. Remmel: Classification of Degree Classes Associated with r.e. Subspaces. Ann. Pure Appl. Logic 42(2): 105-124 (1989)
- [j9]Rodney G. Downey: Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part II: Nonbounding. Ann. Pure Appl. Logic 44(3): 153-172 (1989)
- [j8]Rodney G. Downey: Recursively Enumerable m- and tt-Degrees. I: The Quantity of m- Degrees. J. Symb. Log. 54(2): 553-567 (1989)
- [j7]
- [c1]Rodney G. Downey, Steven Homer, William I. Gasarch, Michael Moses: On Honest Polynomial Reductions, Relativizations, and P=NP. Structure in Complexity Theory Conference 1989: 196-207
- 1986
- [j6]Rodney G. Downey, L. V. Welch: Splitting Properties of R. E. Sets and Degrees. J. Symb. Log. 51(1): 88-109 (1986)
- 1985
- [j5]Rodney G. Downey, Geoffrey R. Hird: Automorphisms of Supermaximal Subspaces. J. Symb. Log. 50(1): 1-9 (1985)
- 1984
- [j4]
- [j3]Rodney G. Downey, Jeffrey B. Remmel: The Universal Complementation Property. J. Symb. Log. 49(4): 1125-1136 (1984)
- [j2]Christopher J. Ash, Rodney G. Downey: Decidable Subspaces and Recursively Enumerable Subspaces. J. Symb. Log. 49(4): 1137-1145 (1984)
- [j1]Rodney G. Downey: Bases of Supermaximal Subspaces and Steinitz Systems. I. J. Symb. Log. 49(4): 1146-1159 (1984)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:17 CEST by the dblp team