| Rod Downey | |
| Honorific Suffix: | FRSNZ, FNZMS, FACM |
| Birth Date: | 1957 9, df=yes |
| Nationality: | New Zealander, Australian |
| Occupation: | Professor of Mathematics, Victoria University of Wellington |
| Known For: | Computability theory, incl. parameterised complexity |
| Awards: | RSNZ Hector Medal, Rutherford Medal, James Cook Research Fellowship |
| Website: | Here |
| Alma Mater: | Monash (PhD 1982) Queensland (BSc 1978) |
| Doctoral Advisor: | John Crossley |
Rodney Graham Downey (born 20 September 1957) is a New Zealand and Australian mathematician and computer scientist,[1] an emeritus professor in the School of Mathematics and Statistics at Victoria University of Wellington in New Zealand.[2] 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.
Downey earned a bachelor's degree at the University of Queensland in 1978, and then went on to graduate school at Monash University, earning a doctorate in 1982 under the supervision of John Crossley.[3] [2] After holding teaching and visiting positions at the Chisholm Institute of Technology, Western Illinois University, the National University of Singapore, and the University of Illinois at Urbana-Champaign, he came to New Zealand in 1986 as a lecturer at Victoria University. He was promoted to reader in 1991, was given a personal chair at Victoria in 1995, and retired in 2021.[3] [1]
Downey was president of the New Zealand Mathematical Society from 2001 to 2003.[3] [4]
Downey is the co-author of five books:
He is also the author or co-author of over 200 research papers,[3] [5] including a highly cited sequence of four papers with Michael Fellows and Karl Abrahamson setting the foundation for the study of parameterised complexity.[6]
In 1990, Downey won the Hamilton Research Award from the Royal Society of New Zealand.[7] In 1992, Downey won the Research Award of the New Zealand Mathematical Society "for penetrating and prolific investigations that have made him a leading expert in many aspects of recursion theory, effective algebra and complexity".[8]
In 1994, he won the New Zealand Association of Scientists Research Award, and became a fellow of the Royal Society of New Zealand in 1996.[9] In 2006, he became the first New Zealand-based mathematician to give an Invited Lecture at the International Congress of Mathematicians.
He has also given invited lectures at the International Congress of Logic, Methodology and Philosophy of Science and the ACM Conference on Computational Complexity. He was elected as an ACM Fellow in 2007 "for contributions to computability and complexity theory", becoming the second ACM Fellow in New Zealand,[10] [11] and in the same year was elected as a fellow of the New Zealand Mathematical Society. Also in 2007 he was awarded a James Cook Research Fellowship for research on the nature of computation.[12]
In 2010 he won the Shoenfield Prize (for articles) of the Association for Symbolic Logic for his work with Denis Hirschfeldt, Andre Nies, and Sebastiaan Terwijn on randomness.[13] In 2011, the Royal Society of New Zealand gave him their Hector Medal "for his outstanding, internationally acclaimed work in recursion theory, computational complexity, and other aspects of mathematical logic and combinatorics."[14] [15] In 2012, he became a fellow of the American Mathematical Society.[16] In 2013, he became a Fellow of the Australian Mathematical Society.
In 2014, he was awarded the Nerode Prize from the European Association for Theoretical Computer Science, jointly with Hans Bodlaender, Michael Fellows, Danny Hermelin, Lance Fortnow and Rahul Santhanam for their work on kernelization lower bounds. In October 2016, Downey received a distinguished Humboldt Research Award for his academic contributions.
With Denis Hirschfeldt, Downey won another Shoenfield Prize from the Association for Symbolic Logic, this time the 2016 book prize for Algorithmic Randomness and Complexity. In 2018, Downey delivered the Gödel Lecture of the Association for Symbolic Logic, titled Algorithmic randomness, at the European Summer Meeting at Udine, Italy. The same year, Downey was awarded the Rutherford Medal, the highest honour awarded by the Royal Society of New Zealand, "for his pre-eminent revolutionary research into computability, including development of the theory of parameterised complexity and the algorithmic study of randomness."[17] In 2022, Downey was awarded the New Zealand Association of von Humboldt Fellows Research Award for research over the preceding five years.[18] In 2023, Downey was awarded the S. Barry Cooper Prize from the Association for Computability in Europe.[19] This award is awarded every two to three years "to a researcher who has contributed to a broad understanding and foundational study of computability by outstanding results, by seminal and lasting theory building, by exceptional service to the researchcommunities involved, or by a combination of these."[20]