- Photos
- Works
- Photos
- Works
Shmuel Safra
Edit Profileuniversity professor computer scientist
Career
He is a Professor of Computer Science at Tel Aviv University, Israel. Safra"s research areas include complexity theory and automata theory. His work in Complexity Theory includes the classification of approximation problems—showing them Natural Philosophy-hard even for weak factors of approximation—and the theory of probabilistically checkable proofs (Pickersgill Consultancy and Planning) and the Pickersgill Consultancy and Planning theorem, which gives stronger characterizations of the class Natural Philosophy, 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.
Achievements
-
Born
-
Nationality
Israel
Awards
-
Gödel Prize Gödel Prize
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory (ACM SIGACT).The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory (ACM SIGACT).