description Avi Wigderson Overview
Avi Wigderson is an Israeli computer scientist and mathematician at the Institute for Advanced Study in Princeton. His research spans computational complexity theory, algorithms, and cryptography, where he has made influential contributions to understanding the role of randomness in computation. He demonstrated that many probabilistic algorithms can be efficiently derandomized under standard computational hardness assumptions. His work earned him the Abel Prize in 2021 and the ACM Turing Award in 2023, making him one of the most decorated theoretical computer scientists.
insights Ranking position
Avi Wigderson ranks #1 of 185 in the Computer Scientist ranking, ahead of Tony Hoare.
help Avi Wigderson FAQ
Why did Avi Wigderson win the 2021 Turing Award?
Wigderson received the 2021 Turing Award, announced in 2024, for foundational contributions to the theory of computation, particularly his work linking randomness and computation in complexity theory. He showed that randomness is not essential for efficient computation under standard hardness assumptions, unifying two previously separate areas of theoretical computer science.
What did Avi Wigderson prove about randomness in computation?
Working with collaborators like Noam Nisan and Russell Impagliazzo, Wigderson proved that any problem efficiently solvable with randomness can also be solved deterministically with similar efficiency, assuming certain computational hardness conditions hold. This established deep connections between computational hardness and pseudorandomness, showing they are essentially two sides of the same coin.
Where does Avi Wigderson work?
Wigderson has been a professor at the Institute for Advanced Study (IAS) in Princeton, New Jersey, since 1999, where he leads the computer science and discrete mathematics program. The IAS, where Albert Einstein and John von Neumann once worked, is one of the world's most prestigious research institutions.
What is the Zig-Zag graph product that Wigderson co-developed?
Wigderson co-authored a 1991 paper introducing the Zig-Zag graph product, which led to explicit constructions of expander graphs — combinatorial structures critical in algorithms, cryptography, and network design. This result solved a long-standing open problem by providing an efficient combinatorial construction of expanders, one of the most versatile tools in theoretical computer science.
explore Explore More
Reviews & Comments
Write a Review
Be the first to review
Share your thoughts with the community and help others make better decisions.
