|Fields||Computer science, complexity theory|
|Institutions||Tel Aviv University|
|Alma mater||Ph.D. Weizmann Institute of Science 1990|
|Doctoral advisor||Amir Pnueli|
|Notable awards||Gödel Prize|
Safra's research areas include complexity theory and automata theory. His work in Complexity Theory includes the classification of approximation problems—showing them NP-hard even for weak factors of approximation—and the theory of probabilistically checkable proofs (PCP) and the PCP theorem, which gives stronger characterizations of the class NP, via a membership proof that can be verified reading only a constant number of its bits.
His work on automata theory investigates determinization and complementation of finite automata over infinite strings, in particular, the complexity of such translation for Büchi automata, Streett automata and Rabin automata.
In 2001, Safra won the Gödel Prize in theoretical computer science for his papers "Interactive Proofs and the Hardness of Approximating Cliques" and "Probabilistic Checking of Proofs: A New Characterization of NP".
- Muli Safra's Homepage
- Computational Complexity Theory Presentations
- Shmuel Safra at the Mathematics Genealogy Project