Avi Wigderson

Herbert H. Maass Professor
School of Mathematics

Computer Science and Discrete Mathematics

Affiliation

Mathematics

Avi Wigderson is a widely recognized authority in the diverse and evolving field of theoretical computer science. His main research area is computational complexity theory. This field studies the power and limits of efficient computation and is motivated by such fundamental scientific problems as: Does P = NP? (Can mathematical creativity be efficiently automated?) Can every efficient process be efficiently reversed? (Is electronic commerce secure?) Can randomness enhance efficient computation? Can quantum mechanics enhance efficient computation? How do we learn, and can machines be taught to learn like us (or better)?

Dates at IAS

Faculty
School of Mathematics
Visitor
School of Mathematics
Fall
Member
School of Mathematics
Fall
Member
School of Mathematics

Degrees

Princeton University
Ph.D.
1983
Princeton University
M.A.
1982
Princeton University
M.S.E.
1981

Honors

Awards: Donald E. Knuth Prize 2019; Gödel Prize 2009; American Mathematical Society, Levi L. Conant Prize 2008; Rolf Nevanlinna Prize 1994; Yoram Ben-Porat Presidential Prize for Outstanding Researcher 1994; Bergman Fellowship 1989
Memberships: American Academy of Arts and Sciences; National Academy of Sciences

Appointments

The Hebrew University of Jerusalem
Professor, Computer Science Institute 1991–2003, Chairman, Computer Science Institute 1993–95, Associate Professor 1987–92, Senior Lecturer 1986–87
Princeton University
Visiting Professor 1995–1996, Visiting Associate Professor 1990–1992
Mathematical Sciences Research Institute, Berkeley
Fellow
IBM Research, San Jose
Visiting Scientist
University of California, Berkeley
Visiting Assistant Professor