World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
47
Citations
16282
World Ranking
6309
National Ranking
15

Mathematics

D-Index
47
Citations
16396
World Ranking
1236
National Ranking
4

Research.com Recognitions

  • 2013 - Fellow of the American Mathematical Society

Overview

Rodney G. Downey is affiliated with Victoria University of Wellington in New Zealand. Their research spans across the fields of Computer Science and Mathematics, with a focus on Computational Theory and Mathematics, Mathematical Physics, and related subfields.

The main topics of their work include:

  • Computability, Logic, AI Algorithms
  • Advanced Topology and Set Theory
  • Semigroups and Automata Theory
  • Mathematical and Theoretical Analysis
  • Benford's Law and Fraud Detection
  • Cellular Automata and Applications
  • Mathematical Dynamics and Fractals

Rodney G. Downey has published multiple recent papers including:

  • "Computably Compact Metric Spaces," 2023, Bulletin of Symbolic Logic
  • "Graphs are not universal for online computability," 2020, Journal of Computer and System Sciences
  • "Punctually presented structures II: comparing presentations," 2024, Archive for Mathematical Logic
  • "Relativizing computable categoricity," 2021, Proceedings of the American Mathematical Society
  • "Cousin's lemma in second-order arithmetic," 2022, Proceedings of the American Mathematical Society Series B

Notable frequent co-authors include:

  • Alexander Melnikov
  • Noam Greenberg
  • Daniel Turetsky
  • Keng Meng Ng
  • Matthew Harrison-Trainor

Frequent publication venues where their work appears include:

  • arXiv (Cornell University)
  • Journal of Symbolic Logic
  • Bulletin of Symbolic Logic
  • Journal of Computer and System Sciences
  • Archive for Mathematical Logic

Rodney G. Downey has a forthcoming book titled Computable Structure Theory to be published by Springer Nature in 2025.

In 2013, they were recognized as a Fellow of the American Mathematical Society.

Best Publications

  • Parameterized Complexity

    Rodney G. Downey;M. R. Fellows

  • Fundamentals of Parameterized Complexity

    Rodney G. Downey;Michael R. Fellows

  • Algorithmic Randomness and Complexity

    Rod Downey;Denis Hirschfeldt

  • Fixed-parameter tractability and completeness II: on completeness for W [1]

    Rod G. Downey;Michael R. Fellows

  • On problems without polynomial kernels

    Hans L. Bodlaender;Rodney G. Downey;Michael R. Fellows;Danny Hermelin

  • Fixed-Parameter Tractability and Completeness I: Basic Results

    Rod G. Downey;Michael R. Fellows

  • Parameterized complexity: A framework for systematically confronting computational intractability.

    Rodney G. Downey;Michael R. Fellows;Ulrike Stege

  • Parameterized Computational Feasibility

    Rodney G. Downey;Michael R. Fellows

  • Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues

    Karl A. Abrahamson;Rodney G. Downey;Michael R. Fellows

  • Fixed Parameter Tractability and Completeness.

    Rodney G. Downey;Michael R. Fellows

  • Algorithmic randomness and complexity. Theory and Applications of Computability

    Rodney G. Downey;Denis R. Hirschfeldt

  • Fixed-parameter intractability

    R.G. Downey;M.R. Fellows

  • Cutting Up Is Hard To Do: The Parameterised Complexity of k-Cut and Related Problems

    Rodney G. Downey;Vladimir Estivill-Castro;Michael Fellows;Elena Prieto

  • Advice classes of parameterized tractability

    Liming Cai;Jianer Chen;Rodney G. Downey;Michael R. Fellows

  • Parameterized complexity analysis in computational biology

    Hans L. Bodlaender;Rodney G. Downey;Michael R. Fellows;Michael T. Hallett

  • The Parametrized Complexity of Some Fundamental Problems in Coding Theory

    Rod G. Downey;Michael R. Fellows;Alexander Vardy;Geoff Whittle

  • On the parameterized complexity of short computation and factorization

    Liming Cai;Jianer Chen;Rodney G. Downey;Michael R. Fellows

  • On Problems without Polynomial Kernels (Extended Abstract)

    Hans L. Bodlaender;Rodney G. Downey;Michael R. Fellows;Danny Hermelin

  • Array nonrecursive sets and multiple permitting arguments

    Rod Downey;Carl Jockusch;Michael Stob

  • Parameterized complexity for the skeptic

    R. Downey

  • Cutting Up is Hard to Do: the Parameterized Complexity of k-cut and Related Problems.

    Rodney G. Downey;Vladimir Estivill-Castro;Michael R. Fellows;Elena Prieto

Frequent Co-Authors

Michael R. Fellows
Michael R. Fellows Lebanese American University
Carl G. Jockusch
Carl G. Jockusch University of Illinois at Urbana-Champaign
Hans L. Bodlaender
Hans L. Bodlaender Utrecht University
Moshe Y. Vardi
Moshe Y. Vardi Rice University
Martin Grohe
Martin Grohe RWTH Aachen University
Jeffrey B. Remmel
Jeffrey B. Remmel University of California, San Diego
Gerhard J. Woeginger
Gerhard J. Woeginger RWTH Aachen University
Lance Fortnow
Lance Fortnow Illinois Institute of Technology
Frances A. Rosamond
Frances A. Rosamond University of Bergen
Jianer Chen
Jianer Chen Texas A&M University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students studying Mathematics in the USA, expanding skill sets with related online degrees can enhance career prospects. For example, pursuing the cheapest online masters in finance offers strong financial analytical skills that complement quantitative expertise. This can open doors in financial sectors such as investment banking and risk management.

Another growing option is earning an MBA quickly. The fastest online MBA programs allow professionals to boost leadership and managerial capabilities without pausing their careers. These degrees are ideal for mathematicians aiming for roles in business analytics or strategic management.

Similarly, a masters in marketing combines data-driven decision-making with creative insight, helping graduates thrive in market research and consumer analytics.

For those interested in a focused business education, there are excellent 1 year MBA programs that provide intensive training, perfect for entering management roles swiftly with a strong quantitative background.

Best Scientists Citing Rodney G. Downey

Trending Scientists

Recently Published Articles