Quantcast
peoplepill id: johan-hastad
JH
1 views today
1 views this week
Johan Håstad

Johan Håstad

Swedish computer scientist
Johan Håstad
The basics

Quick Facts

Intro Swedish computer scientist
A.K.A. Johan Torkel Håstad
Is Mathematician Computer scientist Engineer Professor Educator
From Sweden
Type Academia Engineering Mathematics Technology Science
Gender male
Birth 19 November 1960, Sweden, Sweden
Age: 59 years
Star sign ScorpioScorpio
The details

Biography

Johan Torkel Håstad ([ˈjûːan ˈhǒːsta]; born 19 November 1960) is a Swedish theoretical computer scientist most known for his work on computational complexity theory. He was the recipient of the Gödel Prize in 1994 and 2011 and the ACM Doctoral Dissertation Award in 1986, among other prizes. He has been a professor in theoretical computer science at the Royal Institute of Technology in Stockholm, Sweden since 1988, becoming a full professor in 1992. He is a member of the Royal Swedish Academy of Sciences since 2001.

He received his B.S. in Mathematics at Stockholm University in 1981, his M.S. in Mathematics at Uppsala University in 1984 and his Ph.D. in Mathematics from MIT in 1986.

Håstad's thesis and 1994 Gödel Prize concerned his work on lower bounds on the size of constant-depth Boolean circuits for the parity function. 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 circuit complexity with applications to learnability, the IP hierarchy, and proof systems.

He also received the 2011 Gödel Prize for his work on optimal inapproximability results. In particular, he improved the PCP theorem (which won the same prize in 2001) to give a probabilistic verifier for NP problems which reads only three bits. Further, he used these results to prove results in hardness of approximation.

In 1998 Håstad was an Invited Speaker of the International Congress of Mathematicians in Berlin. In 1999 he was an Erdős Lecturer at the Hebrew University of Jerusalem. In 2012, he became a fellow of the American Mathematical Society. He was elected as an ACM Fellow in 2018 for "contributions in circuit complexity, approximability and inapproximability, and foundations of pseudorandomness".

The contents of this page are sourced from Wikipedia article on 10 Mar 2020. The contents are available under the CC BY-SA 4.0 license.
comments so far.
Comments
Reference sources
References
https://www.genealogy.math.ndsu.nodak.edu/id.php?id=79819
https://simons.berkeley.edu/people/johan-h%C3%A5stad
https://www.sigact.org/Prizes/Godel/1994.html
https://www.sigact.org/Prizes/Godel/2011.html
https://www.elibm.org/ft/10011600000
http://www.ams.org/profession/fellows-list
https://www.acm.org/media-center/2018/december/fellows-2018
http://www.nada.kth.se/~johanh/
https://www.imo-official.org/participant_r.aspx?id=13
https://dl.acm.org/author_page.cfm?id=81100025353
https://ci.nii.ac.jp/author/DA01463048?l=en
arrow-left arrow-right arrow-up arrow-down instagram whatsapp myspace quora soundcloud spotify tumblr vk website youtube stumbleupon comments comments pandora gplay iheart tunein pandora gplay iheart tunein itunes