Rod Downey

Publication Activity (10 Years)

Years Active: 1983-2024
Publications (10 Years): 20

Top Topics

Low Memory Requirements

Computational Power

Top Venues

Ann. Pure Appl. Log.

Bull. Symb. Log.

Publications

Rod Downey, Noam Greenberg, Long Qian
Some Open Questions and Recent Results on Computable Banach Spaces. CiE (2024)
Klaus Ambos-Spies, Rod Downey, Martin Monath
Lowness properties for strong reducibilities and the computational power of maximal sets. Comput. 13 (1) (2024)
Matthew Askes, Rod Downey
Online, computable and punctual structure theory. Log. J. IGPL 31 (6) (2023)
Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey, Dan Turetsky
Relationships between Computability-Theoretic Properties of Problems. J. Symb. Log. 87 (1) (2022)
Rod Downey, Matthew Harrison-Trainor
A Minimal Set Low for Speed. J. Symb. Log. 87 (4) (2022)
Rod Downey, Alexander G. Melnikov, Keng Meng Ng
Foundations of Online Structure Theory II: The Operator Approach. Log. Methods Comput. Sci. 17 (3) (2021)
Katherine Arthur, Rod Downey, Noam Greenberg
-c.a. degrees. Comput. 10 (3) (2021)
Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky
Punctual Categoricity and Universality. J. Symb. Log. 85 (4) (2020)
Laurent Bienvenu, Rod Downey
On low for speed oracles. J. Comput. Syst. Sci. 108 (2020)
Vasco Brattka, Rod Downey, Julia F. Knight, Steffen Lempp
Preface of the special issue for the Oberwolfach Workshop on Computability Theory 2018. Comput. 8 (3-4) (2019)
Nikolay Bazhenov, Rod Downey, Iskander Sh. Kalimullin, Alexander G. Melnikov
Foundations of Online Structure Theory. Bull. Symb. Log. 25 (2) (2019)
Rod Downey, Denis R. Hirschfeldt
Algorithmic randomness. Commun. ACM 62 (5) (2019)
Rod Downey, Alexander G. Melnikov, Keng Meng Ng
Categorical linearly ordered structures. Ann. Pure Appl. Log. 170 (10) (2019)
Ellen Chih, Rod Downey
Splitting theorems and low degrees. Comput. 8 (3-4) (2019)
Rod Downey, Keng Meng Ng
Splitting into degrees with low computational strength. Ann. Pure Appl. Log. 169 (8) (2018)
Rod Downey, Denis R. Hirschfeldt, Bjørn Kjos-Hanssen
Preface. Theory Comput. Syst. 62 (7) (2018)
Rod Downey, Jonathan Stephenson
Avoiding Effective Packing Dimension 1 below array Noncomputable C.E. Degrees. J. Symb. Log. 83 (2) (2018)
Rod Downey, Noam Greenberg
A Hierarchy of computably Enumerable Degrees. Bull. Symb. Log. 24 (1) (2018)
Rod Downey, Michael McInerney, Keng Meng Ng
Lowness and logical depth. Theor. Comput. Sci. 702 (2017)
Laurent Bienvenu, Rod Downey
On low for speed oracles. CoRR (2017)
Rod Downey, Alexander G. Melnikov, Keng Meng Ng
On -categoricity of equivalence relations. Ann. Pure Appl. Log. 166 (9) (2015)
Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp
Asymptotic density and the Ershov hierarchy. Math. Log. Q. 61 (3) (2015)
Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Daniel Turetsky
Characterizing Lowness for Demuth Randomness. J. Symb. Log. 79 (2) (2014)
Rod Downey
Computability, Complexity and Randomness. Theory Comput. Syst. 52 (1) (2013)
Rod Downey
A Parameterized Complexity Tutorial. LATA (2012)
Rod Downey, Keng Meng Ng
Lowness for bounded randomness. Theor. Comput. Sci. 460 (2012)
Rod Downey
Randomness, Computation and Mathematics. CiE (2012)
Rod Downey
The Birth and Early Years of Parameterized Complexity. The Multivariate Algorithmic Revolution and Beyond (2012)
Paul Brodhead, Rod Downey, Keng Meng Ng
Bounded Randomness. Computation, Physics and Beyond (2012)
Rod Downey
A Basic Parameterized Complexity Primer. The Multivariate Algorithmic Revolution and Beyond (2012)
Barbara F. Csima, Rod Downey, Keng Meng Ng
Limits on jump inversion for strong reducibilities. J. Symb. Log. 76 (4) (2011)
George Barmpalias, Rod Downey, Keng Meng Ng
Jump inversions inside effectively closed sets and applications to randomness. J. Symb. Log. 76 (2) (2011)
Rod Downey, Keng Meng Ng
Effective Packing Dimension and Traceability. Notre Dame J. Formal Log. 51 (2) (2010)
Rod Downey, Steffen Lempp, Guohua Wu
On the Complexity of the Successivity Relation in Computable linear Orderings. J. Math. Log. 10 (1-2) (2010)
Rod Downey, Keng Meng Ng
Lowness for Demuth Randomness. CiE (2009)
Laurent Bienvenu, Rod Downey
Kolmogorov Complexity and Solovay Functions. STACS (2009)
Laurent Bienvenu, Rod Downey
Kolmogorov Complexity and Solovay Functions CoRR (2009)
Rod Downey, Noam Greenberg
Turing degrees of reals of positive effective packing dimension. Inf. Process. Lett. 108 (5) (2008)
Rod Downey, Noam Greenberg, Joseph S. Miller
The upward closure of a perfect thin class. Ann. Pure Appl. Log. 156 (1) (2008)
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)
Rod Downey
Foreword. Theory Comput. Syst. 41 (3) (2007)
Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer
Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Log. 148 (1-3) (2007)
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)
Rod Downey, Noam Greenberg, Rebecca Weber
Totally ω-computably Enumerable Degrees and Bounding Critical Triples. J. Math. Log. 7 (2) (2007)
Rod Downey, Noam Greenberg
-topped Degrees. TAMC (2006)
Rod Downey, Michael A. Langston, Rolf Niedermeier
Editorial. Theor. Comput. Sci. 351 (3) (2006)
Rod Downey, André Nies, Rebecca Weber, Liang Yu
nullsets. J. Symb. Log. 71 (3) (2006)
Rod Downey, Liang Yu
Arithmetical Sacks Forcing. Arch. Math. Log. 45 (6) (2006)
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) (2006)
Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller, André Nies
Relativizing Chaitin's Halting Probability. J. Math. Log. 5 (2) (2005)
Rod Downey, Guohua Wu, Xizhong Zheng
Degrees of d. c. e. reals. Math. Log. Q. 50 (4-5) (2004)
Rod Downey, Evan J. Griffiths, Geoffrey LaForte
On Schnorr and computable randomness, martingales, and machines. Math. Log. Q. 50 (6) (2004)
Rod Downey, Angsheng Li, Guohua Wu
Complementing cappable degrees in the difference hierarchy. Ann. Pure Appl. Log. 125 (1-3) (2004)
Rod Downey, Liang Yu
There Are No Maximal Low D.C.E. Degrees. Notre Dame J. Formal Log. 45 (3) (2004)
Peter Cholak, Rod Downey, Richard A. Shore
Intervals Without Critical Triples. Logic Colloquium (1995)
Rod Downey, Mike Stob
Jumps of Hemimaximal Sets. Math. Log. Q. 37 (8) (1991)
Rod Downey
A Contiguous Nonbranching Degree. Math. Log. Q. 35 (4) (1989)
Rod Downey
Some Remarks on a Theorem of Iraj Kalantari Concerning convexity and Recursion Theory. Math. Log. Q. 30 (19-24) (1984)
Rod Downey
On a Question of a. Retzlaff. Math. Log. Q. 29 (6) (1983)