On the works of Avi Wigderson
Boaz Barak, Yael Kalai, Ran Raz, Salil Vadhan, Nisheeth K., Vishnoi

TL;DR
This paper surveys Avi Wigderson's influential contributions across cryptography, pseudorandomness, complexity theory, and optimization, highlighting how his work has shaped fundamental questions and methods in these fields.
Contribution
It provides a broad overview of Wigderson's diverse research contributions and their impact on multiple core areas of computer science and mathematics.
Findings
Wigderson's work answered central questions in cryptography and complexity.
He introduced key definitions that advanced theoretical understanding.
His research forged unexpected connections across fields.
Abstract
This is an overview of some of the works of Avi Wigderson, 2021 Abel prize laureate. Wigderson's contributions span many fields of computer science and mathematics. In this survey we focus on four subfields: cryptography, pseudorandomness, computational complexity lower bounds, and the theory of optimization over symmetric manifolds. Even within those fields, we are not able to mention all of Wigderson's results, let alone cover them in full detail. However, we attempt to give a broad view of each field, as well as describe how Wigderson's papers have answered central questions, made key definitions, forged unexpected connections, or otherwise made lasting changes to our ways of thinking in that field.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems
