Name Rod Downey | ||
 | ||
Books Fundamentals of Parameterized Complexity, Algorithmic Randomness and Complexity, Parameterized Complexity | ||
Short and very sweet 32 bar jig devised by rod downey
Rodney Graham Downey (born 20 September 1957) is an Australian and New Zealand mathematician and computer scientist, a professor in the School of Mathematics, Statistics and Operations Research 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.
Contents
- Short and very sweet 32 bar jig devised by rod downey
- Biography
- Publications
- Awards and honours
- References
Biography
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. 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, and was given a personal chair at Victoria in 1995.
Downey was president of the New Zealand Mathematical Society from 2001 to 2003.
Publications
Downey is the co-author of three books:
He is also the author or co-author of over 200 research papers, including a highly cited sequence of four papers with Michael Fellows and Karl Abrahamson setting the foundation for the study of parameterised complexity.
Awards and honours
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". He became a fellow of the Royal Society of New Zealand in 1996. He was elected as an ACM Fellow in 2007 "for contributions to computability and complexity theory", becoming the second ACM Fellow in New Zealand, and in the same year was elected as a fellow of the New Zealand Mathematical Society. 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. 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." In 2012 he became a fellow of the American Mathematical Society. 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.