Uriel Feige earned his PhD at the Weizmann Institute of Science in 1990. After conducting postdoctoral research at Princeton University and at the IBM T.J. Watson Research Center, he joined the Weizmann Institute faculty in 1992 and was appointed Full Professor in 2003. He spend the academic years 2004-2007 at Microsoft Research in Redmond, Washington, and is a consultant for Microsoft Research in Israel on a part-time basis. He received the 2001 Gödel Award and the 2005 SIAM Outstanding Paper Prize. He is interested in exploring the border line between P and NP, as it manifests itself in approximation of NP-hard optimization problems, in algorithms for random and semi-random instances of NP-hard problems, and in algorithms that provide speedup over exhaustive search.
- Fine-Grained Complexity and Algorithm Design, Fall 2015. Visiting Scientist.