معرفی
Avi Wigderson is the Herbert H. Maass Professor in the School of Mathematics at the Institute for Advanced Study, Princeton. He is a leading authority in theoretical computer science, particularly computational complexity theory. Wigderson organizes the Computer Science and Discrete Mathematics (CSDM) program at the Institute, fostering interdisciplinary research at the intersection of mathematics and computer science.
Wigderson earned his Ph.D. (1983), M.A. (1982), and M.S.E. (1981) from Princeton University. Prior to his current position, he held appointments at The Hebrew University of Jerusalem (1986-2003), Princeton University (1990-1992), Mathematical Sciences Research Institute, Berkeley (1985-1986), IBM Research (1984-1985), and University of California, Berkeley (1983-1984).
Wigderson's research spans computational complexity theory, randomness and computation, algorithms and optimization, circuit complexity, proof complexity, quantum computation and communication, and cryptography. His work explores fundamental questions like whether mathematical creativity can be automated (P vs NP problem), the security of electronic commerce, the role of randomness in computation, and the potential of quantum mechanics to enhance computation. He has made significant contributions to understanding the power and limitations of efficient computation.
Analysis of Wigderson's recent publications reveals a strong focus on optimization, complexity theory, and their mathematical foundations. His work connects diverse areas including non-commutative algebra, geometric complexity, graph theory, and quantum computing. A recurring theme is exploring whether fundamental computational problems like P vs NP can be addressed through optimization techniques such as gradient descent. His research shows increasing interdisciplinary connections between theoretical computer science, mathematics, and physics.
- ACM A.M. Turing Award (2023)
- Abel Prize (2021)
- Donald E. Knuth Prize (2019)
- Gödel Prize (2009)
- American Mathematical Society's Levi L. Conant Prize (2008)
- Rolf Nevanlinna Prize (1994)
- Yoram Ben-Porat Presidential Prize for Outstanding Researcher (1994)
- Bergman Fellowship (1989)
- Member, American Academy of Arts and Sciences
- Member, National Academy of Sciences
While specific details about Wigderson's students are not provided in the source material, his extensive lecture series, workshops, and program organization suggest significant mentorship activities. His book "Mathematics and Computation" published by Princeton University Press serves as an educational resource for students and researchers. Wigderson has organized major programs at the Institute for Advanced Study including "Lower Bounds in Computational Complexity" (2018) and "Pseudorandomness" (2017), creating research opportunities for numerous scholars.
Wigderson leads the Computer Science and Discrete Mathematics (CSDM) program at the Institute for Advanced Study, which brings together researchers from mathematics and computer science to explore fundamental questions in computation. His work with collaborators across multiple institutions has established connections between theoretical computer science and diverse fields including quantum information theory, algebraic geometry, and optimization. Recent projects focus on non-commutative optimization and its applications to computational complexity problems.
حوزههای پژوهشی
