Age, Biography and Wiki

Shmuel Safra was born on 1960 in Jerusalem, is an Israeli computer scientist. Discover Shmuel Safra's Biography, Age, Height, Physical Stats, Dating/Affairs, Family and career updates. Learn How rich is he in this year and how he spends money? Also learn how he earned most of networth at the age of 62 years old?

Popular As N/A
Occupation N/A
Age 62 years old
Zodiac Sign N/A
Born 1962
Birthday
Birthplace Jerusalem
Nationality Israel

We recommend you to check the complete list of Famous People born on . He is a member of famous computer with the age 62 years old group.

Shmuel Safra Height, Weight & Measurements

At 62 years old, Shmuel Safra height not available right now. We will update Shmuel Safra's Height, weight, Body Measurements, Eye Color, Hair Color, Shoe & Dress size soon as possible.

Physical Status
Height Not Available
Weight Not Available
Body Measurements Not Available
Eye Color Not Available
Hair Color Not Available

Dating & Relationship status

He is currently single. He is not dating anyone. We don't have much information about He's past relationship and any previous engaged. According to our Database, He has no children.

Family
Parents Not Available
Wife Not Available
Sibling Not Available
Children Not Available

Shmuel Safra Net Worth

His net worth has been growing significantly in 2023-2024. So, how much is Shmuel Safra worth at the age of 62 years old? Shmuel Safra’s income source is mostly from being a successful computer. He is from Israel. We have estimated Shmuel Safra's net worth, money, salary, income, and assets.

Net Worth in 2024 $1 Million - $5 Million
Salary in 2024 Under Review
Net Worth in 2023 Pending
Salary in 2023 Under Review
House Not Available
Cars Not Available
Source of Income computer

Shmuel Safra Social Network

Instagram
Linkedin
Twitter
Facebook
Wikipedia Shmuel Safra Wikipedia
Imdb

Timeline

Shmuel (Muli) Safra (שמואל ספרא) is an Israeli computer scientist.

He is a Professor of Computer Science at Tel Aviv University, Israel.

He was 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 (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.

2001

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".