Jump to content

Rod Downey: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
Script-assisted fixes per WP:TIES, MOS:NUM, MOS:LINK
 
(65 intermediate revisions by 37 users not shown)
Line 1: Line 1:
{{Short description|Australian mathematician}}
{{EngvarB|date=September 2014}}
{{EngvarB|date=September 2014}}
{{Use dmy dates|date=September 2014}}
{{Use dmy dates|date=August 2020}}

[[File:Rod Downey.jpg|thumb|220px|Rod Downey]]
{{Infobox academic
⚫
'''Rodney Graham Downey''' (born 20 September 1957)<ref name="cv"/> is an Australian and [[New Zealand]] mathematician and computer scientist,<ref name="cf">{{citation|url=http://nzmathsoc.org.nz/downloads/centrefolds/NZMScentrefold91_Rod_Downey.pdf|title=Centrefold: Rod Downey|journal=Newsletter of the New Zealand Mathematical Society|volume=91|first=Geoff|last=Whittle|date=August 2004}}.</ref> a professor in the School of Mathematics, Statistics and Operations Research at [[Victoria University of Wellington]] in New Zealand.<ref name="vuw">[http://www.victoria.ac.nz/smsor/staff/rod-downey.aspx Faculty profile], Victoria University of Wellington, retrieved 19 February 2012.</ref> 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]].
| honorific_prefix =
| name = Rod Downey
| honorific_suffix = [[Royal Society Te Apārangi|FRSNZ]], [[New Zealand Mathematical Society|FNZMS]], [[ACM Fellow|FACM]]
| image = Rod Downey.jpg
| birth_date = {{birth date and age|df=yes|1957|09|20}}
| nationality = [[New Zealanders|New Zealander]], [[Australians|Australian]]
| occupation = Professor of Mathematics, [[Victoria University of Wellington]]
| known_for = [[Computability theory]], incl. [[parameterised complexity]]
| awards = [[Royal Society Te Apārangi|RSNZ]] [[Hector Medal]], [[Rutherford Medal (Royal Society of New Zealand)|Rutherford Medal]], [[James Cook Research Fellowship]]
| website = [https://homepages.ecs.vuw.ac.nz/~downey/ Here]
| alma_mater = [[Monash University|Monash]] (PhD 1982) <br /> [[University of Queensland|Queensland]] (BSc 1978)
| doctoral_advisor = [[John Newsome Crossley|John Crossley]]
⚫
}}

⚫
'''Rodney Graham Downey''' (born 20 September 1957)<ref name="cv"/> is a New Zealand and Australian mathematician and computer scientist,<ref name="cf">{{citation|url=http://nzmathsoc.org.nz/downloads/centrefolds/NZMScentrefold91_Rod_Downey.pdf|title=Centrefold: Rod Downey|journal=Newsletter of the New Zealand Mathematical Society|volume=91|first=Geoff|last=Whittle|date=August 2004}}.</ref> an emeritus professor in the School of Mathematics and Statistics at [[Victoria University of Wellington]] in New Zealand.<ref name="vuw">[http://www.victoria.ac.nz/smsor/staff/rod-downey.aspx Faculty profile], Victoria University of Wellington, retrieved 19 February 2012.</ref> 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]].


==Biography==
==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 (mathematician)|John Crossley]].<ref name="cv">[http://homepages.ecs.vuw.ac.nz/~downey/cv.pdf Curriculum vitae], retrieved 19 February 2012.</ref><ref name="vuw"/><ref>{{mathgenealogy|name=Rodney Graham Downey|id=59295}}</ref> After holding teaching and visiting positions at the [[Monash University, Caulfield campus|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.<ref name="cv"/><ref name="cf"/>
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 (mathematician)|John Crossley]].<ref name="cv">[http://homepages.ecs.vuw.ac.nz/~downey/cv.pdf Curriculum vitae], retrieved 19 February 2012.</ref><ref name="vuw"/><ref>{{mathgenealogy|name=Rodney Graham Downey|id=59295}}</ref> After holding teaching and visiting positions at the [[Monash University, Caulfield campus|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.<ref name="cv"/><ref name="cf"/>


Downey was president of the [[New Zealand Mathematical Society]] from 2001 to 2003.<ref name="cv"/><ref>{{citation|title=President's report 2001–2002|first=Rod|last=Downey|journal=Newsletter of the New Zealand Mathematical Society|volume=87|date=April 2003|url=http://nzmathsoc.org.nz/downloads/newsletters/NZMSnews87_Apr2003.pdf|pages=4–6}}.</ref>
Downey was president of the [[New Zealand Mathematical Society]] from 2001 to 2003.<ref name="cv"/><ref>{{citation|title=President's report 2001–2002|first=Rod|last=Downey|journal=Newsletter of the New Zealand Mathematical Society|volume=87|date=April 2003|url=http://nzmathsoc.org.nz/downloads/newsletters/NZMSnews87_Apr2003.pdf|pages=4–6}}.</ref>


==Publications==
==Publications==
Downey is the co-author of two books:
Downey is the co-author of six books:
*''Parameterized Complexity'' (with [[Michael Fellows]], Springer, 1999)
*''Parameterized Complexity'' (with [[Michael Fellows]], Springer, 1999)
*''Algorithmic Randomness and Complexity'' (with D. Hirschfeldt, Springer, 2010)
*''Algorithmic Randomness and Complexity'' (with D. Hirschfeldt, Springer, 2010)
*''Fundamentals of Parameterized Complexity'' (with [[Michael Fellows]], Springer, 2013)
⚫
He is also the author or co-author of over 200 research papers,<ref name="cv"/><ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/d/Downey:Rodney_G=.html Listing of Downey's computer science publications] in DBLP.</ref> including a highly cited sequence of four papers with Michael Fellows and Karl Abrahamson setting the foundation for the study of parameterised complexity.<ref>{{citation
*''Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees'' (with Keng Meng Ng and David Reed Solomon, Memoirs American Mathematical Society, Vol. 2184, 2020)
*''A Hierarchy of Turing Degrees'' (with Noam Greenberg, Annals of Mathematics Studies No. 206, Princeton University Press, 2020)
*''Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications, (Springer-Verlag Texts in Computer Science, 2024)
⚫
He is also the author or co-author of around 300 research papers,<ref name="cv"/><ref>[http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/d/Downey:Rodney_G=.html Listing of Downey's computer science publications] in DBLP.</ref> including a highly cited sequence of four papers with Michael Fellows and Karl Abrahamson setting the foundation for the study of parameterised complexity.<ref>{{citation
| last1 = Downey | first1 = Rod G.
| last1 = Downey | first1 = Rod G.
| last2 = Fellows | first2 = Michael R. | author2-link = Michael Fellows
| last2 = Fellows | first2 = Michael R. | author2-link = Michael Fellows
Line 23: Line 43:
| title = Fixed-parameter tractability and completeness. I. Basic results
| title = Fixed-parameter tractability and completeness. I. Basic results
| volume = 24
| volume = 24
| year = 1995}}. {{citation
| year = 1995| citeseerx = 10.1.1.408.3389}}. {{citation
| last1 = Downey | first1 = Rod G.
| last1 = Downey | first1 = Rod G.
| last2 = Fellows | first2 = Michael R. | author2-link = Michael Fellows
| last2 = Fellows | first2 = Michael R. | author2-link = Michael Fellows
| doi = 10.1016/0304-3975(94)00097-3
| doi = 10.1016/0304-3975(94)00097-3
| issue = 1–2
| issue = 1–2
| journal = Theoretical Computer Science
| journal = [[Theoretical Computer Science (journal)|Theoretical Computer Science]]
| mr = 1323150
| mr = 1323150
| pages = 109–131
| pages = 109–131
| title = Fixed-parameter tractability and completeness. II. On completeness for ''W''[1]
| title = Fixed-parameter tractability and completeness. II. On completeness for ''W''[1]
| volume = 141
| volume = 141
| year = 1995}}. {{citation
| year = 1995| doi-access = free
| citeseerx = 10.1.1.158.6771
}}. {{citation
| last1 = Downey | first1 = Rod
| last1 = Downey | first1 = Rod
| last2 = Fellows | first2 = Michael
| last2 = Fellows | first2 = Michael
Line 48: Line 70:
| doi = 10.1016/0168-0072(94)00034-Z
| doi = 10.1016/0168-0072(94)00034-Z
| issue = 3
| issue = 3
| journal = Annals of Pure and Applied Logic
| journal = [[Annals of Pure and Applied Logic]]
| mr = 1336643
| mr = 1336643
| pages = 235–276
| pages = 235–276
| title = Fixed-parameter tractability and completeness. IV. On completeness for W[P] and PSPACE analogues
| title = Fixed-parameter tractability and completeness. IV. On completeness for W[P] and PSPACE analogues
| volume = 73
| volume = 73
| year = 1995}}.</ref>
| year = 1995| doi-access =
}}.</ref>


==Awards and honours==
==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".<ref>[http://nzmathsoc.org.nz/?awards Awards], New Zealand Mathematical Society, retrieved 19 February 2012.</ref>
In 1990, Downey won the Hamilton Research Award from the [[Royal Society of New Zealand]].<ref>{{Cite web|url=https://royalsociety.org.nz/what-we-do/medals-and-awards/hamilton-award/recipients-2/|title = Recipients}}</ref> 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".<ref>[http://nzmathsoc.org.nz/?awards Awards]</ref>

He became a fellow of the [[Royal Society of New Zealand]] in 1996.<ref name="cv"/><ref>[http://www.royalsociety.org.nz/organisation/academy/fellowship/current-fellows/ List of Current Fellows of the Royal Society of New Zealand], retrieved 19 February 2012.</ref>
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.<ref name="cv" /><ref>[http://www.royalsociety.org.nz/organisation/academy/fellowship/current-fellows/ List of Current Fellows of the Royal Society of New Zealand], retrieved 19 February 2012.</ref> In 2006, he became the first New Zealand-based mathematician to give an Invited Lecture at the [[International Congress of Mathematicians]].
⚫
He was elected as an [[ACM Fellow]] in 2007 "for contributions to computability and complexity theory", becoming the second ACM Fellow in New Zealand,<ref>[http://fellows.acm.org/fellow_citation.cfm?id=4371977&srt=all ACM Fellow award citation], retrieved 19 February 2012.</ref><ref>[http://www.mcs.vuw.ac.nz/Main/ProfessorDowneyBecomesAcmFellow Professor Downey Becomes ACM Fellow], Victoria University of Wellington, 6 December 2007, retrieved 19 February 2012.</ref>

and in the same year was elected as a fellow of the New Zealand Mathematical Society.<ref name="cv"/>
He has also given invited lectures at the International Congress of Logic, Methodology and
⚫
In 2010 he won the Shoenfield Prize of the [[Association for Symbolic Logic]] for his work with Denis Hirschfeldt, Andrew Nies, and Sebastiaan Terwijn on randomness.<ref>[http://www.aslonline.org/Shoenfield_recipients.html Shoenfield Prize Recipients], [[Association for Symbolic Logic]], retrieved 19 February 2012.</ref>
⚫
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,<ref>[http://fellows.acm.org/fellow_citation.cfm?id=4371977&srt=all ACM Fellow award citation], retrieved 19 February 2012.</ref><ref>[http://www.mcs.vuw.ac.nz/Main/ProfessorDowneyBecomesAcmFellow Professor Downey Becomes ACM Fellow], Victoria University of Wellington, 6 December 2007, retrieved 19 February 2012.</ref> and in the same year was elected as a fellow of the [[New Zealand Mathematical Society]].<ref name="cv" /> Also in 2007 he was awarded a [[James Cook Research Fellowship]] for research on the nature of computation.<ref>{{Cite web |title=Search James Cook Fellowship awards 1996–2017 |url=https://www.royalsociety.org.nz/what-we-do/funds-and-opportunities/james-cook-research-fellowship/james-cook-research-fellowships-recipients/search-james-cook-fellowship-awards/ |access-date=2023-10-28 |website=Royal Society Te Apārangi}}</ref>
⚫
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."<ref>[http://nzmathsoc.org.nz/ Hector Medal to Rod Downey], New Zealand Mathematical Society, 16 November 2011, retrieved 19 February 2012.</ref><ref>[http://www.royalsociety.org.nz/2011/11/17/medals-awarded-to-top-new-zealand-researchers/ Medals awarded to top New Zealand researchers], RSNZ, 17 November 2011, retrieved 19 February 2012.</ref> In 2012 he became a fellow of the [[American Mathematical Society]].<ref>[http://www.ams.org/profession/fellows-list List of Fellows of the American Mathematical Society], retrieved 10 November 2012.</ref>

⚫
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]].<ref>[http://www.aslonline.org/Shoenfield_recipients.html Shoenfield Prize Recipients], [[Association for Symbolic Logic]], retrieved 19 February 2012.</ref>
⚫
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."<ref>[http://nzmathsoc.org.nz/ Hector Medal to Rod Downey], New Zealand Mathematical Society, 16 November 2011, retrieved 19 February 2012.</ref><ref>[http://www.royalsociety.org.nz/2011/11/17/medals-awarded-to-top-new-zealand-researchers/ Medals awarded to top New Zealand researchers], RSNZ, 17 November 2011, retrieved 19 February 2012.</ref> In 2012, he became a fellow of the [[American Mathematical Society]].<ref>[https://www.ams.org/profession/fellows-list List of Fellows of the American Mathematical Society], retrieved 10 November 2012.</ref> 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 (Royal Society of New Zealand)|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."<ref>[https://royalsociety.org.nz/what-we-do/medals-and-awards/medals-and-awards-news/2018-rutherford-medal-solving-cant-compute-and-is-that-random-sequence-really-random/ 2018 Rutherford Medal: Solving ‘Can’t compute’ and is that random sequence really random?]</ref> In 2022, Downey was awarded the New Zealand Association of von Humboldt Fellows Research Award for research over the preceding five years.<ref>{{cite web | url=https://www.humboldt.org.nz/2022/11/21/nz-humboldt-association-award-to-professor-rod-downey/ | title=NZ Humboldt Association Research Award to Professor Rod Downey &#124; New Zealand Association of von Humboldt Fellows }}</ref> In 2023, Downey was awarded the S. Barry Cooper Prize from the Association for Computability in Europe.<ref>{{cite web |
url=https://www.acie.eu/2023-s-barry-cooper-prize-awarded-to-rod-g-downey/|
title=2023 S. Barry Cooper Prize awarded to Rod G. Downey|
date=16 March 2023}}</ref> 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 research
communities involved, or by a combination of these."<ref>{{ cite web | url=https://www.acie.eu/in-memoriam-s-barry-cooper/s-barry-cooper-prize/| title=S. Barry Cooper Prize| date=18 July 2019}}</ref>


==References==
==References==
{{reflist|colwidth=30em}}
{{reflist}}


==External links==
==External links==
*[http://homepages.ecs.vuw.ac.nz/~downey/ Home page] at Victoria University of Wellington
*[http://homepages.ecs.vuw.ac.nz/~downey/ Home page] at Victoria University of Wellington


{{Recipients of the Rutherford Medal}}
{{Persondata
{{Recipients of the Hector Memorial Medal}}
| NAME = Downey, Rodney G.
{{Nerode Prize laureates}}
| ALTERNATIVE NAMES =
{{Authority control}}
| SHORT DESCRIPTION = Mathematician

| DATE OF BIRTH = 1957-09-20
| PLACE OF BIRTH =
| DATE OF DEATH =
| PLACE OF DEATH =
⚫
}}
{{DEFAULTSORT:Downey, Rodney G.}}
{{DEFAULTSORT:Downey, Rodney G.}}
[[Category:Living people]]
[[Category:Living people]]
Line 83: Line 113:
[[Category:Australian mathematicians]]
[[Category:Australian mathematicians]]
[[Category:New Zealand computer scientists]]
[[Category:New Zealand computer scientists]]
⚫
[[Category:New Zealand mathematicians]]
[[Category:University of Queensland alumni]]
[[Category:University of Queensland alumni]]
[[Category:Monash University alumni]]
[[Category:Monash University alumni]]
[[Category:Victoria University of Wellington faculty]]
[[Category:Academic staff of Victoria University of Wellington]]
[[Category:Theoretical computer scientists]]
[[Category:Theoretical computer scientists]]
[[Category:Mathematical logicians]]
[[Category:Mathematical logicians]]
[[Category:Fellows of the American Mathematical Society]]
[[Category:Fellows of the American Mathematical Society]]
[[Category:Fellows of the Association for Computing Machinery]]
[[Category:2007 fellows of the Association for Computing Machinery]]
[[Category:Fellows of the Royal Society of New Zealand]]
[[Category:Fellows of the Royal Society of New Zealand]]
[[Category:1957 births]]
[[Category:1957 births]]
⚫
[[Category:20th-century New Zealand mathematicians]]
[[Category:21st-century New Zealand mathematicians]]
[[Category:Recipients of the Rutherford Medal]]
[[Category:James Cook Research Fellows]]

Latest revision as of 07:25, 13 September 2024

Rod Downey
FRSNZ, FNZMS, FACM
Born (1957-09-20) 20 September 1957 (age 67)
NationalityNew Zealander, Australian
Occupation(s)Professor of Mathematics, Victoria University of Wellington
Known forComputability theory, incl. parameterised complexity
AwardsRSNZ Hector Medal, Rutherford Medal, James Cook Research Fellowship
Academic background
Alma materMonash (PhD 1982)
Queensland (BSc 1978)
Doctoral advisorJohn Crossley
WebsiteHere

Rodney Graham Downey (born 20 September 1957)[1] is a New Zealand and Australian mathematician and computer scientist,[2] an emeritus professor in the School of Mathematics and Statistics at Victoria University of Wellington in New Zealand.[3] 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.

Biography

[edit]

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.[1][3][4] 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.[1][2]

Downey was president of the New Zealand Mathematical Society from 2001 to 2003.[1][5]

Publications

[edit]

Downey is the co-author of six books:

  • Parameterized Complexity (with Michael Fellows, Springer, 1999)
  • Algorithmic Randomness and Complexity (with D. Hirschfeldt, Springer, 2010)
  • Fundamentals of Parameterized Complexity (with Michael Fellows, Springer, 2013)
  • Minimal Weak Truth Table Degrees and Computably Enumerable Turing Degrees (with Keng Meng Ng and David Reed Solomon, Memoirs American Mathematical Society, Vol. 2184, 2020)
  • A Hierarchy of Turing Degrees (with Noam Greenberg, Annals of Mathematics Studies No. 206, Princeton University Press, 2020)
  • Computability and Complexity: Foundations and Tools for Pursuing Scientific Applications, (Springer-Verlag Texts in Computer Science, 2024)

He is also the author or co-author of around 300 research papers,[1][6] including a highly cited sequence of four papers with Michael Fellows and Karl Abrahamson setting the foundation for the study of parameterised complexity.[7]

Awards and honours

[edit]

In 1990, Downey won the Hamilton Research Award from the Royal Society of New Zealand.[8] 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".[9]

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.[1][10] 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,[11][12] and in the same year was elected as a fellow of the New Zealand Mathematical Society.[1] Also in 2007 he was awarded a James Cook Research Fellowship for research on the nature of computation.[13]

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.[14] 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."[15][16] In 2012, he became a fellow of the American Mathematical Society.[17] 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."[18] In 2022, Downey was awarded the New Zealand Association of von Humboldt Fellows Research Award for research over the preceding five years.[19] In 2023, Downey was awarded the S. Barry Cooper Prize from the Association for Computability in Europe.[20] 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 research communities involved, or by a combination of these."[21]

References

[edit]
  1. ^ a b c d e f g Curriculum vitae, retrieved 19 February 2012.
  2. ^ a b Whittle, Geoff (August 2004), "Centrefold: Rod Downey" (PDF), Newsletter of the New Zealand Mathematical Society, 91.
  3. ^ a b Faculty profile, Victoria University of Wellington, retrieved 19 February 2012.
  4. ^ Rodney Graham Downey at the Mathematics Genealogy Project
  5. ^ Downey, Rod (April 2003), "President's report 2001–2002" (PDF), Newsletter of the New Zealand Mathematical Society, 87: 4–6.
  6. ^ Listing of Downey's computer science publications in DBLP.
  7. ^ Downey, Rod G.; Fellows, Michael R. (1995), "Fixed-parameter tractability and completeness. I. Basic results", SIAM Journal on Computing, 24 (4): 873–921, CiteSeerX 10.1.1.408.3389, doi:10.1137/S0097539792228228, MR 1342997. Downey, Rod G.; Fellows, Michael R. (1995), "Fixed-parameter tractability and completeness. II. On completeness for W[1]", Theoretical Computer Science, 141 (1–2): 109–131, CiteSeerX 10.1.1.158.6771, doi:10.1016/0304-3975(94)00097-3, MR 1323150. Downey, Rod; Fellows, Michael (1993), "Fixed-parameter tractability and completeness. III. Some structural aspects of the W hierarchy", Complexity theory, Cambridge: Cambridge Univ. Press, pp. 191–225, MR 1255345. Abrahamson, Karl A.; Downey, Rodney G.; Fellows, Michael R. (1995), "Fixed-parameter tractability and completeness. IV. On completeness for W[P] and PSPACE analogues", Annals of Pure and Applied Logic, 73 (3): 235–276, doi:10.1016/0168-0072(94)00034-Z, MR 1336643.
  8. ^ "Recipients".
  9. ^ Awards
  10. ^ List of Current Fellows of the Royal Society of New Zealand, retrieved 19 February 2012.
  11. ^ ACM Fellow award citation, retrieved 19 February 2012.
  12. ^ Professor Downey Becomes ACM Fellow, Victoria University of Wellington, 6 December 2007, retrieved 19 February 2012.
  13. ^ "Search James Cook Fellowship awards 1996–2017". Royal Society Te Apārangi. Retrieved 28 October 2023.
  14. ^ Shoenfield Prize Recipients, Association for Symbolic Logic, retrieved 19 February 2012.
  15. ^ Hector Medal to Rod Downey, New Zealand Mathematical Society, 16 November 2011, retrieved 19 February 2012.
  16. ^ Medals awarded to top New Zealand researchers, RSNZ, 17 November 2011, retrieved 19 February 2012.
  17. ^ List of Fellows of the American Mathematical Society, retrieved 10 November 2012.
  18. ^ 2018 Rutherford Medal: Solving ‘Can’t compute’ and is that random sequence really random?
  19. ^ "NZ Humboldt Association Research Award to Professor Rod Downey | New Zealand Association of von Humboldt Fellows".
  20. ^ "2023 S. Barry Cooper Prize awarded to Rod G. Downey". 16 March 2023.
  21. ^ "S. Barry Cooper Prize". 18 July 2019.
[edit]
  • Home page at Victoria University of Wellington
Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=Rod_Downey&oldid=1245483174"