Speaker:
Rod Downey(professor in Victoria University of Wellington)
Time:
- 10:00-11:00 (Time in Beijing)
- 15:00-16:00 (Time in Auckland)
- December 10, 2021 (Friday)
Venue:
B1-518B, Research Building 4
Abstract:
I will report on some recent research giving a general framework for
algorithmics on online structures. Currently there are many algorithms and no
theoretical basis for this area. Tractability of questions highlight the need for
appropriate parameterizations such as my early work with C. McCartin, and
algorithmic structure of the presentations such as the recent works of Askes (my
current student) and my work joint with Bajenov, Khalimulin, and Melnikov.
Speaker Bio:
Professor Rod Downey contributed significantly to the modern development of theoretical computer science and logic. Professor Downey is a co-founder of parameterized complexity theory. He is known for his outstanding work in
computability and complexity. His work has been recognized through various prizes
and fellowships. Rod is an ACM fellow, AMS fellow, and a fellow of Royal Society
of New Zealand. He is a co-winner of EATCS Nerode prize, Humboldt prize, and
Shoenfield prize. He is the first New Zealand based mathematician and computer
scientists to give an invited lecture at the international congress of Mathematicians. In 2018, Downey was awarded Rutherford medal, the highest honor awarded by the Royal New Zealand Society. The same year Rod presented the Goldel lecture on algorithmic randomness.