01 · A life in computing
The person behind the work
Avi Wigderson studies the power and limits of efficient computation, especially the role of randomness. His work has connected computational complexity with cryptography, interactive proofs, and ways to replace random choices with deterministic methods. At the Institute for Advanced Study, he has helped develop a broad mathematical understanding of algorithms. His award recognizes both foundational results and the influence of these ideas across theoretical computer science.
The contribution, explained
Avi Wigderson reshaped understanding of randomness in computation and made broad contributions to theoretical computer science. Randomised algorithms can be powerful, but can their random choices be replaced by deterministic constructions? Work on pseudorandomness and derandomisation links that question to the difficulty of other computational problems.
Why it matters
These connections reveal that algorithm design, computational hardness and pseudorandomness are parts of a common theory.