Uriel fig

from Wikipedia, the free encyclopedia

Uriel Feige ( Hebrew אוריאל פייגה, * 1959 ) is an Israeli computer scientist .

Feige studied computer science at the Technion from 1977 and at the Weizmann Institute from 1985 . He was also a computer engineer in the Israeli army from 1980 to 1985. In 1987 he received his diploma (Interactive Proofs) and received his doctorate in 1990 at the Weizmann Institute under Adi Shamir (Alternative Models for Zero Knowledge Interactive Proofs). As a post-doc he was at Princeton University and in 1991/92 at the IBM Thomas J. Watson Research Center . From 1992 he was at the Weizmann Institute, from 2003 on with a full professorship. Since 2007 he has been head of the Computer Science and Applied Mathematics department. From 2004 to 2007 he was in the theory group at Microsoft Research and in 1998/99 at the Compaq Systems Research Center in Palo Alto .

In addition to complexity theory, he deals with cryptography and random walks. For his work on the PCP theorem and its application, he received the Gödel Prize with others in 2001 . In cryptography he used, among other things, zero-knowledge evidence (Fiat-Shamir-Feige identification system 1988). In 2002 he was invited speaker at the International Congress of Mathematicians in Beijing (Approximation thresholds for combinatorial optimization problems).

Web links

Individual evidence

  1. ^ He won the Gödel Prize in 2001 "for the PCP theorem and its applications to hardness of approximation", Born 1959, Nationality Israel, "Technion-Israel Institute of Technology", "Weizmann Institute of Science": Uriel Feige. Retrieved January 13, 2019 (en-EN).