Avi Wigderson was born in
Haifa, Israel, to
Holocaust survivors.[7] Wigderson is a graduate of the
Hebrew Reali School in Haifa, and did his undergraduate studies at the
Technion in
Haifa, graduating in 1980. He went on to graduate study at
Princeton University, where he received his Ph.D in computer science in 1983 after completing a doctoral dissertation, titled "Studies in
computational complexity", under the supervision of
Richard Lipton.[8][9]
2018: Elected as an
ACM Fellow for "contributions to theoretical computer science and mathematics".[13]
2019: The
Knuth Prize for his contributions to "the foundations of computer science in areas including randomized computation, cryptography,
circuit complexity,
proof complexity, parallel computation, and our understanding of fundamental graph properties".[14]
2021: Shared the
Abel Prize with
László Lovász "for their foundational contributions to theoretical computer science and discrete mathematics, and their leading role in shaping them into central fields of modern mathematics."[15][16][17]
April 2024: The
Turing Award, by the
Association for Computing Machinery, for "reshaping our understanding of the role of randomness in computation, and for decades of intellectual leadership in theoretical computer science."[5][6]
References
^Wigderson, Avi (22 May 2014),
Resumé(PDF),
archived(PDF) from the original on 5 March 2016, retrieved 7 March 2016