Rodney G. Downey

171 papers A* 2A 6B 3C 5Misc 1Journal 135Unranked 13

Year	Rank	Type	Title / Venue / Authors
2026	—	`book`	Computable Structure Theory - In cooperation with the Association Computability in Europe Rodney G. Downey, Alexander G. Melnikov
2026	J	`jnl`	On quasi-reducibility for c.e. sets Part I. The structure of the J. Log. Comput. Sapir Ben-Shahar, Rodney G. Downey, Mariya Ivanova Soskova
2025	J	`jnl`	Limit Complexities, Minimal Descriptions, and J. Symb. Log. Rodney G. Downey, Lu Liu, Keng Meng Ng, Daniel Turetsky
2025	J	`jnl`	Punctually presented structures II: comparing presentations. Arch. Math. Log. Marina Dorzhieva, Rodney G. Downey, Ellen Hammatt, Alexander G. Melnikov, Keng Meng Ng
2024	J	`jnl`	Algorithmically random series. Comput. Rodney G. Downey, Noam Greenberg, Andrew Tanggara
2023	J	`jnl`	Computably Compact Metric Spaces. Bull. Symb. Log. Rodney G. Downey, Alexander G. Melnikov
2021	J	`jnl`	On Supersets of non-low 22_2 Sets. J. Symb. Log. Klaus Ambos-Spies, Rodney G. Downey, Martin Monath
2020	C	`conf`	Computable Analysis and Classification Problems. CiE Rodney G. Downey, Alexander G. Melnikov
2020	J	`jnl`	Graphs are not universal for online computability. J. Comput. Syst. Sci. Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky
2019	J	`jnl`	A Weakly 2-Generic which Bounds a Minimal degree. J. Symb. Log. Rodney G. Downey, Satyadev Nandakumar
2019	J	`jnl`	Martin-Löf Randomness Implies Multiple Recurrence in Effectively Closed Sets. Notre Dame J. Formal Log. Rodney G. Downey, Satyadev Nandakumar, André Nies
2018	J	`jnl`	Degrees containing members of thin Π10 classes are dense and co-dense. J. Math. Log. Rodney G. Downey, Guohua Wu, Yue Yang
2018	A	`conf`	On Low for Speed Oracles. STACS Laurent Bienvenu, Rodney G. Downey
2017	J	`jnl`	A Friedberg enumeration of equivalence structures. J. Math. Log. Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
2017	J	`jnl`	Computability Theory (Dagstuhl Seminar 17081). Dagstuhl Reports Klaus Ambos-Spies, Vasco Brattka, Rodney G. Downey, Steffen Lempp
2017	J	`jnl`	Courcelle's theorem for triangulations. J. Comb. Theory A Benjamin A. Burton, Rodney G. Downey
2017	J	`jnl`	Kobayashi compressibility. Theor. Comput. Sci. George Barmpalias, Rodney G. Downey
2017	J	`jnl`	Logic and Computational Complexity (NII Shonan Meeting 2017-13). NII Shonan Meet. Rep. Yijia Chen, Rodney G. Downey, Jörg Flum
2017	J	`jnl`	Notes on Computable Analysis. Theory Comput. Syst. Michelle Porter, Adam R. Day, Rodney G. Downey
2016	J	`jnl`	Abelian p-groups and the Halting problem. Ann. Pure Appl. Log. Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
2016	J	`jnl`	Kobayashi compressibility. CoRR George Barmpalias, Rodney G. Downey
2015	J	`jnl`	Integer Valued Betting strategies and Turing Degrees. CoRR George Barmpalias, Rodney G. Downey, Michael McInerney
2015	J	`jnl`	Integer valued betting strategies and Turing degrees. J. Comput. Syst. Sci. George Barmpalias, Rodney G. Downey, Michael McInerney
2015	J	`jnl`	Myhill-Nerode Methods for Hypergraphs. Algorithmica René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond
2015	J	`jnl`	Solovay functions and their applications in algorithmic randomness. J. Comput. Syst. Sci. Laurent Bienvenu, Rodney G. Downey, André Nies, Wolfgang Merkle
2015	J	`jnl`	The members of thin and minimal classes, their ranks and Turing degrees. Ann. Pure Appl. Log. Rodney G. Downey, Guohua Wu, Yue Yang
2014	J	`jnl`	Algorithmic Randomness and Complexity (NII Shonan Meeting 2014-10). NII Shonan Meet. Rep. Rodney G. Downey, Kenshi Miyabe, André Nies, Osamu Watanabe
2014	J	`jnl`	Courcelle's theorem for triangulations. CoRR Benjamin A. Burton, Rodney G. Downey
2014	J	`jnl`	Exact Pairs for the Ideal of the J. Symb. Log. George Barmpalias, Rodney G. Downey
2014	J	`jnl`	Iterated effective embeddings of abelian p-groups. Int. J. Algebra Comput. Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng
2014	J	`jnl`	Random strings and tt-degrees of Turing complete C.E. sets. Log. Methods Comput. Sci. Mingzhong Cai, Rodney G. Downey, Rachel Epstein, Steffen Lempp, Joseph S. Miller
2013	J	`jnl`	Asymptotic density and computably Enumerable Sets. J. Math. Log. Rodney G. Downey, Carl G. Jockusch Jr., Paul E. Schupp
2013	—	`book`	Fundamentals of Parameterized Complexity. Rodney G. Downey, Michael R. Fellows
2012	J	`jnl`	Computability, Complexity and Randomness (Dagstuhl Seminar 12021). Dagstuhl Reports Verónica Becher, Laurent Bienvenu, Rodney G. Downey, Elvira Mayordomo
2011	J	`jnl`	Binary subtrees with few labeled paths. Comb. Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans
2011	J	`jnl`	Confronting Intractability via Parameters CoRR Rodney G. Downey, Dimitrios M. Thilikos
2011	J	`jnl`	Confronting intractability via parameters. Comput. Sci. Rev. Rodney G. Downey, Dimitrios M. Thilikos
2011	J	`jnl`	Euclidean Functions of Computable Euclidean Domains. Notre Dame J. Formal Log. Rodney G. Downey, Asher M. Kach
2010	—	`book`	Algorithmic Randomness and Complexity. Rodney G. Downey, Denis R. Hirschfeldt
2010	J	`jnl`	Decidability and Computability of Certain Torsion-Free Abelian Groups. Notre Dame J. Formal Log. Rodney G. Downey, Sergei S. Goncharov, Asher M. Kach, Julia F. Knight, Oleg V. Kudinov, Alexander G. Melnikov, Daniel Turetsky
2009	J	`jnl`	On computable self-embeddings of computable linear orderings. J. Symb. Log. Rodney G. Downey, Bart Kastermans, Steffen Lempp
2009	J	`jnl`	On problems without polynomial kernels. J. Comput. Syst. Sci. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
2009	J	`jnl`	Space complexity of Abelian groups. Arch. Math. Log. Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin
2008	—	`conf`	On Problems without Polynomial Kernels (Extended Abstract). ICALP (1) Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
2008	J	`jnl`	Parameterized approximation of dominating set problems. Inf. Process. Lett. Rodney G. Downey, Michael R. Fellows, Catherine McCartin, Frances A. Rosamond
2008	J	`jnl`	The Complexity of Orbits of Computably Enumerable Sets. Bull. Symb. Log. Peter Cholak, Rodney G. Downey, Leo Harrington
2008	J	`jnl`	The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors. Comput. J. Rodney G. Downey, Michael R. Fellows, Michael A. Langston
2007	J	`jnl`	Algorithmic randomness. Scholarpedia Rodney G. Downey, Jan Reimann
2007	J	`jnl`	Online promise problems with online width metrics. J. Comput. Syst. Sci. Rodney G. Downey, Catherine McCartin
2007	J	`jnl`	Undecidability of the structure of the Solovay degrees of c.e. reals. J. Comput. Syst. Sci. Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte
2006	J	`jnl`	Calibrating Randomness. Bull. Symb. Log. Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn
2006	—	`ed.`	Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005 Exact Algorithms and Fixed-Parameter Tractability Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
2006	J	`jnl`	Foreword. Ann. Pure Appl. Log. Rodney G. Downey, Robert Goldblatt
2006	J	`jnl`	On self-embeddings of computable linear orderings. Ann. Pure Appl. Log. Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller
2006	—	`conf`	Parameterized Approximation Problems. IWPEC Rodney G. Downey, Michael R. Fellows, Catherine McCartin
2006	J	`jnl`	Schnorr dimension. Math. Struct. Comput. Sci. Rodney G. Downey, Wolfgang Merkle, Jan Reimann
2005	—	`conf`	05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
2005	—	`conf`	05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger
2005	—	`conf`	Bounded Persistence Pathwidth. CATS Rodney G. Downey, Catherine McCartin
2005	J	`jnl`	Completing pseudojump operators. Ann. Pure Appl. Log. Richard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte
2005	C	`conf`	Schnorr Dimension. CiE Rodney G. Downey, Wolfgang Merkle, Jan Reimann
2004	J	`jnl`	On Kurtz randomness. Theor. Comput. Sci. Rodney G. Downey, Evan J. Griffiths, Stephanie Reid
2004	—	`conf`	Online Problems, Pathwidth, and Persistence. IWPEC Rodney G. Downey, Catherine McCartin
2004	—	`ed.`	Parameterized and Exact Computation, First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004, Proceedings IWPEC Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne
2004	J	`jnl`	Randomness and reducibility. J. Comput. Syst. Sci. Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte
2004	J	`jnl`	Schnorr randomness. J. Symb. Log. Rodney G. Downey, Evan J. Griffiths
2004	C	`conf`	Some New Directions and Questions in Parameterized Complexity. Developments in Language Theory Rodney G. Downey, Catherine McCartin
2004	B	`conf`	Some Recent Progress in Algorithmic Randomness. MFCS Rodney G. Downey
2004	J	`jnl`	The Kolmogorov complexity of random reals. Ann. Pure Appl. Log. Liang Yu, Decheng Ding, Rodney G. Downey
2003	—	`conf`	Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems. CATS Rodney G. Downey, Vladimir Estivill-Castro, Michael R. Fellows, Elena Prieto-Rodriguez, Frances A. Rosamond
2003	J	`jnl`	Decomposition and infima in the computably enumerable degrees. J. Symb. Log. Rodney G. Downey, Geoffrey LaForte, Richard A. Shore
2003	J	`jnl`	Uniformly hard languages. Theor. Comput. Sci. Rodney G. Downey, Lance Fortnow
2002	J	`jnl`	Computably Enumerable Reals and Uniformly Presentable Ideals. Math. Log. Q. Rodney G. Downey, Sebastiaan Terwijn
2002	J	`jnl`	Contiguity and Distributivity in The Enumerable Turing Degrees - Corrigendum. J. Symb. Log. Rodney G. Downey, Steffen Lempp
2002	J	`jnl`	Maximal Contiguous Degrees. J. Symb. Log. Peter Cholak, Rodney G. Downey, Stephen Walk
2002	J	`jnl`	Presentations of computably enumerable reals. Theor. Comput. Sci. Rodney G. Downey, Geoffrey LaForte
2002	J	`jnl`	Randomness, Computability, and Density. SIAM J. Comput. Rodney G. Downey, Denis R. Hirschfeldt, André Nies
2002	J	`jnl`	Roman Murawski, Recursive Functions and Metamathematics. Stud Logica Rodney G. Downey
2002	C	`conf`	Schnorr Randomness. CCA Rodney G. Downey, Evan J. Griffiths
2002	C	`conf`	Trivial Reals. CCA Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Frank Stephan
2001	J	`jnl`	A delta J. Symb. Log. Rodney G. Downey, Denis R. Hirschfeldt, Steffen Lempp, Reed Solomon
2001	J	`jnl`	Index sets and parametric reductions. Arch. Math. Log. Rodney G. Downey, Michael R. Fellows
2001	J	`jnl`	On Genericity and Ershov's Hierarchy. Math. Log. Q. Amy Gale, Rodney G. Downey
2001	B	`conf`	Randomness and Reducibility. MFCS Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte
2001	A	`conf`	Randomness, Computability, and Density. STACS Rodney G. Downey, Denis R. Hirschfeldt, André Nies
2001	J	`jnl`	Some orbits for E. Ann. Pure Appl. Log. Peter Cholak, Rodney G. Downey, Eberhard Herrmann
2000	J	`jnl`	On computing graph minor obstruction sets. Theor. Comput. Sci. Kevin Cattell, Michael J. Dinneen, Rodney G. Downey, Michael R. Fellows, Michael A. Langston
2000	J	`jnl`	The complexity of irredundant sets parameterized by size. Discret. Appl. Math. Rodney G. Downey, Michael R. Fellows, Venkatesh Raman
2000	J	`jnl`	Undecidability Results for Low Complexity Time Classes. J. Comput. Syst. Sci. Rodney G. Downey, André Nies
1999	J	`jnl`	A Delta J. Symb. Log. Rodney G. Downey, Geoffrey LaForte, Steffen Lempp
1999	J	`jnl`	Addendum to "Computably Enumerable Sets and Quasi-Reducibility". Ann. Pure Appl. Log. Rodney G. Downey, Geoffrey LaForte, André Nies
1999	J	`jnl`	Computational Tractability: The View From Mars. Bull. EATCS Rodney G. Downey, Michael R. Fellows, Ulrike Stege
1999	J	`jnl`	Effective Presentability of Boolean Algebras of Cantor-Bendixson Rank 1. J. Symb. Log. Rodney G. Downey, Carl G. Jockusch Jr.
1999	—	`book`	Parameterized Complexity Rodney G. Downey, Michael R. Fellows
1999	J	`jnl`	The Parametrized Complexity of Some Fundamental Problems in Coding Theory. SIAM J. Comput. Rodney G. Downey, Michael R. Fellows, Alexander Vardy, Geoff Whittle
1998	J	`jnl`	Computably Enumerable Sets and Quasi-Reducibility. Ann. Pure Appl. Log. Rodney G. Downey, Geoffrey LaForte, André Nies
1998	J	`jnl`	Difference Sets and Computability Theory. Ann. Pure Appl. Log. Rodney G. Downey, Zoltán Füredi, Carl G. Jockusch Jr., Lee A. Rubel
1998	J	`jnl`	Parameterized Circuit Complexity and the W Hierarchy. Theor. Comput. Sci. Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan
1998	J	`jnl`	Splitting Theorems and the Jump Operator. Ann. Pure Appl. Log. Rodney G. Downey, Richard A. Shore
1998	J	`jnl`	Threshold Dominating Sets and an Improved Characterization of Theor. Comput. Sci. Rodney G. Downey, Michael R. Fellows
1998	A	`conf`	Uniformly Hard Languages. CCC Rodney G. Downey, Lance Fortnow
1997	J	`jnl`	A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals. J. Univers. Comput. Sci. Bruno Courcelle, Rodney G. Downey, Michael R. Fellows
1997	J	`jnl`	Advice Classes of Parameterized Tractability. Ann. Pure Appl. Log. Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
1997	J	`jnl`	Contiguity and Distributivity in the Enumerable Turing Degrees. J. Symb. Log. Rodney G. Downey, Steffen Lempp
1997	J	`jnl`	Infima in the Recursively Enumerable Weak Truth Table Degrees. Notre Dame J. Formal Log. Rich Blaylock, Rodney G. Downey, Steffen Lempp
1997	J	`jnl`	On the Universal Splitting Property. Math. Log. Q. Rodney G. Downey
1997	J	`jnl`	On the parameterized complexity of short computation and factorization. Arch. Math. Log. Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
1997	—	`conf`	Parameterized complexity: A framework for systematically confronting computational intractability. Contemporary Trends in Discrete Mathematics Rodney G. Downey, Michael R. Fellows, Ulrike Stege
1997	A	`conf`	Undecidability Results for Low Complexity Degree Structures. CCC Rodney G. Downey, André Nies
1996	—	`conf`	Descriptive complexity and the Proof Complexity and Feasible Arithmetics Rodney G. Downey, Michael R. Fellows, Kenneth W. Regan
1996	—	`conf`	The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1]. DMTCS Rodney G. Downey, Michael R. Fellows, Udayan Taylor
1996	J	`jnl`	There is No Fat Orbit. Ann. Pure Appl. Log. Rodney G. Downey, Leo Harrington
1995	J	`jnl`	Degree Theoretic Definitions of the low J. Symb. Log. Rodney G. Downey, Richard A. Shore
1995	J	`jnl`	Fixed-Parameter Tractability and Completeness I: Basic Results. SIAM J. Comput. Rodney G. Downey, Michael R. Fellows
1995	J	`jnl`	Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]. Theor. Comput. Sci. Rodney G. Downey, Michael R. Fellows
1995	J	`jnl`	Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues. Ann. Pure Appl. Log. Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
1995	J	`jnl`	On the Structure of Parameterized Problems in NP. Inf. Comput. Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
1995	J	`jnl`	Parameterized complexity analysis in computational biology. Comput. Appl. Biosci. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Michael T. Hallett, Harold T. Wareham
1995	J	`jnl`	The Parameterized Complexity of Sequence Alignment and Consensus. Theor. Comput. Sci. Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
1994	J	`jnl`	A Rank one Cohesive Set. Ann. Pure Appl. Log. Rodney G. Downey, Yang Yue
1994	J	`jnl`	Embedding Lattices into the wtt-Degrees below 0'. J. Symb. Log. Rodney G. Downey, Christine Ann Haught
1994	A	`conf`	On the Structure of Parameterized Problems in NP (Extended Abstract). STACS Liming Cai, Jianer Chen, Rodney G. Downey, Michael R. Fellows
1994	B	`conf`	The Parameterized Complexity of Sequence Alignment and Consensus. CPM Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Harold T. Wareham
1994	Misc	`conf`	The Parameterized Complexity of Some Problems in Logic and Linguistics. LFCS Bruce M. Kapron, Michael R. Fellows, Rodney G. Downey, Michael T. Hallett, Harold T. Wareham
1994	J	`jnl`	The Structure of the Honest Polynomial m-Degrees. Ann. Pure Appl. Log. Rodney G. Downey, William I. Gasarch, Michael F. Moses
1994	J	`jnl`	There is no plus-capping degree. Arch. Math. Log. Rodney G. Downey, Steffen Lempp
1993	J	`jnl`	Countable Thin Pi Ann. Pure Appl. Log. Douglas A. Cenzer, Rodney G. Downey, Carl G. Jockusch Jr., Richard A. Shore
1993	J	`jnl`	Every Recursive Boolean Algebra is Isomorphic to One with Incomplete Atoms. Ann. Pure Appl. Log. Rodney G. Downey
1993	A	`conf`	Fixed-Parameter Intractability II (Extended Abstract). STACS Karl R. Abrahamson, Rodney G. Downey, Michael R. Fellows
1993	J	`jnl`	Friedberg Splittings of Recursively Enumerable Sets. Ann. Pure Appl. Log. Rodney G. Downey, Michael Stob
1993	J	`jnl`	Highness and Bounding Minimal Pairs. Math. Log. Q. Steffen Lempp, Rodney G. Downey, Richard A. Shore
1993	J	`jnl`	Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees. Ann. Pure Appl. Log. Peter Cholak, Rodney G. Downey
1993	J	`jnl`	On the Cantor-Bendixon Rank of Recursively Enumerable Sets. J. Symb. Log. Peter Cholak, Rodney G. Downey
1993	A*	`conf`	Parameterized Learning Complexity. COLT Rodney G. Downey, Patricia A. Evans, Michael R. Fellows
1993	J	`jnl`	Splitting Theorems in Recursion Theory. Ann. Pure Appl. Logic Rodney G. Downey, Michael Stob
1992	A*	`conf`	Degrees of Inferability. COLT Peter Cholak, Efim B. Kinber, Rodney G. Downey, Martin Kummer, Lance Fortnow, Stuart A. Kurtz, William I. Gasarch, Theodore A. Slaman
1992	—	`conf`	Fixed Parameter Tractability and Completeness III: Some Structural Aspects of the W Hierarchy. Complexity Theory: Current Research Rodney G. Downey, Michael R. Fellows
1992	—	`conf`	Fixed-Parameter Intractability. SCT Rodney G. Downey, Michael R. Fellows
1992	J	`jnl`	Nondiamond Theorems for Polynomial Time Reducibility. J. Comput. Syst. Sci. Rodney G. Downey
1992	J	`jnl`	On co-Simple Isols and Their Intersection Types. Ann. Pure Appl. Log. Rodney G. Downey, Theodore A. Slaman
1992	J	`jnl`	Tabular Degrees in alpha-Recursion Theory. Ann. Pure Appl. Log. Colin Bailey, Rodney G. Downey
1991	J	`jnl`	On Computational Complexity and Honest Polynomial Degrees. Theor. Comput. Sci. Rodney G. Downey
1991	J	`jnl`	On Π Notre Dame J. Formal Log. Rodney G. Downey
1990	J	`jnl`	Corrigendum: Correction to "Undecidability of L(F Ann. Pure Appl. Log. Rodney G. Downey
1990	J	`jnl`	Lattice Nonembeddings and Initial Segments of the Recursively Enumerable Degrees. Ann. Pure Appl. Log. Rodney G. Downey
1990	J	`jnl`	Minimal Degrees Recursive in 1-Generic Degrees. Ann. Pure Appl. Log. Chi Tat Chong, Rodney G. Downey
1989	J	`jnl`	Classification of Degree Classes Associated with r.e. Subspaces. Ann. Pure Appl. Log. Rodney G. Downey, Jeffrey B. Remmel
1989	J	`jnl`	Completely Mitotic r.e. Degrees. Ann. Pure Appl. Log. Rodney G. Downey, Theodore A. Slaman
1989	J	`jnl`	Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part I: Density. Ann. Pure Appl. Log. Rodney G. Downey
1989	J	`jnl`	Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part II: Nonbounding. Ann. Pure Appl. Log. Rodney G. Downey
1989	J	`jnl`	On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders. Math. Log. Q. Rodney G. Downey, Michael F. Moses
1989	—	`conf`	On Honest Polynomial Reductions, Relativizations, and P=NP. SCT Rodney G. Downey, Steven Homer, William I. Gasarch, Michael F. Moses
1989	J	`jnl`	On Hyper-Torre Isols. J. Symb. Log. Rodney G. Downey
1989	J	`jnl`	Recursively Enumerable m- and tt-Degrees. I: The Quantity of m- Degrees. J. Symb. Log. Rodney G. Downey
1988	J	`jnl`	Recursively enumerable Arch. Math. Log. Rodney G. Downey
1987	J	`jnl`	Automorphisms and Recursive Structures. Math. Log. Q. Rodney G. Downey, Jeffrey B. Remmel
1987	J	`jnl`	Localization of a theorem of Ambos-Spies and the strong anti-splitting property. Arch. Math. Log. Rodney G. Downey
1987	J	`jnl`	Maximal theories. Ann. Pure Appl. Log. Rodney G. Downey
1986	J	`jnl`	Bases of Supermaximal Subspaces and Steinitz Systems II. Math. Log. Q. Rodney G. Downey
1986	J	`jnl`	Recursion theory and ordered groups. Ann. Pure Appl. Log. Rodney G. Downey, Stuart A. Kurtz
1986	J	`jnl`	Sound, totally sound, and unsound recursive equivalence types. Ann. Pure Appl. Log. Rodney G. Downey
1986	J	`jnl`	Splitting Properties of R. E. Sets and Degrees. J. Symb. Log. Rodney G. Downey, Lawrence V. Welch
1986	J	`jnl`	Structural interactions of the recursively enumerable T- and W-degrees. Ann. Pure Appl. Log. Rodney G. Downey, Michael Stob
1986	J	`jnl`	Undecidability of L(F Ann. Pure Appl. Log. Rodney G. Downey
1985	J	`jnl`	Automorphisms of Supermaximal Subspaces. J. Symb. Log. Rodney G. Downey, Geoffrey R. Hird
1985	J	`jnl`	Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Field. Math. Log. Q. Rodney G. Downey, Iraj Kalantari
1984	J	`jnl`	A Note on Decompositions of Recursively Enumerable Subspaces. Math. Log. Q. Rodney G. Downey
1984	J	`jnl`	Bases of Supermaximal Subspaces and Steinitz Systems. I. J. Symb. Log. Rodney G. Downey
1984	J	`jnl`	Co-Immune Subspaces and Complementation in V. J. Symb. Log. Rodney G. Downey
1984	J	`jnl`	Decidable Subspaces and Recursively Enumerable Subspaces. J. Symb. Log. Christopher J. Ash, Rodney G. Downey
1984	J	`jnl`	The Universal Complementation Property. J. Symb. Log. Rodney G. Downey, Jeffrey B. Remmel