Education
Uppsala University; Stockholm University. Massachusetts Institute of Technology.
- Photos
- Works
- Photos
- Works
Johan Hastad
Edit Profileengineer mathematician university professor computer scientist
Career
He is a professor in theoretical computer science at the Royal Institute of Technology in Stockholm, Sweden since 1992. He received his Bachelor of Surgery in Mathematics at Stockholm University in 1981, his Master of Surgery in Mathematics at Uppsala University in 1984 and his Doctor of Philosophy in Mathematics from Massachusetts Institute of Technology in 1986. After Andrew Yao proved that such circuits require exponential size, Håstad proved nearly optimal lower bounds on the necessary size through his switching lemma, which became an important technical tool in Boolean function complexity.
In 2012 he became a fellow of the American Mathematical Society.
Achievements
-
He was the recipient of the Gödel Prize in 1994 and 2011 and the Association for Computing Machinery (ACM) Doctoral Dissertation Award in 1986, among other prizes. Håstad"s thesis and Gödel Prize (1994) concerned his work on lower bounds on the size of constant-depth Boolean circuits for the parity function. He received the 2011 Gödel Prize for his work on optimal inapproximability results.
Membership
Royal Swedish Academy of Sciences. American Mathematical Society]
He is a member of the Royal Swedish Academy of Sciences since 2001.
-
Born
-
Nationality
Sweden
Awards
-
Gödel PrizeGödel Prize; Doctoral Dissertation Award
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory (ACM SIGACT).The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory (ACM SIGACT).