Rod Downey

from Wikipedia, the free encyclopedia
Rod Downey, Oberwolfach 2012

Rodney "Rod" Graham Downey (born September 20, 1957 ) is a New Zealand - Australian mathematician and computer scientist .

Downey studied mathematics at the University of Queensland with a bachelor's degree in 1978 and at Monash University (then Chisholm Institute of Technology), where he received his doctorate in 1982 under John Newsome Crossley ( Abstract Dependence, Recursion Theory and the Lattice of Recursively Enumerable Filters ) and then was a lecturer . In 1982 he was Visiting Assistant Professor at Western Illinois University , 1983 to 1985 Lecturer at the National University of Singapore and 1985/86 Visiting Assistant Professor at the University of Illinois at Urbana-Champaign . From 1986 he was a lecturer at Victoria University of Wellington , where he became a reader in 1991 and was given a personal chair in 1995.

He was visiting professor and visiting scholar at the National University of Singapore, Cornell University, University of Notre Dame, University of Chicago, University of Wisconsin, in Siena and 2012 Fellow at the Isaac Newton Institute .

He is particularly concerned with complexity theory and founded the field of parameterized complexity and parameterized algorithms with Michael Fellows .

From 2008 to 2010 he was James Cook Fellow of the Royal Society of New Zealand, whose Fellow he became in 1996 and whose Hamilton Award he received in 1992 and the Hector Medal in 2011, and in 2003 the first MacLaurin Fellow of the New Zealand Institute for Mathematics and its Applications (whose Co-director he is). In 2008 he became a Fellow of the Association for Computing Machinery , 2013 a Fellow of the Australian Mathematical Society and 2012 a Fellow of the American Mathematical Society . In 2016 he received a Humboldt Research Prize and in 2016 the Shoenfield Prize of the Association of Symbolic Logic for his book Algorithmic Randomness and Complexity with Hirschfeldt. In 2014 he and Hans Bodlaender, Rod Downey, Danny Hermelin, Lance Fortnow and Rahul Santhanam received the Nerode Prize of the European Association for Theoretical Computer Science (from Bodlaender, Downey, Fellows, Hermelin for their work On problems without polynomial kernels , Journal of Computer and System Sciences, Vol. 75, 2009, pp. 423-434, on that a large class of FPT problems do not have no polynomial kernels). In 2018 he was a Gödel lecturer .

From 2001 to 2003 he was President of the New Zealand Mathematics Society. From 1999 to 2004 he was Editor and Coordinating Editor of the Journal of Symbolic Logic from 2000 to 2004 and Managing Editor of the Bulletin of Symbolic Logic from 2004 to 2010 . He has also been editor of Theory of Computing Systems (formerly Mathematical Systems Theory ) since 2006 , of Computability since 2011, and of the Archive for Mathematical Logic since 2009 .

In 2006 he was invited speaker at the International Congress of Mathematicians in Madrid ( Algorithmic randomness and computability ).

He has Australian and New Zealand citizenship.

Fonts

  • with Michael R. Fellows: Parametrized Complexity , Springer, Monographs in Computer Science 1999
  • with D. Hirschfeldt: Algorithmic randomness and complexity , Springer 2010
  • with M. Fellows: Fundamentals in parametrized complexity , Springer 2013
  • with Keng Meng Ng, Reed Solomon: Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees , Memoirs American Mathematical Society, pdf
  • with Jan Reimann: Algorithmic randomness , Scholarpedia
  • with M. Fellows: Fixed-parameter tractability and completeness , 4 parts, part 1 (Basic Results), SIAM Journal on Computing, Volume 24, 1995, pp. 873–921, part 2 (The completeness for W [1]), Theoretical Computer Science, Volume 141, 1995, pp. 109-131, Part 3 (Some structural aspects of the W-Hierarchy) in: K. Ambos-Spies, S. Homer, U. Schoning (Eds.), Complexity theory. Current Research, Cambridge University Press 1993, pp. 166-191, Part 4 (On Completeness for W [P] and PSPACE analogues) with Abrahamson, Annals of Pure and Applied Logic, Volume 73, 1995, pp. 235-276

Web links

Individual evidence

  1. Rod Downey in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. ^ Abstract at Science Direct
  3. ^ Nerode Prize, EATCS