Shmuel Safra
Shmuel Safra ( Hebrew שמואל "מולי" ספרא, called Muli Safra) (* in Jerusalem ) is an Israeli computer scientist .
Safra received his PhD in 1990 from the Weizmann Institute for Science with Amir Pnueli ( Complexity of Automata on Infinite Objects ). As a post-doc he was at Stanford University and at the IBM Almaden Research Center , where he worked with Sanjeev Arora on the PCP theorem . He is Professor of Computer Science at Tel Aviv University .
In 2001 he received the Gödel Prize for his contributions to the PCP theorem. In addition to complexity theory, he also deals with automaton theory .
Irit Dinur is one of his doctoral students .
Web links
- Muli Safra's home page at Tel Aviv University
Individual evidence
- ↑ Sanjeev Arora, Safra: Probabilistic checking of proofs: A new characterization of NP, Journal of the ACM, Volume 45, 1998, pp. 70-122
| personal data | |
|---|---|
| SURNAME | Safra, Shmuel |
| BRIEF DESCRIPTION | Israeli computer scientist |
| DATE OF BIRTH | 20th century |
| PLACE OF BIRTH | Jerusalem |