Avi Wigderson
Avi Wigderson (Template:Lang-he) is an Israeli mathematician and computer scientist, a professor of mathematics at the Institute for Advanced Study in Princeton. His research interests include complexity theory, parallel algorithms, graph theory, cryptography, distributed computing, and neural networks.[1]
Biography
Wigderson did his undergraduate studies at the Technion in Haifa, Israel, graduating in 1980, and went on to graduate study at Princeton University. He received his Ph.D. in 1983 for work in computational complexity under the supervision of Richard Lipton.[2] After short-term positions at the University of California, Berkeley, the IBM Almaden Research Center in San Jose, California, and the Mathematical Sciences Research Institute in Berkeley, he joined the faculty of Hebrew University in 1986. In 1999 he also took a position at the Institute for Advanced Study, and in 2003 he gave up his Hebrew University position to take up full-time residence at the IAS.[1]
Awards and honors
Wigderson received the Nevanlinna Prize in 1994 for his work on computational complexity.[3] Along with Omer Reingold and Salil Vadhan he won the 2009 Gödel Prize for work on the zig-zag product of graphs, a method of combining smaller graphs to produce larger ones used in the construction of expander graphs.[4]
References
- ^ a b Short biography from Wigderson's web site, retrieved 2010-05-03.
- ^ Avi Wigderson at the Mathematics Genealogy Project.
- ^ "HU Professor Wins 'Nobel Prize' Of Computers", Jerusalem Post, Aug 3, 1994.
- ^ Avi Wigderson and Colleagues Honored with 2009 Gödel Prize, Institute for Advanced Study, retrieved 2010-05-03.
External links
   | This article about an Israeli scientist is a stub. You can help Wikipedia by expanding it. |
 | This article about an Asian mathematician is a stub. You can help Wikipedia by expanding it. |