|Born||9 September 1956|
Princeton University (Ph.D.)
|Awards||Nevanlinna Prize (1994)|
Gödel Prize (2009)
Knuth Prize (2019)
|Fields||Theoretical computer science|
|Institutions||Institute for Advanced Study|
|Thesis||Studies in Computational Complexity (1983)|
|Doctoral advisor||Richard Lipton|
|Doctoral students||Dorit Aharonov|
Avi Wigderson (Hebrew: ; born 9 September 1956) is an Israeli mathematician and computer scientist. He is the Herbert H. Maass Professor in the school of mathematics at the Institute for Advanced Study in Princeton, New Jersey. His research interests include complexity theory, parallel algorithms, graph theory, cryptography, distributed computing, and neural networks.
Wigderson did his undergraduate studies at the Technion in Haifa, Israel, graduating in 1980, and went on to graduate study at Princeton University. 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. After short-term positions at the University of California, Berkeley, the IBM Almaden Research Center in San Jose, California, and the Mathematical Sciences Research Institute in Berkeley, he joined the faculty of Hebrew University in 1986. In 1999 he also took a position at the Institute for Advanced Study, and in 2003 he gave up his Hebrew University position to take up full-time residence at the IAS.
Wigderson received the Nevanlinna Prize in 1994 for his work on computational complexity. Along with Omer Reingold and Salil Vadhan he won the 2009 Gödel Prize for work on the zig-zag product of graphs, a method of combining smaller graphs to produce larger ones used in the construction of expander graphs. He was elected to the National Academy of Sciences in 2013. He was elected as an ACM Fellow in 2018 for "contributions to theoretical computer science and mathematics". In 2019, Wigderson was awarded 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".