Shmuel Safra
Academic
Who is Shmuel Safra?
Shmuel Safra is Professor of Computer Science at Tel Aviv University, Israel. Born in Jerusalem.
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 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".
We need you!
Help us build the largest biographies collection on the web!
- Education
- Weizmann Institute of Science
- Employment
- Tel Aviv University
Submitted
on July 23, 2013
Citation
Use the citation below to add to a bibliography:
Style:MLAChicagoAPA
"Shmuel Safra." Biographies.net. STANDS4 LLC, 2024. Web. 30 May 2024. <https://www.biographies.net/people/en/shmuel_safra>.
Discuss this Shmuel Safra biography with the community:
Report Comment
We're doing our best to make sure our content is useful, accurate and safe.
If by any chance you spot an inappropriate comment while navigating through our website please use this form to let us know, and we'll take care of it shortly.
Attachment
You need to be logged in to favorite.
Log In