Abstract
Rod Downey took up a lectureship in mathematics at the Victoria University of Wellington in 1986. At the time he was a promising young researcher with a dozen papers to his name. Thirty years on, the dozen has mushroomed into 250-plus as he has developed into a world leader in his field who has made a profound contribution to the mathematical research environment both internationally and in New Zealand. This article briefly outlines his exceptional career.
R. Goldblatt—Thanks to Noam Greenberg and Gaven Martin for information and comments.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Founded as Victoria College in 1897 in celebration of the Diamond Jubilee year of the reign of Queen Victoria.
- 2.
Named after Ernest Marsden, Professor of Physics at Victoria (1915–1922) and later head of the Government’s Department of Scientific and Industrial Research. As a student at Manchester he had conducted the famous Geiger–Marsden experiments that led Ernest Rutherford to conceive his nuclear model of the atom.
References
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999)
Downey, R.: The birth and early years of parameterized complexity. In: Bodlaender, H.L., Downey, R., Fomin, F.V., Marx, D. (eds.) The Multivariate Algorithmic Revolution and Beyond. LNCS, vol. 7370, pp. 17–38. Springer, Heidelberg (2012). doi:10.1007/978-3-642-30891-8_2
Downey, R. (ed.): Turing’s Legacy: Developments from Turing’s Ideas in Logic. Lecture Notes in Logic, vol. 42. Cambridge University Press and the Association for Symbolic Logic, Cambridge (2014)
Downey, R., Brendle, J., Goldblatt, R., Kim, B. (eds.): Proceedings of the 12th Asian Logic Conference. World Scientific, Singapore (2013)
Downey, R., Hirschfeldt, D. (eds.): Aspects of Complexity: Minicourses in Algorithmics, Complexity and Computational Algebra. de Gruyter Series in Logic and Its Applications, vol. 4. Walter de Gruyter, Beijing (2001)
Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013)
Downey, R.G., Hirschfeldt, D.R.: Algorithmic Randomness and Complexity. Theory and Applications of Computability. Springer, New York (2010)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Goldblatt, R. (2017). Cameo of a Consummate Computabilist. In: Day, A., Fellows, M., Greenberg, N., Khoussainov, B., Melnikov, A., Rosamond, F. (eds) Computability and Complexity. Lecture Notes in Computer Science(), vol 10010. Springer, Cham. https://doi.org/10.1007/978-3-319-50062-1_1
Download citation
DOI: https://doi.org/10.1007/978-3-319-50062-1_1
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-50061-4
Online ISBN: 978-3-319-50062-1
eBook Packages: Computer ScienceComputer Science (R0)