Avi Wigderson was born in Haifa, Israel, to Holocaust survivors.[7] Wigderson is a graduate of the Hebrew Reali School in Haifa. He began his undergraduate studies at the Technion in 1977 in Haifa, graduating in 1980.[8] In the Technion he met his wife Edna.[8] 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.[9][10] He is credited with expanding significantly the field of ‘computational complexity’, the study of the efficiency and speed of algorithms.[8] This field has now become a subject on its own.[8]
Wigderson investigated Computational questions and specifically the role of randomness in the field. Wigderson together with Noam Nisan and Russell Impagliazzo discovered that for algorithms that solve problems through coin flipping, there exists an algorithm that is almost as fast that does not use coin flipping as long as presets are met.[8]
Wigderson developed the Zig Zag product together with Omer Reingold and Salil Vadhan, the Zig Zag product links complexity theory, graph theory and group theory. The Zig Zag product for example can help one understand how to get out of a maze.[8] Today complexity theory is used in cryptography.[8]
2018: Elected as an ACM Fellow for "contributions to theoretical computer science and mathematics".[14]
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".[15]
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."[16][17][18]
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