Rod Downey

Q: What Schools Are Affiliated With Rod Downey

Rod Downey is affiliated with the following schools: University of Queensland, Victoria University of Wellington, University of Auckland, Australian National University, University of New Zealand, Monash University

Rod Downey's AcademicInfluence.com Rankings

Rod Downey

Mathematics

#3390

World Rank

#5012

Historical Rank

Measure Theory

#1013

World Rank

#1307

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Why Is Rod Downey Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Rodney Graham Downey is a New Zealand and Australian mathematician and computer scientist, an emeritus professor in the School of Mathematics and Statistics at Victoria University of Wellington in New Zealand. He is known for his work in mathematical logic and computational complexity theory, and in particular for founding the field of parameterised complexity together with Michael Fellows.

(See a Problem?)

Rod Downey's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Parameterized Complexity (1998) (3170)
Fundamentals of Parameterized Complexity (2013) (1168)
Algorithmic Randomness and Complexity (2010) (877)
Fixed-Parameter Tractability and Completeness II: On Completeness for W[1] (1995) (572)
On problems without polynomial kernels (2009) (524)
Fixed-Parameter Tractability and Completeness I: Basic Results (1995) (428)
Fixed Parameter Tractability and Completeness (1992) (290)
Algorithmic randomness and complexity. Theory and Applications of Computability (2012) (251)
Parameterized complexity: A framework for systematically confronting computational intractability (1997) (197)
Parameterized Computational Feasibility (1995) (173)
Fixed-Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogues (1995) (161)
Cutting Up is Hard to Do: the Parameterized Complexity of k-Cut and Related Problems (2003) (123)
Advice Classes of Parameterized Tractability (1997) (119)
Fixed-parameter intractability (1992) (114)
Parameterized complexity analysis in computational biology (1995) (112)
Trivial Reals (2002) (108)
The Parameterized Complexity of Sequence Alignment and Consensus (1994) (100)
On the parameterized complexity of short computation and factorization (1997) (95)
The Parametrized Complexity of Some Fundamental Problems in Coding Theory (1999) (90)
Array nonrecursive sets and multiple permitting arguments (1990) (89)
Randomness and reducibility (2001) (87)
Every low Boolean algebra is isomorphic to a recursive one (1994) (83)
Calibrating Randomness (2006) (81)
Turing's legacy: developments from Turing's ideas in logic (2014) (80)
Fixed-parameter tractability and completeness III: some structural aspects of the W hierarchy (1993) (75)
Parameterized Approximation Problems (2006) (73)
On Problems without Polynomial Kernels (Extended Abstract) (2008) (71)
Array nonrecursive degrees and genericity (1996) (70)
The Parameterized Complexity of Relational Database Queries and an Improved Characterization of W[1] (1996) (67)
Relativizing Chaitin's Halting Probability (2005) (63)
D.R.E. Degrees and the Nondiamond Theorem (1989) (62)
THE ISOMORPHISM PROBLEM FOR TORSION-FREE ABELIAN GROUPS IS ANALYTIC COMPLETE. (2008) (62)
The Multivariate Algorithmic Revolution and Beyond (2012) (61)
Orderings with th jump degree 0 (1992) (57)
Parameterized approximation of dominating set problems (2008) (51)
Parameterized learning complexity (1993) (50)
Schnorr randomness (2002) (49)
Randomness, Computability, and Density (2001) (47)
Some Computability-Theoretical Aspects of Reals and Randomness (2002) (47)
Automorphisms of the lattice of recursively enumerable sets: Orbits (1992) (47)
The complexity of computable categoricity (2015) (46)
T-degrees, jump classes, and strong reducibilities (1987) (45)
Splitting Theorems in Recursion Theory (1993) (45)
The Multivariate Algorithmic Revolution and Beyond: essays dedicated to Michael R. Fellows on the occasion of His 60th birthday (2012) (44)
STRONG JUMP-TRACEABILITY I : THE COMPUTABLY ENUMERABLE CASE (2008) (43)
Parameterized Circuit Complexity and the W Hierarchy (1998) (43)
On the Structure of Parameterized Problems in NP (1995) (43)
Fixed-Parameter Intractability II (Extended Abstract) (1993) (43)
On Schnorr and computable randomness, martingales, and machines (2004) (42)
A Δ20 set with no infinite low subset in either it or its complement (2001) (41)
The Basic Definitions (2013) (40)
Computational Tractability: The View From Mars (1999) (40)
Algorithmic randomness (2019) (40)
Kolmogorov Complexity and Solovay Functions (2009) (35)
Asymptotic density and computably Enumerable Sets (2013) (35)
Totally ω-computably Enumerable Degrees and Bounding Critical Triples (2007) (34)
Automorphisms of the lattice of Π₁⁰ classes; perfect thin classes and anc degrees (2001) (32)
FOUNDATIONS OF ONLINE STRUCTURE THEORY (2019) (31)
Lattice Nonembeddings and Initial Segments of the Recursively Enumerable Degrees (1990) (31)
Recursion theory and ordered groups (1986) (31)
Threshold Dominating Sets and an Improved Characterization of W[2] (1998) (31)
On computing graph minor obstruction sets (2000) (31)
The complexity of irredundant sets parameterized by size (2000) (30)
Descriptive complexity and the W hierarchy (1996) (29)
Decidable subspaces and recursively enumerable subspaces (1984) (29)
Algorithms and Theory of Computation Handbook, Second Edition (2007) (29)
Effectively categorical abelian groups (2013) (28)
Every Set has a Least Jump Enumeration (2000) (27)
Recursive linear orders with incomplete successivities (1991) (27)
On Kurtz randomness (2004) (27)
The Kolmogorov complexity of random reals (2004) (26)
Lowness and nullsets (2006) (26)
LIMITWISE MONOTONIC FUNCTIONS AND THEIR APPLICATIONS (2011) (26)
Turing degrees of reals of positive effective packing dimension (2008) (25)
Chapter 14 Computability theory and linear orderings (1998) (25)
Structural interactions of the recursively enumerable T- and W-degrees (1986) (25)
Contiguity and distributivity in the enumerable Turing degrees (1997) (25)
$\Delta^{0}_{2}$ Degrees and transfer theorems (1987) (25)
Subspaces of computable vector spaces (2007) (24)
Highness and Bounding Minimal Pairs (1993) (24)
Presentations of computably enumerable reals (2002) (24)
Review: Robert I. Soare, Recursively Enumerable Sets and Degrees. A Study of Computable Functions and Computably Generated Sets (1990) (24)
Ideals in computable rings (2007) (24)
Computably Enumerable Sets and Quasi-Reducibility (1998) (23)
Splitting properties of r.e. sets and degrees (1986) (23)
Countable Thin Pi01 Classes (1993) (22)
On Initial Segments of Computable Linear Orders (1997) (22)
Classification of Degree Classes Associated with r.e. Subspaces (1989) (22)
Automorphisms of supermaximal subspaces (1985) (22)
On Π10 Classes and their Ranked Points (1991) (22)
On Choice Sets and Strongly Non-Trivial Self-Embeddings of Recursive Linear Orders (1989) (22)
The degrees of r.e. sets without the universal splitting property (1985) (21)
Confronting intractability via parameters (2011) (20)
Minimal Degrees Recursive in 1-Generic Degrees (1990) (20)
Abstract dependence, recursion theory, and the lattice of recursively enumerable filters (1983) (20)
Computability-theoretic and proof-theoretic aspects of partial and linear orderings (2003) (20)
Proceedings of the 7th and 8th Asian Logic Conferences (2003) (19)
A Note on the Computability of Graph Minor Obstruction Sets for Monadic Second Order Ideals (1997) (19)
Dynamic Dominating Set and Turbo-Charging Greedy Heuristics (2014) (19)
Working with strong reducibilities above totally omega-c.e. and array computable degrees (2009) (18)
Courcelle's theorem for triangulations (2014) (18)
Nowhere simplicity in matroids (1983) (18)
Completely Mitotic r.e. Degrees (1989) (18)
Computable completely decomposable groups (2014) (18)
The Computer Journal Special Issue on Parameterized Complexity: Foreword by the Guest Editors (2008) (18)
Uniformity in Computable Structure Theory (2001) (18)
Co-immune subspaces and complementation in V∞ (1984) (17)
On the Complexity of the Successivity Relation in Computable linear Orderings (2010) (17)
On a Question of a. Retzlaff (1983) (16)
Orderings with αth jump degree 0(α) (1992) (16)
Lattice embeddings below a nonlow2 recursively enumerable degree (1996) (15)
A basis theorem for Π₁⁰ classes of positive measure and jump inversion for random reals (2005) (15)
Strong jump-traceability II: K-triviality (2012) (15)
Bounded Randomness (2012) (15)
Undecidability of L(F∞) and other lattices of r.e. substructures (1986) (15)
Degree Spectra of Relations on Boolean Algebras (2003) (15)
Degree theoretic definitions of the low2 recursively enumerable sets (1995) (15)
Every Recursive Boolean Algebra is Isomorphic to One with Incomplete Atoms (1993) (15)
Jumps of Hemimaximal Sets (1991) (14)
Online Problems, Pathwidth, and Persistence (2004) (14)
Myhill–Nerode Methods for Hypergraphs (2012) (14)
Some orbits for E (2001) (14)
Space complexity of Abelian groups (2009) (13)
Degrees bounding minimal degrees (1989) (12)
Uniformly hard languages (1998) (12)
Questions in computable algebra and combinatorics (1999) (12)
LOWNESS FOR COMPUTABLE MACHINES (2008) (12)
Degrees of d. c. e. reals (2004) (12)
Asymptotic density and the Ershov hierarchy (2013) (12)
Degrees of inferability (1992) (12)
Binary subtrees with few labeled paths (2009) (12)
Jump inversions inside effectively closed sets and applications to randomness (2011) (12)
Array nonrecursive degrees and lattice embeddings of the diamond (1993) (11)
Chapter 15 Computable algebras and closure systems: Coding properties (1998) (11)
Parameterized complexity: new developments and research frontiers (2001) (11)
FIVE LECTURES ON ALGORITHMIC RANDOMNESS (2008) (11)
$K$-trivial degrees and the jump-traceability hierarchy (2009) (11)
CHARACTERIZING LOWNESS FOR DEMUTH RANDOMNESS (2014) (11)
COMPUTABILITY, DEFINABILITY AND ALGEBRAIC STRUCTURES (2003) (11)
Bases of supermaximal subspaces and Steinitz systems. I (1984) (11)
Foundations of Online Structure Theory II: The Operator Approach (2020) (11)
The universal complementation property (1984) (11)
Lowness for Demuth Randomness (2009) (11)
There is no degree invariant half-jump (1997) (10)
A Hierarchy of Turing Degrees (2020) (10)
Degrees of splittings and bases of recursively enumerable subspaces (1987) (10)
Maximal contiguous degrees (2002) (10)
Computably Enumerable Reals and Uniformly Presentable Ideals (2002) (10)
Computable categoricity versus relative computable categoricity (2013) (10)
Minimal pairs in initial segments of the recursively enumerable degrees (1997) (10)
Friedberg Splittings of Recursively Enumerable Sets (1993) (10)
There is No Fat Orbit (1996) (10)
Some Recent Progress in Algorithmic Randomness (2004) (10)
Computable Analysis and Classification Problems (2020) (10)
Random strings and tt-degrees of Turing complete C.E. sets (2014) (10)
Abelian p-groups and the Halting problem (2016) (10)
Graphs are not universal for online computability (2020) (10)
The Birth and Early Years of Parameterized Complexity (2012) (10)
Schnorr dimension (2005) (10)
Solovay functions and their applications in algorithmic randomness (2015) (10)
Mathematical Logic in Asia - Proceedings of the 9th Asian Logic Conference (2006) (10)
A Friedberg enumeration of equivalence structures (2017) (9)
Recursively enumerable m- and tt-degrees. I: The quantity of m-degrees (1989) (9)
On the orbits of computably enumerable sets (2006) (9)
On the Cantor-Bendixon rank of recursively enumerable sets (1993) (9)
Completing pseudojump operators (2005) (9)
Localization of a theorem of Ambos-Spies and the strong anti-splitting property (1987) (9)
The proof-theoretic strength of the Dushnik-Miller Theorem for countable linear orders (1999) (9)
A Parameterized Complexity Tutorial (2012) (9)
On honest polynomial reductions, relativizations, and P=NP (1989) (9)
Kernelization Lower Bounds (2013) (9)
On the Universal Splitting Property (1997) (9)
On Δ 02-categoricity of equivalence relations (2015) (8)
Effective presentability of Boolean algebras of Cantor-Bendixson rank 1 (1999) (8)
Totally < ωω Computably Enumerable and m-topped Degrees (2006) (8)
Automorphisms and Recursive Structures (1987) (8)
Iterated effective embeddings of abelian p-groups (2014) (8)
Online promise problems with online width metrics (2007) (8)
Some Remarks on a Theorem of Iraj Kalantari Concerning convexity and Recursion Theory (1984) (8)
The Ω conjecture (2001) (8)
EXACT PAIRS FOR THE IDEAL OF THE K-TRIVIAL SEQUENCES IN THE TURING DEGREES (2014) (8)
On -categoricity of equivalence relations (2015) (7)
Decidability and Computability of Certain Torsion-Free Abelian Groups (2010) (7)
Subsets of hypersimple sets. (1987) (7)
Cousin’s lemma in second-order arithmetic (2021) (7)
Splitting Theorems and the Jump Operator (1998) (7)
Integer valued betting strategies and Turing degrees (2015) (7)
Lowness and Π20 nullsets (2006) (7)
A Note on Decompositions of Recursively Enumerable Subspaces (1984) (7)
Arithmetical Sacks Forcing (2006) (7)
Nondiamond Theorems for Polynomial Time Reducibility (1992) (7)
Lattice Nonembeddings and Intervals of the Recursively Enumerable Degrees (1993) (7)
Limits on jump inversion for strong reducibilities (2011) (7)
Pseudo-jump inversion, upper cone avoidance, and strong jump-traceability (2013) (7)
On Computational Complexity and Honest Polynomial Degrees (1991) (7)
On computable self-embeddings of computable linear orderings (2009) (7)
The complexity of counting problems (2001) (7)
Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part I: Density (1989) (6)
Lowness and logical depth (2017) (6)
Intervals and Sublattices of the r.e. Weak Truth Table Degrees, Part II: Nonbounding (1989) (6)
Strong Jump Traceability (2010) (6)
Generic muchnik reducibility and presentations of fields (2016) (6)
Bounded Persistence Pathwidth (2005) (6)
On low for speed oracles (2017) (6)
Undecidability results for low complexity degree structures (1997) (6)
Two theorems on truth table degrees (1988) (6)
Some New Directions and Questions in Parameterized Complexity (2004) (6)
Corrigendum: Correction to "Undecidability of L(Finfty) and Other Lattices of r.e. Substructures" (1990) (6)
Effectively and Noneffectively Nowhere Simple Subspaces (1993) (6)
Randomness, Computation and Mathematics (2012) (6)
Jumps of Minimal Degrees Below 0 (1996) (6)
Effective Extensions of Linear Forms on a Recursive Vector Space Over a Recursive Field (1985) (6)
Corrigendum to “Advice classes of parameterized tractability” [Ann. Pure Appl. Logic 84 (1) (1997) 119–138] (2018) (6)
On Presentations of Algebraic Structures (2019) (6)
Recursively enumerablem- andtt-degrees II: The distribution of singular degrees (1988) (5)
Notes on the O‴ priority method with special attention to density results (1990) (5)
On the Orbits of Computable Enumerable Sets (2006) (5)
Effective Packing Dimension and Traceability (2010) (5)
Three topological reducibilities for discontinuous functions (2019) (5)
The finite intersection principle and genericity (2015) (5)
Any FIP real computes a 1-generic (2015) (5)
WORKING WITH STRONG REDUCIBILITIES ABOVE TOTALLY ω-C.E. DEGREES (2007) (5)
There Are No Maximal Low D.C.E. Degrees (2004) (5)
Recursively Enumerable m‐ and tt‐Degrees III: Realizing all Finite Distributive Lattices (1994) (5)
REVERSE MATHEMATICS, ARCHIMEDEAN CLASSES, AND HAHN’S THEOREM (2003) (5)
A Basic Parameterized Complexity Primer (2012) (5)
Orbits of creative subspaces (1987) (5)
Kobayashi compressibility (2016) (4)
Intervals Without Critical Triples (1995) (4)
Extensions of embeddings below computably enumerable degrees (2012) (4)
Undecidability of the structure of the Solovay degrees of c.e. reals (2007) (4)
A Hierarchy of computably Enumerable Degrees (2018) (4)
PROMPT SIMPLICITY, ARRAY COMPUTABILITY AND CUPPING (2008) (4)
Splitting into degrees with low computational strength (2018) (4)
Bounded fixed-parameter tractability and reducibility (2007) (4)
On self-embeddings of computable linear orderings (2006) (4)
On Genericity and Ershov's Hierarchy (2001) (4)
RELATIONSHIPS BETWEEN COMPUTABILITY-THEORETIC PROPERTIES OF PROBLEMS (2019) (4)
Addendum to "Computably Enumerable Sets and Quasi-Reducibility" (1999) (3)
On hyper-torre isols (1989) (3)
Decomposition and infima in the computably enumerable degrees (2003) (3)
Undecidability and Definability for Parametrized Polynomial Time m-Reducibilities (1993) (3)
A Contiguous Nonbranching Degree (1989) (3)
Euclidean Functions of Computable Euclidean Domains (2011) (3)
Totally < ω-computably enumerable degrees and m-topped degrees (2007) (3)
Reverse Mathematics of the Nielsen-Schreier Theorem (2003) (3)
The Complexity of Orbits of Computably Enumerable Sets (2008) (3)
Computability, Complexity and Randomness (Dagstuhl Seminar 12021) (2012) (3)
A Note on Btt-degrees (1998) (3)
Notes on Computable Analysis (2016) (3)
On the Structure of Parameterized Problems in NP (Extended Abstract) (1994) (3)
Perfect McLain groups are superperfect (1984) (3)
PUNCTUAL CATEGORICITY AND UNIVERSALITY (2020) (3)
On a question of Kalimullin (2018) (3)
Invariance and Noninvariance in the Lattice of Π00 Classes (2004) (3)
Review: Ivan Rival, The Role of Graphs in the Theory of Ordered Sets and Its Applications (1992) (2)
Complementing cappable degrees in the difference hierarchy (2004) (2)
A 0 2 Set with Barely 0 2 Degree (1998) (2)
Parameterized and exact computation : First International Workshop, IWPEC 2004, Bergen, Norway, September 14-17, 2004 : proceedings (2004) (2)
The upward closure of a perfect thin class (2008) (2)
Slender classes (2008) (2)
Turing and randomness (2017) (2)
The Sixth Lecture on Algorithmic Randomness (2007) (2)
Pseudo-jump inversion and SJT-hard sets (2011) (2)
The members of thin and minimal classes, their ranks and Turing degrees (2015) (2)
A Rank one Cohesive Set (1994) (2)
Enumerating abelian p-groups (2020) (2)
Proceedings of the 12th Asian Logic Conference (2013) (2)
There is no plus-capping degree (1994) (2)
Undecidability Results for Low Complexity Time Classes (2000) (2)
Algorithmic randomness and computability (2006) (2)
Sound, totally sound, and unsound recursive equivalence types (1986) (2)
Relativizing computable categoricity (2021) (1)
Maximal theories (1987) (1)
Degrees containing members of thin Π10 classes are dense and co-dense (2017) (1)
Randomness-Theoretic Weakness (2010) (1)
Corrigendum: "On the complexity of the successivity relation in computable linear orderings" (2017) (1)
Parameterized and Exact Computation (2004) (1)
Every 1-generic computes a properly 1-generic (2006) (1)
AVOIDING EFFECTIVE PACKING DIMENSION 1 BELOW ARRAY NONCOMPUTABLE C.E. DEGREES (2018) (1)
On co-Simple Isols and Their Intersection Types (1992) (1)
Algorithmic Randomness and Complexity (NII Shonan Meeting 2014-10) (2014) (1)
Provable Intractability: The Class X P (1999) (1)
Appendix 2: Menger’s Theorems (2013) (1)
Contiguity and distributivity in the enumerable Turing degrees — Corrigendum (2002) (1)
A WEAKLY 2-GENERIC WHICH BOUNDS A MINIMAL DEGREE (2019) (1)
Categorical linearly ordered structures (2019) (1)
Order, Chaos and Algorithms (2006) (1)
Proceedings of the 10th Asian Logic Conference, Kobe, Japan, 1-6 September 2008 (2010) (1)
Infima in the Recursively Enumerable Weak Truth Table Degrees (1997) (1)
Realizing Computably Enumerable Degrees in Separating Classes. (2020) (1)
Depth-First Search and the Plehn–Voigt Theorem (2013) (1)
The Structure of the Honest Polynomial m-Degrees (1994) (1)
Series Parameterized Circuit Complexity and the W Hierarchy (1997) (1)
Computers, Complexity, and Intractability from the Parametric Point of View (1999) (1)
Introduction (2020) (0)
Difference Sets and Computability Theory (1998) (0)
On Ramsey-type theorems and their applications (2012) (0)
Martin-Löf Randomness (2010) (0)
Definition 0.1. a Π (2007) (0)
ISOLATION IN THE D.C.E. DEGREES (2009) (0)
Computational Tractability : The View From Mars 1 (2007) (0)
Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees (2020) (0)
m-topped degrees (2020) (0)
Parameterized Counting and Randomization (2013) (0)
Baldwin, JT and Holland, K., Constructing ω-stable struc-tures: model completeness (1–3) 159–172 Berarducci, A. and Servi, T., An effective version of Wilkie's theorem of the complement and some effective o-minimality results (1–3) 43–74 (2004) (0)
ORDERINGS WITH lTH JUMP DEGREE 0(a) (2016) (0)
A set with barely degree (1999) (0)
Exact Algorithms and Fixed-Parameter Tractability, 24.-27. July 2005 (2006) (0)
Treewidth and Dynamic Programming (2013) (0)
05301 Abstracts Collection - Exact Algorithms and Fixed-Parameter Tractability (2005) (0)
Roman Murawski, Recursive Functions and Metamathematics (2002) (0)
Resolute sequences in initial segment complexity (2013) (0)
Fixed Parameter Analogues of PSpace and k-Move Games (2013) (0)
07441 Summary -- Algorithmic-Logical Theory of Infinite Structures (2007) (0)
Lowness and Triviality for Other Randomness Notions (2010) (0)
Parameterized algorithms (2010) (0)
Computability, Complexity and Randomness (2012) (0)
Chapter Five. Presentations of left-c.e. reals (2020) (0)
A Delta02 Set With Barely Sigma02 Degree (1999) (0)
Index sets and parametric reductions (2001) (0)
Nijmegen, The Netherlands July 27–August 2, 2006 (2007) (0)
SPONSORED BY THE ASSOCIATION FOR SYMBOLIC LOGIC (2013) (0)
Eectivizing MeasureHausdor MeasuresEectivzing Hausdor Measure Properties of Dimension R.E. Sets (2005) (0)
Randomness and Computation (2020) (0)
More on Width-Metrics: Applications and Local Treewidth (2013) (0)
Online, Computable and Punctual Structure Theory (2022) (0)
The Basic Class W[1] and an Analog of Cook’s Theorem (2013) (0)
On Realization of Index Sets in $$ {\prod}_1^0 $$-Classes (2019) (0)
Conference on Computability, Complexity and Randomness (2008) (0)
Reverse Mathemati s of the NielsenS hreier Theorem (2014) (0)
Another Basis for the W -Hierarchy, the Tradeoff-Theorem, and Randomized Reductions (1999) (0)
Some Ad Hoc Methods: The Methods of Bounded Search Tree and Problem Kernel (1999) (0)
Other Width Metrics (2013) (0)
Another Basis for the W-Hierarchy and the Tradeoff Theorem (2013) (0)
Maximality and collapse in the hierarchy of α-c.a. degrees (2021) (0)
Relationships with Classical Complexity and Limited Nondeterminism (1999) (0)
Courcelle’s Theorem (2013) (0)
Proceedings of the 7th & 8th Asian Logic Conferences, Hsi-Tou, Taiwan, 6-10 June 1999, Chongqing, China, 29 August-2 September 2002 (2003) (0)
Complexity and Relative Randomness for 1-Random Sets (2010) (0)
Chapter Two. ɑ-c.a. functions (2020) (0)
05301 Summary - Exact Algorithms and Fixed-Parameter Tractability (2005) (0)
Well-Quasi-Orderings and the Robertson–Seymour Theorems (2013) (0)
Multiple Recurrence and Algorithmic Randomness (2016) (0)
Further Elementary Techniques (2013) (0)
Myhill – Nerode Methods for Hypergraphs René (2015) (0)
Iterative Compression, and Measure and Conquer, for Minimization Problems (2013) (0)
The Advice View Revisited and LOGSPACE (1999) (0)
A $Delta^02$ Set with Barely $Sigma^02$ Degree (1999) (0)
A δ02 set with barely σ02 degree (1999) (0)
MINIMAL PAIRS IN THE C.E. TRUTH-TABLE DEGREES. (2014) (0)
α‎-c.a. functions (2020) (0)
The W -Hierarchy (2013) (0)
Computability Theory (Dagstuhl Seminar 17081) (2017) (0)
Ω as an Operator (2010) (0)
Jumps of Minimal Degrees below 0 0 (1996) (0)
Ju l 2 00 6 ON THE ORBITS OF COMPUTABLE ENUMERABLE SETS (2006) (0)
More on Kernelization (2013) (0)
Lowness for bounded randomness (2012) (0)
Strong jump-traceability II: K-triviality (2011) (0)
L O ] 9 M ay 2 01 6 MULTIPLE RECURRENCE AND ALGORITHMIC RANDOMNESS (0)
Bounded Search Trees (2013) (0)
Prompt permissions (2020) (0)
Generic muchnik reducibility and presentations of fields (2016) (0)
NOTES ON SACKS’ SPLITTING THEOREM (2022) (0)
Computability and Randomness (2019) (0)
Aspects of complexity : minicourses in algorithmics, complexity, and computational algebra, mathematics workshop, Kaikoura, January 7-15, 2000 (2001) (0)
Parameterized Complexity (Dagstuhl Seminar 01311) (2021) (0)
Hierarchy of Computably Enumerable Degrees II (2021) (0)
Notes on Computable Analysis (2016) (0)
The hierarchy of totally α‎-c.a. degrees (2020) (0)
ON THE C.E. DEGREES REALIZABLE IN CLASSES (2023) (0)
A MINIMAL SET LOW FOR SPEED (2020) (0)
Computability theory, algorithmic randomness and Turing's anticipation (2014) (0)
Notices (1978) (0)
Computability, Complexity and Randomness (2012) (0)
Every recurs ive boolean a lgebra is isomorphic to one with incomple te a toms (2021) (0)
Every recurs ive boolean a lgebra is isomorphic to one with incomple te a toms (2021) (0)
Calvin Digital Calvin Digital Commons Friedberg splittings of recursively enumerable sets Friedberg splittings of recursively enumerable sets (2022) (0)
ON THE C.E. DEGREES REALIZABLE IN ⇧ 01 CLASSES (2022) (0)
Limit Complexities, Minimal Descriptions, and $n$-Randomness (2022) (0)
Chapter Eight. Prompt permissions (2020) (0)
Computable Categoricity (2021) (0)
The Monotone and Antimonotone Collapse Theorems: Monotone W [2 t +1]= W [2 t ] and Antimonotone W [2 t +2]= W [2 t +1] (2013) (0)
Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018 (2019) (0)
Embedding lattices into the wtt-degrees below 0′ (1994) (0)
Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94 (2009) (0)
Splitting theorems and low degrees (2019) (0)
Computability Theory (2019) (0)
ALGORITHMICALLY RANDOM SERIES, AND USES OF ALGORITHMIC RANDOMNESS IN MATHEMATICS (2022) (0)
Twelfth Asian Logic Conference, Victoria University of Wellington, Wellington, New Zealand, December 15–20, 2011 (2013) (0)
Proceedings Twenty-Second Annual IEEE Conference on Computational Complexity: Preface (2007) (0)
Master index to volumes 71-80. (2000) (0)
Cdmtcs Research Report Series on Initial Segments of Computable Linear Orders on Initial Segments of Computable Linear Orders (1997) (0)
The Graph Minor Theorem (2013) (0)
On Π] Classes and their Ranked Points (2003) (0)
Applications of the Obstruction Principle and WQOs (2013) (0)
WORKING WITH STRONG REDUCIBILITIES ABOVE TOTALLY ω -C.E. AND ARRAY COMPUTABLE DEGREES (2009) (0)
ON SUPERSETS OF NON-LOW $_2$ SETS (2021) (0)
Notice from the editors (2002) (0)
SOME NOTES ON THE wtt-JUMP (2021) (0)
Tabular Degrees in alpha-Recursion Theory (1992) (0)
Participants and titles of lectures (1998) (0)
On realization of index sets in $\Pi_1^0$-classes (2019) (0)
EQUIVALENCE RELATIONS AND THE HALTING PROBLEM (2014) (0)
Algorithmic-Logical Theory of Infinite Structures, 28.10. - 02.11.2007 (2008) (0)
The M-Hierarchy, and XP-Optimality (2013) (0)
Methods via Automata and Bounded Treewidth (2013) (0)
Embeddings of the 1-3-1 lattice (2020) (0)
Optimization Problems, Approximation Schemes, and Their Relation to FPT (2013) (0)
Algorithmic-Logical Theory of In nite Structures Dagstuhl Seminar (2008) (0)
Orderings with $\alpha$th jump degree ${\bf 0}\sp {(\alpha)}$ (1992) (0)
Preface (2018) (0)
Some Other W[1] Hardness Results (2013) (0)
Logic and Computational Complexity NII Shonan Meeting Report (2017) (0)
Exact algorithms and fixed-parameter tractability (Proceedings Dagstuhl Seminar, July 24-29, 2005) (2006) (0)
Kolmogorov Complexity of Finite Strings (2010) (0)
Maximal totally α‎-c.a. degrees (2020) (0)
Other Notions of Algorithmic Randomness (2010) (0)
Randomness and Computability 1 : Basic Facts (2001) (0)
Complexity of Computably Enumerable Sets (2010) (0)
Permutations and presentations (1994) (0)
The Structure of Languages Under Parameterized Reducibilities (1999) (0)
Presentations of left-c.e. reals (2020) (0)
Logic and Computational Complexity (NII Shonan Meeting 2017-13) (2017) (0)
Algorithmic Randomness and Turing Reducibility (2010) (0)
Beyond W[t]-Hardness (2013) (0)
Appendix 1: Network Flows and Matchings (2013) (0)
Martin-Löf Randomness Implies Multiple Recurrence in Effectively Closed Sets (2019) (0)
Heuristics for Treewidth (2013) (0)
2001 european summer meeting of the association for symbolic logic logic colloquium'01 (2002) (0)
Isaac Newton Institute, Cambridge, UK July 2–6, 2012 (2013) (0)
Chapter Four. Maximal totally ɑ-c.a. degrees (2020) (0)
Color Coding, Multilinear Detection, and Randomized Divide and Conquer (2013) (0)
07441 Abstracts Collection -- Algorithmic-Logical Theory of Infinite Structures (2007) (0)
Computability, Algorithmic Randomness and Complexity (2011) (0)
Measures of Relative Randomness (2010) (0)

This paper list is powered by the following services:

Other Resources About Rod Downey

en.wikipedia.org

What Schools Are Affiliated With Rod Downey?

Rod Downey is affiliated with the following schools:

Rod Downey's Academic­Influence.com Rankings