Bakhadyr M. Khoussainov (Russian: Бахадыр Хусаинов[1]) is a computer scientist and mathematician, who was born and educated in the Soviet Union, works in the fields of mathematical logic, computability theory, computable model theory and theoretical computer science.[2] With Anil Nerode, he is the co-founder of the theory of automatic structures,[3] which is an extension of the theory of automatic groups.

Biography

Khoussainov received his undergraduate degree from the Mathematics Department of Novosibirsk State University in 1984. In 1988, he received his Candidate of Sciences degree (equivalent to a PhD) in Algebra and Logic from Novosibirsk State University with the supervision of an Academician of the Russian Academy of Sciences Sergei Goncharov.

In 1991 Khoussainov joined Cornell University and held an Ｈ.C. Wang Assistant Professorship at the Mathematics Department from 1995 to 1997.

In 1996 Khoussainov joined the University of Auckland, and remained until 2021 when he moved to the UESTC.

Khoussainov has held visiting positions at Cornell University, the University of Chicago, the National University of Singapore, Kyoto University, JAIST and the University of Wisconsin-Madison.

Awards and recognition

Khoussainov is a co-winner (together with Cristian Calude, Sanjay Jain, Wei Li and Frank Stephan) of the STOC 2017 best paper award[4] for a quasi-polynomial time algorithm deciding parity games. For this work, Khoussainov and this paper's co-authors were awarded the 2021 EATCS-IPEC Nerode Prize.[5] In 2023 while working in the UESTC, China, Khoussainov has also been elected as a foreign member of The Academia Europaea, the European Academy of Sciences, Humanities, Letters, and Law.

A fellow of the Royal Society of New Zealand,[6] Khoussainov has also received:

References

  1. ↑ "Бахадыр Хусаинов" (PDF). Новая Зеландия говорит по-русски 2013. p. 134.
  2. ↑ "People – Algorithms and Logic Group in UESTC". Retrieved 2022-04-30.
  3. ↑ Khoussainov, Bakhadyr; Nerode, Anil (1995). "Automatic presentations of structures". In Leivant, Daniel (ed.). Logic and Computational Complexity. Lecture Notes in Computer Science. Vol. 960. Berlin, Heidelberg: Springer. pp. 367–392. doi:10.1007/3-540-60178-3_93. ISBN 978-3-540-44720-7.
  4. ↑ "ACM SIGACT - STOC Best Paper Award". www.sigact.org. Retrieved 2021-02-06.
  5. ↑ "IPEC Nerode Prize".
  6. ↑ "View our current Fellows". Royal Society Te Apārangi. Retrieved 2021-02-06.
  7. ↑ "Bakh Khoussainov receives Humboldt Research Award | New Zealand Association of von Humboldt Fellows". www.humboldt.org.nz. Archived from the original on 2021-02-11. Retrieved 2021-02-06.
  8. ↑ "LMS-NZMS Forder and Aitken Lectureships of London Mathematical Society". www.lms.ac.uk. Retrieved 2021-02-06.
  9. ↑ "Invitational Fellowships for Research in Japan | Japan Society for the Promotion of Science". www.jsps.go.jp. Retrieved 2022-04-30.
  10. ↑ "Search Marsden awards 2008–2017". Royal Society Te Apārangi. Retrieved 2021-02-06.
  11. ↑ "New Zealand Mathematical Society : Awards and Prizes". nzmathsoc.org.nz. Retrieved 2021-02-06.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.