- Parameterized Complexity for the Skeptic School of Mathematical and Computing Sciences
- Degree Spectra of Relations on Boolean Algebras Rod G. Downey 1
- Some Computability-Theoretical Aspects of Reals and Randomness
- Computability, De nability and Algebraic Structures
- Undecidability of the structure of the Solovay degrees of c.e. reals
- Reverse Mathematics, Archimedean Classes, and Hahn's Rodney G. Downey 1
- The Parameterized Complexity of Relational Database Queries and an Improved
- CALIBRATING RANDOMNESS ROD DOWNEY, DENIS R. HIRSCHFELDT, ANDR
- Advice Classes of Parameterized Tractability Liming Cai and Jianer Chen
- Symposium on Theoretical Aspects of Computer Science year (city), pp. numbers www.stacs-conf.org
- On Self-Embeddings of Computable Linear Orderings
- SUBSPACES OF COMPUTABLE VECTOR SPACES RODNEY G. DOWNEY, DENIS R. HIRSCHFELDT, ASHER M. KACH,
- Threshold Dominating Sets and An Improved Characterization of W[2]
- THE PROOFTHEORETIC STRENGTH OF THE DUSHNIKMILLER THEOREM
- Uniformly Hard Languages \Lambda Rod Downey y
- Effective presentability of Boolean algebras of Cantor--Bendixson rank 1
- Notre Dame Journal ofFormal Logic Volume 32, Number 4, Fall 1991
- COMPUTABILITY-THEORETIC AND PROOF-THEORETIC ASPECTS OF PARTIAL AND LINEAR ORDERINGS
- Algorithms and Theory of Computation Handbook, Second
- EUCLIDEAN FUNCTIONS OF COMPUTABLE EUCLIDEAN RODNEY G. DOWNEY AND ASHER M. KACH
- June 26, 2006 Master Review Vol. 9in x 6in (for Lecture Note Series, IMS, NUS) Singapore Publishers' page
- On Presentations of Algebraic Structures \Lambda Mathematics Department
- Uniformity in Computable Structure Theory Rod G. Downey 1
- Randomness, Computability, and Density Rod G. Downey 1
- Online problems, pathwidth, and persistence. Rodney G. Downey 1 and Catherine McCartin 2
- On initial segments of computable linear orders
- LOWNESS AND # 0 ROD DOWNEY, ANDRE NIES, REBECCA WEBER, AND LIANG YU
- The Parameterized Complexity of Short Computation and Factorization
- Fixed Parameter Tractability and Completeness IV: on Completeness for W[P]
- Index Sets and Parametric Reductions Rod G. Downey
- Order, Chaos and Algorithms School of Mathematics, Statistics and Computer Science
- Cutting Up Is Hard To Do: the Parameterized Complexity of k-Cut and Related Problems
- Presentations of computably enumerable reals Rodney G. Downey and Geoffrey L. LaForte
- Computably Enumerable Reals and Uniformly Presentable Ideals
- TOTALLY -COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
- The Parameterized Complexity of Some Fundamental Problems of Linear Codes and Integer Lattices
- On the Universal Splitting Property \Lambda Mathematics Department
- JUMP INVERSIONS INSIDE EFFECTIVELY CLOSED SETS AND APPLICATIONS TO RANDOMNESS
- Some New Directions and Questions in Parameterized Complexity
- Undecidability Results for low complexity degree structures Extended Abstract
- PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND ROD DOWNEY, NOAM GREENBERG, JOSEPH S. MILLER, AND REBECCA WEBER
- ARRAY NONRECURSIVE DEGREES AND GENERICITY Rod Downey, Carl G. Jockusch, and Michael Stob
- A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals
- Every set has a least jump enumeration Richard J. Coles \Lambda , Rod G. Downey y and Theodore A. Slaman z
- On Genericity and Ershov's Hierarchy School of Mathematics and Computing Sciences
- The Kolmogorov Complexity of Random Reals School of Mathematical and Computing Sciences
- The Sixth Lecture on Algorithmic Randomness School of Mathematics, Statistics, and Computer Science
- 2 Set with No In nite Low Subset in Either It or Its Complement
- Parameterized Complexity: A Framework for Systematically Confronting Computational
- Contiguity and Distributivity in the Enumerable Turing Degrees \Lambda
- Contiguity and Distributivity in the Enumerable Turing DegreesCorrigendum
- On the Structure of Parameterized Problems in NP
- Difference sets and computability theory Rod Downey a;1 Zolt'an Furedi b Carl G. Jockusch, Jr b;2
- INVARIANCE AND NONINVARIANCE IN THE LATTICE OF 0
- DEGREE THEORETIC DEFINITIONS OF THE LOW 2 RECURSIVELY ENUMERABLE SETS
- THE UPWARD CLOSURE OF A PERFECT THIN CLASS ROD DOWNEY, NOAM GREENBERG, AND JOSEPH S. MILLER
- The Parameterized Complexity of Sequence Alignment and Consensus
- Parameterized Circuit Complexity and the W Hierarchy Rodney G. Downey 1 Michael R. Fellows 2 Kenneth W. Regan 3
- Computational Tractability: The View From Mars Rodney G. Downey, Michael R. Fellows, and Ulrike Stege
- THERE ARE NO MAXIMAL LOW D.C.E. DEGREES ROD DOWNEY, LIANG YU
- Some Recent Progress in Algorithmic Rod Downey #
- There is no Fat Orbit \Lambda Mathematics Department
- RELATIVIZING CHAITIN'S HALTING PROBABILITY ROD DOWNEY, DENIS R. HIRSCHFELDT, JOSEPH S. MILLER, AND ANDR
- Lattice Embeddings below a Nonlow 2 Recursively Enumerable Degree \Lambda
- Parameterized Computational Feasibility RODNEY G. DOWNEY \Lambda and MICHAEL R. FELLOWS y
- Bounded Fixed-Parameter Tractability and Reducibility Rod Downey Jorg Flum Martin Grohe Mark Weyer
- Completing pseudojump operators R. Coles, R. Downey, C. Jockusch, and G. LaForte
- Parameterized Complexity After (Almost) 10 Years: Review and Open Questions
- Contemporary Mathematics Questions in Computable algebra and Combinatorics
- FixedParameter Tractability and Completeness II: On Completeness for W[1]
- MAXIMAL CONTIGUOUS DEGREES PETER CHOLAK, ROD DOWNEY, AND STEPHEN WALK
- Trivial Reals (Extended Abstract)
- FixedParameter Tractability and Completeness I: Basic Results 1
- February 26, 2006 Master Review Vol. 9in x 6in --(for Lecture Note Series, IMS, NUS) schnorr Publishers' page
- Totally < # # computably enumerable degrees and mtopped degrees #
- 2 set with barely \Sigma 0 Rod Downey, Geoffrey LaForte, Steffen Lempp
- December 9, 2009 EXTENSIONS OF EMBEDDINGS BELOW COMPUTABLY
- ON COMPUTABLE SELF-EMBEDDINGS OF COMPUTABLE LINEAR ORDERINGS
- Fixed-Parameter Tractability and Completeness III
- Highness and bounding minimal pairs Rodney G. Downey
- ARITHMETICAL SACKS FORCING ROD DOWNEY AND LIANG YU
- Degrees of d.c.e. reals Xizhong Zheng
- Fixed-Parameter Tractability and Completeness Rod G. Downey
- Parameterized Learning Complexity Rodney G. Downey Patricia A. Evans and Michael R. Fellows
- The Complexity of Irredundant Sets Parameterized By Size Rodney G. Downey
- Bounded Persistence Pathwidth Rodney G. Downey1 Catherine McCartin2
- Online Promise Problems with Online Width Metrics.
- Parameterized Approximation Problems Rodney G. Downey1
- On Problems Without Polynomial Kernels Hans L. Bodlaender1, Rodney G. Downey 2,
- TURING DEGREES OF REALS OF POSITIVE EFFECTIVE PACKING DIMENSION
- Algorithmic Randomness and Computability Abstract. We examine some recent work which has made significant progress in out
- Lowness for Demuth Randomness Rod Downey and Keng Meng Ng
- June 5, 2010 STRONG JUMP-TRACEABILITY II : K-TRIVIALITY
- LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS
- DECIDABILITY AND COMPUTABILITY OF CERTAIN TORSION-FREE ABELIAN GROUPS
- DEGREE SPECTRA OF UNARY RELATIONS ON , ROD DOWNEY, BAKHADYR KHOUSSAINOV, JOSEPH S. MILLER, AND LIANG YU
- September 12, 2007 THE ISOMORPHISM PROBLEM FOR TORSION-FREE
- November 20, 2006 SLENDER CLASSES.
- ON THE ORBITS OF COMPUTABLE ENUMERABLE SETS
- IDEALS IN COMPUTABLE RINGS RODNEY G. DOWNEY, STEFFEN LEMPP, AND JOSEPH R. MILETI
- LIMITS ON JUMP INVERSION FOR STRONG REDUCIBILITIES BARBARA F. CSIMA, ROD DOWNEY, AND KENG MENG NG
- A note on bttdegrees \Lambda School of Mathematical and Computing Sciences
- Decomposition and in ma in the computably enumerable degrees
- On Computing Graph Minor Obstruction Sets \Lambda Kevin Cattell
- Fixed-Parameter Tractability and Completeness I: Basic Results1
- Fixed-Parameter Tractability and Completeness II: On Completeness for W[1]
- BINARY SUBTREES WITH FEW LABELED PATHS RODNEY G. DOWNEY, NOAM GREENBERG, CARL G. JOCKUSCH, JR.,
- August 24, 2011 PSEUDO-JUMP INVERSION AND SJT-HARD SETS
- ON COMPUTABLE CATEGORICITY RODNEY G. DOWNEY, ASHER M. KACH, STEFFEN LEMPP,
- EFFECTIVELY CATEGORICAL ABELIAN GROUPS RODNEY DOWNEY AND ALEXANDER G. MELNIKOV
- Lattice Embeddings below a Nonlow 2 Recursively Enumerable Degree #
- Bounded Randomness Paul Brodhead, Rod Downey, and Keng Meng Ng
- COMPUTABILITY, ALGORITHMIC RANDOMNESS AND What drew me to the study of computation and randomness
- P037eh 1 11 June 2005 RECURSION THEORY
