Avi Wigderson

Avi Wigderson
Herbert H. Maass Professor
School of 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)?

Princeton University, Ph.D. 1983; University of California, Berkeley, Visiting Assistant Professor 1983–84; IBM Research, San Jose, California, Visiting Scientist 1984–85; Mathematical Sciences Research Institute, Berkeley, California, Fellow 1985–86; The Hebrew University of Jerusalem, Senior Lecturer 1986–87, Associate Professor 1987–92, Computer Science Institute, Professor 1991–2003, Chairman 1993–95; Princeton University, Visiting Associate Professor 1990–92, Visiting Professor 1995–96; Institute for Advanced Study, Member 1995–96, 1997, 1998–99, Professor 1999–2003; Herbert H. Maass Professor 2003–; Bergman Fellowship 1989; American Academy of Arts and Sciences, Member; National Academy of Sciences, Member; Rolf Nevanlinna Prize 1994; Yoram Ben-Porat Presidential Prize for Outstanding Researcher; American Mathematical Society, Levi L. Conant Prize 2008; Gödel Prize 2009

Individual Homepage