معرفی
Johan Hastad is a Full Professor in Computer Science at the Royal Institute of Technology (KTH), where he has been a faculty member since 1986. His research focuses on complexity theory, cryptography, and approximation of NP-hard optimization problems. Prior to KTH, he held an Associate Professor position at the same institution (1988–1992) and completed a postdoctoral fellowship at the Massachusetts Institute of Technology (MIT) in 1986.
- Ph.D. in Mathematics from MIT (1986)
Hastad's work has profoundly influenced theoretical computer science, particularly in foundational areas like computational complexity and cryptographic algorithms. His research on approximating NP-hard optimization problems has addressed critical challenges in algorithm design and hardness of approximation.
Scientific Awards:
- ACM Doctoral Dissertation Award (1986)
- Chester Carlson's research prize (1990)
- Gödel Prize (1994, 2011)
- Invited speaker at the International Congress of Mathematicians (1998)
- Göran Gustafsson prize in mathematics (1999)
- Member of the Royal Swedish Academy of Sciences (2001)
- Plenary speaker at the European Congress of Mathematics (2004)
- Knuth Prize (2018) for foundational contributions to computer science
Hastad has also served on the board of the School of Computer Science and Communication at KTH (2005–2011), demonstrating his leadership in academic governance.
