default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRodney G. Downey
Rod Downey
Person information
- affiliation: Victoria University of Wellington, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[b4]Rod Downey:
Computability and Complexity - Foundations and Tools for Pursuing Scientific Applications. Undergraduate Topics in Computer Science, Springer 2024, ISBN 978-3-031-53743-1, pp. 3-326- [j168]Klaus Ambos-Spies, Rod Downey, Martin Monath:
Lowness properties for strong reducibilities and the computational power of maximal sets. Comput. 13(1): 1-56 (2024) - [c38]Rod Downey, Noam Greenberg, Long Qian:
Some Open Questions and Recent Results on Computable Banach Spaces. CiE 2024: 10-26 - 2023
- [j167]Rodney G. Downey
, Alexander G. Melnikov:
Computably Compact Metric Spaces. Bull. Symb. Log. 29(2): 170-263 (2023) - [j166]Matthew Askes, Rod Downey:
Online, computable and punctual structure theory. Log. J. IGPL 31(6): 1251-1293 (2023) - 2022
- [j165]Rod Downey, Noam Greenberg, Matthew Harrison-Trainor, Ludovic Patey, Dan Turetsky:
Relationships between Computability-Theoretic Properties of Problems. J. Symb. Log. 87(1): 47-71 (2022) - [j164]Rod Downey, Matthew Harrison-Trainor:
A Minimal Set Low for Speed. J. Symb. Log. 87(4): 1693-1728 (2022) - 2021
- [j163]Katherine Arthur, Rod Downey, Noam Greenberg:
Maximality and collapse in the hierarchy of α-c.a. degrees. Comput. 10(3): 181-214 (2021) - [j162]Klaus Ambos-Spies, Rodney G. Downey, Martin Monath:
On Supersets of non-low 22_2 Sets. J. Symb. Log. 86(3): 1282-1292 (2021) - [j161]Rod Downey, Alexander G. Melnikov, Keng Meng Ng:
Foundations of Online Structure Theory II: The Operator Approach. Log. Methods Comput. Sci. 17(3) (2021) - 2020
- [j160]Laurent Bienvenu, Rod Downey:
On low for speed oracles. J. Comput. Syst. Sci. 108: 49-63 (2020) - [j159]Rodney G. Downey, Matthew Harrison-Trainor, Iskander Sh. Kalimullin, Alexander G. Melnikov, Daniel Turetsky:
Graphs are not universal for online computability. J. Comput. Syst. Sci. 112: 1-12 (2020) - [j158]Rod Downey, Noam Greenberg, Alexander G. Melnikov, Keng Meng Ng, Daniel Turetsky:
Punctual Categoricity and Universality. J. Symb. Log. 85(4): 1427-1466 (2020) - [c37]Rodney G. Downey, Alexander G. Melnikov:
Computable Analysis and Classification Problems. CiE 2020: 100-111
2010 – 2019
- 2019
- [j157]Rod Downey, Alexander G. Melnikov, Keng Meng Ng:
Categorical linearly ordered structures. Ann. Pure Appl. Log. 170(10): 1243-1255 (2019) - [j156]Nikolay Bazhenov, Rod Downey, Iskander Sh. Kalimullin, Alexander G. Melnikov:
Foundations of Online Structure Theory. Bull. Symb. Log. 25(2): 141-181 (2019) - [j155]Rod Downey, Denis R. Hirschfeldt:
Algorithmic randomness. Commun. ACM 62(5): 70-80 (2019) - [j154]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): 191 (2019) - [j153]Ellen Chih, Rod Downey:
Splitting theorems and low degrees. Comput. 8(3-4): 243-252 (2019) - [j152]Rodney G. Downey, Satyadev Nandakumar:
A Weakly 2-Generic which Bounds a Minimal degree. J. Symb. Log. 84(4): 1326-1347 (2019) - [j151]Rodney G. Downey, Satyadev Nandakumar, André Nies:
Martin-Löf Randomness Implies Multiple Recurrence in Effectively Closed Sets. Notre Dame J. Formal Log. 60(3): 491-502 (2019) - 2018
- [j150]Rod Downey, Keng Meng Ng:
Splitting into degrees with low computational strength. Ann. Pure Appl. Log. 169(8): 803-834 (2018) - [j149]Rod Downey, Noam Greenberg:
A Hierarchy of computably Enumerable Degrees. Bull. Symb. Log. 24(1): 53-89 (2018) - [j148]Rodney G. Downey, Guohua Wu, Yue Yang:
Degrees containing members of thin Π10 classes are dense and co-dense. J. Math. Log. 18(1): 1850001:1-1850001:47 (2018) - [j147]Rod Downey, Jonathan Stephenson:
Avoiding Effective Packing Dimension 1 below array Noncomputable C.E. Degrees. J. Symb. Log. 83(2): 717-739 (2018) - [j146]Rod Downey, Denis R. Hirschfeldt, Bjørn Kjos-Hanssen:
Preface. Theory Comput. Syst. 62(7): 1553-1554 (2018) - [c36]Laurent Bienvenu, Rodney G. Downey:
On Low for Speed Oracles. STACS 2018: 15:1-15:13 - 2017
- [j145]Benjamin A. Burton, Rodney G. Downey:
Courcelle's theorem for triangulations. J. Comb. Theory A 146: 264-294 (2017) - [j144]Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng:
A Friedberg enumeration of equivalence structures. J. Math. Log. 17(2): 1750008:1-1750008:28 (2017) - [j143]Michelle Porter, Adam Day, Rodney G. Downey:
Notes on Computable Analysis. Theory Comput. Syst. 60(1): 53-111 (2017) - [j142]George Barmpalias, Rodney G. Downey:
Kobayashi compressibility. Theor. Comput. Sci. 675: 89-100 (2017) - [j141]Rod Downey, Michael McInerney, Keng Meng Ng:
Lowness and logical depth. Theor. Comput. Sci. 702: 23-33 (2017) - [p2]Rod Downey:
Turing and randomness. The Turing Guide 2017: 427-436 - [i14]Laurent Bienvenu, Rod Downey:
On low for speed oracles. CoRR abs/1712.09710 (2017) - [i13]Klaus Ambos-Spies, Vasco Brattka, Rodney G. Downey, Steffen Lempp:
Computability Theory (Dagstuhl Seminar 17081). Dagstuhl Reports 7(2): 89-101 (2017) - [i12]Yijia Chen, Rodney G. Downey, Jörg Flum:
Logic and Computational Complexity (NII Shonan Meeting 2017-13). NII Shonan Meet. Rep. 2017 (2017) - 2016
- [j140]Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng:
Abelian p-groups and the Halting problem. Ann. Pure Appl. Log. 167(11): 1123-1138 (2016) - [i11]George Barmpalias, Rodney G. Downey:
Kobayashi compressibility. CoRR abs/1608.00692 (2016) - 2015
- [j139]René van Bevern, Rodney G. Downey, Michael R. Fellows, Serge Gaspers, Frances A. Rosamond:
Myhill-Nerode Methods for Hypergraphs. Algorithmica 73(4): 696-729 (2015) - [j138]Rodney G. Downey, Guohua Wu, Yue Yang:
The members of thin and minimal classes, their ranks and Turing degrees. Ann. Pure Appl. Log. 166(7-8): 755-766 (2015) - [j137]Rod Downey, Alexander G. Melnikov, Keng Meng Ng:
On -categoricity of equivalence relations. Ann. Pure Appl. Log. 166(9): 851-880 (2015) - [j136]George Barmpalias, Rodney G. Downey, Michael McInerney:
Integer valued betting strategies and Turing degrees. J. Comput. Syst. Sci. 81(7): 1387-1412 (2015) - [j135]Laurent Bienvenu, Rodney G. Downey, André Nies, Wolfgang Merkle:
Solovay functions and their applications in algorithmic randomness. J. Comput. Syst. Sci. 81(8): 1575-1591 (2015) - [j134]Rod Downey, Carl G. Jockusch Jr., Timothy H. McNicholl, Paul E. Schupp:
Asymptotic density and the Ershov hierarchy. Math. Log. Q. 61(3): 189-195 (2015) - [i10]George Barmpalias, Rodney G. Downey, Michael McInerney:
Integer Valued Betting strategies and Turing Degrees. CoRR abs/1505.05298 (2015) - 2014
- [j133]Mingzhong Cai, Rodney G. Downey, Rachel Epstein, Steffen Lempp, Joseph S. Miller:
Random strings and tt-degrees of Turing complete C.E. sets. Log. Methods Comput. Sci. 10(3) (2014) - [j132]Rodney G. Downey, Alexander G. Melnikov, Keng Meng Ng:
Iterated effective embeddings of abelian p-groups. Int. J. Algebra Comput. 24(7): 1055- (2014) - [j131]Laurent Bienvenu, Rod Downey, Noam Greenberg, André Nies, Daniel Turetsky:
Characterizing Lowness for Demuth Randomness. J. Symb. Log. 79(2): 526-560 (2014) - [j130]George Barmpalias, Rodney G. Downey:
Exact Pairs for the Ideal of the k-Trivial Sequences in the Turing Degrees. J. Symb. Log. 79(3): 676-692 (2014) - [p1]Rod Downey:
Computability theory, algorithmic randomness and Turing's anticipation. Turing's Legacy 2014: 90-123 - [e6]Rod Downey:
Turing's Legacy: Developments from Turing's Ideas in Logic. Lecture Notes in Logic 42, Cambridge University Press 2014, ISBN 9781107338579 [contents] - [i9]Benjamin A. Burton, Rodney G. Downey:
Courcelle's theorem for triangulations. CoRR abs/1403.2926 (2014) - [i8]Rodney G. Downey, Kenshi Miyabe, André Nies, Osamu Watanabe:
Algorithmic Randomness and Complexity (NII Shonan Meeting 2014-10). NII Shonan Meet. Rep. 2014 (2014) - 2013
- [b3]Rodney G. Downey, Michael R. Fellows:
Fundamentals of Parameterized Complexity. Texts in Computer Science, Springer 2013, ISBN 978-1-4471-5558-4, pp. I-SSS, 3-707 - [j129]Rodney G. Downey, Carl G. Jockusch Jr., Paul E. Schupp:
Asymptotic density and computably Enumerable Sets. J. Math. Log. 13(2): 1350005 (2013) - [j128]Rod Downey:
Computability, Complexity and Randomness. Theory Comput. Syst. 52(1): 1 (2013) - 2012
- [j127]Rod Downey, Keng Meng Ng:
Lowness for bounded randomness. Theor. Comput. Sci. 460: 1-9 (2012) - [c35]Rod Downey:
The Birth and Early Years of Parameterized Complexity. The Multivariate Algorithmic Revolution and Beyond 2012: 17-38 - [c34]Paul Brodhead, Rod Downey, Keng Meng Ng:
Bounded Randomness. Computation, Physics and Beyond 2012: 59-70 - [c33]Rod Downey:
A Basic Parameterized Complexity Primer. The Multivariate Algorithmic Revolution and Beyond 2012: 91-128 - [c32]Rod Downey:
Randomness, Computation and Mathematics. CiE 2012: 162-181 - [c31]Rod Downey:
A Parameterized Complexity Tutorial. LATA 2012: 38-56 - [e5]Hans L. Bodlaender, Rod Downey, Fedor V. Fomin, Dániel Marx:
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 [contents] - [i7]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
- [j126]Rodney G. Downey, Noam Greenberg, Carl G. Jockusch Jr., Kevin G. Milans:
Binary subtrees with few labeled paths. Comb. 31(3): 285-303 (2011) - [j125]Rodney G. Downey, Dimitrios M. Thilikos:
Confronting intractability via parameters. Comput. Sci. Rev. 5(4): 279-317 (2011) - [j124]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) - [j123]Barbara F. Csima, Rod Downey, Keng Meng Ng:
Limits on jump inversion for strong reducibilities. J. Symb. Log. 76(4): 1287-1296 (2011) - [j122]Rodney G. Downey, Asher M. Kach:
Euclidean Functions of Computable Euclidean Domains. Notre Dame J. Formal Log. 52(2): 163-172 (2011) - [i6]Rodney G. Downey, Dimitrios M. Thilikos:
Confronting Intractability via Parameters. CoRR abs/1106.3161 (2011) - 2010
- [b2]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 - [j121]Rod Downey, Steffen Lempp, Guohua Wu:
On the Complexity of the Successivity Relation in Computable linear Orderings. J. Math. Log. 10(1-2) (2010) - [j120]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 J. Formal Log. 51(1): 85-96 (2010) - [j119]Rod Downey, Keng Meng Ng:
Effective Packing Dimension and Traceability. Notre Dame J. Formal Log. 51(2): 279-290 (2010)
2000 – 2009
- 2009
- [j118]Douglas Cenzer, Rodney G. Downey, Jeffrey B. Remmel, Zia Uddin:
Space complexity of Abelian groups. Arch. Math. Log. 48(1): 115-140 (2009) - [j117]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) - [j116]Rodney G. Downey, Bart Kastermans, Steffen Lempp:
On computable self-embeddings of computable linear orderings. J. Symb. Log. 74(4): 1352-1366 (2009) - [c30]Rod Downey, Keng Meng Ng:
Lowness for Demuth Randomness. CiE 2009: 154-166 - [c29]Laurent Bienvenu, Rod Downey:
Kolmogorov Complexity and Solovay Functions. STACS 2009: 147-158 - [e4]Rod Downey, Prabhu Manyem:
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 [contents] - [i5]Laurent Bienvenu, Rod Downey:
Kolmogorov Complexity and Solovay Functions. CoRR abs/0902.1041 (2009) - 2008
- [j115]Rod Downey, Noam Greenberg, Joseph S. Miller:
The upward closure of a perfect thin class. Ann. Pure Appl. Log. 156(1): 51-58 (2008) - [j114]Peter Cholak, Rodney G. Downey, Leo Harrington:
The Complexity of Orbits of Computably Enumerable Sets. Bull. Symb. Log. 14(1): 69-87 (2008) - [j113]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) - [j112]Rod Downey, Noam Greenberg:
Turing degrees of reals of positive effective packing dimension. Inf. Process. Lett. 108(5): 298-303 (2008) - [j111]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) - [c28]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:
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 [contents] - 2007
- [j110]Rod Downey, Jörg Flum, Martin Grohe, Mark Weyer:
Bounded fixed-parameter tractability and reducibility. Ann. Pure Appl. Log. 148(1-3): 1-19 (2007) - [j109]Rodney G. Downey, Catherine McCartin:
Online promise problems with online width metrics. J. Comput. Syst. Sci. 73(1): 57-72 (2007) - [j108]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) - [j107]Rod Downey, Noam Greenberg, Rebecca Weber:
Totally ω-computably Enumerable Degrees and Bounding Critical Triples. J. Math. Log. 7(2) (2007) - [j106]Rod Downey:
Foreword. Theory Comput. Syst. 41(3): 397 (2007) - [j105]Rodney G. Downey, Jan Reimann:
Algorithmic randomness. Scholarpedia 2(10): 2574 (2007) - [i4]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 - [i3]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
- [j104]Rod Downey, Liang Yu:
Arithmetical Sacks Forcing. Arch. Math. Log. 45(6): 715-720 (2006) - [j103]Rodney G. Downey, Robert Goldblatt:
Foreword. Ann. Pure Appl. Log. 138(1-3): 1- (2006) - [j102]Rodney G. Downey, Carl G. Jockusch Jr., Joseph S. Miller:
On self-embeddings of computable linear orderings. Ann. Pure Appl. Log. 138(1-3): 52-76 (2006) - [j101]Rodney G. Downey, Denis R. Hirschfeldt, André Nies, Sebastiaan Terwijn:
Calibrating Randomness. Bull. Symb. Log. 12(3): 411-491 (2006) - [j100]Rod Downey, André Nies, Rebecca Weber, Liang Yu:
Lowness and Π20 nullsets. J. Symb. Log. 71(3): 1044-1052 (2006) - [j99]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) - [j98]Rodney G. Downey, Wolfgang Merkle, Jan Reimann:
Schnorr dimension. Math. Struct. Comput. Sci. 16(5): 789-811 (2006) - [j97]Rod Downey, Michael A. Langston, Rolf Niedermeier:
Editorial. Theor. Comput. Sci. 351(3): 295 (2006) - [c27]Rodney G. Downey, Michael R. Fellows, Catherine McCartin:
Parameterized Approximation Problems. IWPEC 2006: 121-129 - [c26]Rod Downey, Noam Greenberg:
Totally < ωω Computably Enumerable and m-topped Degrees. TAMC 2006: 46-60 - [e2]Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger:
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 [contents] - 2005
- [j96]Richard Coles, Rodney G. Downey, Carl G. Jockusch Jr., Geoffrey LaForte:
Completing pseudojump operators. Ann. Pure Appl. Log. 136(3): 297-333 (2005) - [j95]Rod Downey, Denis R. Hirschfeldt, Joseph S. Miller, André Nies:
Relativizing Chaitin's Halting Probability. J. Math. Log. 5(2) (2005) - [c25]Rodney G. Downey, Catherine McCartin:
Bounded Persistence Pathwidth. CATS 2005: 51-56 - [c24]Rodney G. Downey, Wolfgang Merkle, Jan Reimann:
Schnorr Dimension. CiE 2005: 96-105 - [i2]Rodney G. Downey, Martin Grohe, Gerhard J. Woeginger:
05301 Summary - Exact Algorithms and Fixed-Parameter Tractability. Exact Algorithms and Fixed-Parameter Tractability 2005 - [i1]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
- [j94]Rod Downey, Angsheng Li, Guohua Wu:
Complementing cappable degrees in the difference hierarchy. Ann. Pure Appl. Log. 125(1-3): 101-118 (2004) - [j93]Liang Yu, Decheng Ding, Rodney G. Downey:
The Kolmogorov complexity of random reals. Ann. Pure Appl. Log. 129(1-3): 163-180 (2004) - [j92]Rodney G. Downey, Denis R. Hirschfeldt, Geoffrey LaForte:
Randomness and reducibility. J. Comput. Syst. Sci. 68(1): 96-114 (2004) - [j91]Rodney G. Downey, Evan J. Griffiths:
Schnorr randomness. J. Symb. Log. 69(2): 533-554 (2004) - [j90]Rod Downey, Guohua Wu, Xizhong Zheng:
Degrees of d. c. e. reals. Math. Log. Q. 50(4-5): 345-350 (2004) - [j89]Rod Downey, Evan J. Griffiths, Geoffrey LaForte:
On Schnorr and computable randomness, martingales, and machines. Math. Log. Q. 50(6): 613-627 (2004) - [j88]Rod Downey, Liang Yu:
There Are No Maximal Low D.C.E. Degrees. Notre Dame J. Formal Log. 45(3): 147-159 (2004) - [j87]Rodney G. Downey, Evan J. Griffiths, Stephanie Reid:
On Kurtz randomness. Theor. Comput. Sci. 321(2-3): 249-270 (2004) - [c23]Rodney G. Downey, Catherine McCartin:
Some New Directions and Questions in Parameterized Complexity. Developments in Language Theory 2004: 12-26 - [c22]Rodney G. Downey, Catherine McCartin:
Online Problems, Pathwidth, and Persistence. IWPEC 2004: 13-24 - [c21]Rodney G. Downey:
Some Recent Progress in Algorithmic Randomness. MFCS 2004: 42-83 - [e1]Rodney G. Downey, Michael R. Fellows, Frank K. H. A. Dehne:
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 [contents] - 2003
- [j86]