| Birthplace
|
http://dbpedia.org/resource/Jerusalem +
|
| http://dbpedia.org/ontology/abstract
|
Shmuel Safra (hebräisch שמואל "מולי" ספרא, … Shmuel Safra (hebräisch שמואל "מולי" ספרא, genannt Muli Safra) (* in Jerusalem) ist ein israelischer Informatiker. Safra wurde 1990 am Weizmann-Institut für Wissenschaften bei Amir Pnueli promoviert (Complexity of Automata on Infinite Objects). Als Post-Doc war er an der Stanford University und am IBM Almaden Research Center, wo es zu seiner Zusammenarbeit mit Sanjeev Arora über das PCP-Theorem kam. Er ist Professor für Informatik an der Universität Tel Aviv. 2001 erhielt er den Gödel-Preis für seine Beiträge zum PCP-Theorem. Neben Komplexitätstheorie befasst er sich auch mit Automatentheorie. 2022 war er eingeladener Sprecher auf dem Internationalen Mathematikerkongress (Mathematics of computation through the lens of linear equations and lattices). Zu seinen Doktoranden zählt Irit Dinur.). Zu seinen Doktoranden zählt Irit Dinur.
, Shmuel Safra (n. en Jerusalén) es un profe … Shmuel Safra (n. en Jerusalén) es un profesor israelí de ciencias de la computación de la Universidad de Tel Aviv. Su investigación incluye las áreas de complejidad computacional y teoría de autómatas. Su trabajo en complejidad computacional incluye la clasificación de problemas de aproximación y la teoría de PCP, incluyendo el , que da una fuerte caracterización de la clase NP, a través de un oráculo que puede ser verificado leyendo sólo un número constante de bits. En su trabajo en teoría de autómatas investiga el determinismo y complementos de autómatas finitos sobre cadenas de caracteres infinitos. En 2001, Safra ganó el Premio Gödel en ciencias de la computación teórica por sus artículos "Interactive Proofs and the Hardness of Approximating Cliques" y "Probabilistic Checking of Proofs: A New Characterization of NP". of Proofs: A New Characterization of NP".
, Shmuel (Muli) Safra est un professeur et chercheur en informatique théorique, de l'université de Tel Aviv.
, Shmuel Safra (Hebrew: שמואל ספרא) is an Is … Shmuel Safra (Hebrew: שמואל ספרא) 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. 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". of Proofs: A New Characterization of NP".
|
| http://dbpedia.org/ontology/academicDiscipline
|
http://dbpedia.org/resource/Computational_complexity_theory +
, http://dbpedia.org/resource/Computer_science +
|
| http://dbpedia.org/ontology/almaMater
|
http://dbpedia.org/resource/Weizmann_Institute_of_Science +
|
| http://dbpedia.org/ontology/award
|
http://dbpedia.org/resource/G%C3%B6del_Prize +
|
| http://dbpedia.org/ontology/doctoralAdvisor
|
http://dbpedia.org/resource/Amir_Pnueli +
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
http://computational.complexity.googlepages.com/home +
, http://www.cs.tau.ac.il/~safra/ +
|
| http://dbpedia.org/ontology/wikiPageID
|
15875029
|
| http://dbpedia.org/ontology/wikiPageLength
|
2652
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
1101158070
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Category:Theoretical_computer_scientists +
, http://dbpedia.org/resource/Finite_state_machine +
, http://dbpedia.org/resource/Weizmann_Institute_of_Science +
, http://dbpedia.org/resource/Vertex_cover_problem +
, http://dbpedia.org/resource/Category:1962_births +
, http://dbpedia.org/resource/Omega_language +
, http://dbpedia.org/resource/B%C3%BCchi_automaton +
, http://dbpedia.org/resource/Automata_theory +
, http://dbpedia.org/resource/Israel +
, http://dbpedia.org/resource/Computer_Science +
, http://dbpedia.org/resource/Computational_complexity_theory +
, http://dbpedia.org/resource/Tel_Aviv_University +
, http://dbpedia.org/resource/Bull_graph +
, http://dbpedia.org/resource/PCP_%28complexity%29 +
, http://dbpedia.org/resource/Streett_automaton +
, http://dbpedia.org/resource/NP-hard +
, http://dbpedia.org/resource/Category:G%C3%B6del_Prize_laureates +
, http://dbpedia.org/resource/Category:Israeli_computer_scientists +
, http://dbpedia.org/resource/Category:Weizmann_Institute_of_Science_alumni +
, http://dbpedia.org/resource/Category:Israeli_Jews +
, http://dbpedia.org/resource/Category:Living_people +
, http://dbpedia.org/resource/Amir_Pnueli +
, http://dbpedia.org/resource/Rabin_automaton +
, http://dbpedia.org/resource/G%C3%B6del_Prize +
, http://dbpedia.org/resource/NP_%28complexity%29 +
, http://dbpedia.org/resource/Jerusalem +
, http://dbpedia.org/resource/Set_cover_problem +
, http://dbpedia.org/resource/Category:People_from_Jerusalem +
, http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/PCP_theorem +
, http://dbpedia.org/resource/Approximation_algorithm +
, http://dbpedia.org/resource/Category:Tel_Aviv_University_faculty +
|
| http://dbpedia.org/property/almaMater
|
Ph.D. Weizmann Institute of Science 1990
|
| http://dbpedia.org/property/birthDate
|
1960
|
| http://dbpedia.org/property/birthPlace
|
http://dbpedia.org/resource/Jerusalem +
|
| http://dbpedia.org/property/caption
|
Shmuel Safra
|
| http://dbpedia.org/property/doctoralAdvisor
|
http://dbpedia.org/resource/Amir_Pnueli +
|
| http://dbpedia.org/property/field
|
http://dbpedia.org/resource/Computer_science +
, http://dbpedia.org/resource/Computational_complexity_theory +
|
| http://dbpedia.org/property/name
|
Shmuel Safra
|
| http://dbpedia.org/property/prizes
|
http://dbpedia.org/resource/G%C3%B6del_Prize +
|
| http://dbpedia.org/property/wikiPageUsesTemplate
|
http://dbpedia.org/resource/Template:Short_description +
, http://dbpedia.org/resource/Template:Infobox_scientist +
, http://dbpedia.org/resource/Template:Authority_control +
, http://dbpedia.org/resource/Template:G%C3%B6del_winners +
, http://dbpedia.org/resource/Template:MathGenealogy +
|
| http://dbpedia.org/property/wordnet type
|
http://www.w3.org/2006/03/wn/wn20/instances/synset-scientist-noun-1 +
|
| http://dbpedia.org/property/workInstitution
|
http://dbpedia.org/resource/Tel_Aviv_University +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Weizmann_Institute_of_Science_alumni +
, http://dbpedia.org/resource/Category:G%C3%B6del_Prize_laureates +
, http://dbpedia.org/resource/Category:Theoretical_computer_scientists +
, http://dbpedia.org/resource/Category:Tel_Aviv_University_faculty +
, http://dbpedia.org/resource/Category:1962_births +
, http://dbpedia.org/resource/Category:Living_people +
, http://dbpedia.org/resource/Category:Israeli_Jews +
, http://dbpedia.org/resource/Category:People_from_Jerusalem +
, http://dbpedia.org/resource/Category:Israeli_computer_scientists +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Scientist +
|
| http://schema.org/sameAs
|
http://viaf.org/viaf/93947294 +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Shmuel_Safra?oldid=1101158070&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Shmuel_Safra +
|
| http://xmlns.com/foaf/0.1/name
|
Shmuel Safra
|
| owl:sameAs |
http://www.wikidata.org/entity/Q92811 +
, http://yago-knowledge.org/resource/Shmuel_Safra +
, http://fa.dbpedia.org/resource/%D8%B4%D9%85%D9%88%D8%A6%D9%84_%D8%B5%D9%81%D8%B1%D8%A7 +
, https://dblp.org/pid/s/ShmuelSafra +
, http://rdf.freebase.com/ns/m.03qczld +
, http://viaf.org/viaf/93947294 +
, http://fr.dbpedia.org/resource/Shmuel_Safra +
, http://es.dbpedia.org/resource/Shmuel_Safra +
, http://dbpedia.org/resource/Shmuel_Safra +
, https://global.dbpedia.org/id/55BEz +
, http://he.dbpedia.org/resource/%D7%A9%D7%9E%D7%95%D7%90%D7%9C_%D7%A1%D7%A4%D7%A8%D7%90 +
, http://arz.dbpedia.org/resource/%D8%B4%D9%85%D9%88%D8%A6%D9%8A%D9%84_%D8%B5%D9%81%D8%B1%D8%A7 +
, http://de.dbpedia.org/resource/Shmuel_Safra +
|
| rdf:type |
http://dbpedia.org/ontology/Scientist +
, http://dbpedia.org/class/yago/YagoLegalActorGeo +
, http://dbpedia.org/class/yago/YagoLegalActor +
, http://www.wikidata.org/entity/Q19088 +
, http://dbpedia.org/class/yago/WikicatPeopleFromJerusalem +
, http://xmlns.com/foaf/0.1/Person +
, http://dbpedia.org/class/yago/Recipient109627906 +
, http://dbpedia.org/class/yago/WikicatTheoreticalComputerScientists +
, http://dbpedia.org/class/yago/Person100007846 +
, http://dbpedia.org/class/yago/WikicatIsraeliComputerScientists +
, http://dbpedia.org/class/yago/Object100002684 +
, http://dbpedia.org/ontology/Species +
, http://dbpedia.org/class/yago/WikicatLivingPeople +
, http://dbpedia.org/class/yago/WikicatIsraeliPeople +
, http://dbpedia.org/class/yago/Whole100003553 +
, http://dbpedia.org/class/yago/Scientist110560637 +
, http://dbpedia.org/class/yago/WikicatIsraeliInformationTheorists +
, http://dbpedia.org/class/yago/Honoree110183757 +
, http://www.wikidata.org/entity/Q5 +
, http://www.wikidata.org/entity/Q729 +
, http://www.wikidata.org/entity/Q215627 +
, http://dbpedia.org/class/yago/WikicatG%C3%B6delPrizeLaureates +
, http://dbpedia.org/class/yago/PhysicalEntity100001930 +
, http://www.wikidata.org/entity/Q901 +
, http://dbpedia.org/class/yago/Organism100004475 +
, http://schema.org/Person +
, http://dbpedia.org/class/yago/LivingThing100004258 +
, http://dbpedia.org/ontology/Person +
, http://dbpedia.org/class/yago/Theorist110706812 +
, http://dbpedia.org/class/yago/ComputerUser109951274 +
, http://www.ontologydesignpatterns.org/ont/dul/DUL.owl#NaturalPerson +
, http://dbpedia.org/class/yago/ComputerScientist109951070 +
, http://dbpedia.org/ontology/Eukaryote +
, http://dbpedia.org/class/yago/Acquirer109764201 +
, http://dbpedia.org/class/yago/Intellectual109621545 +
, http://dbpedia.org/class/yago/WikicatComputerScientists +
, http://dbpedia.org/class/yago/Laureate110249011 +
, http://dbpedia.org/class/yago/CausalAgent100007347 +
, http://dbpedia.org/ontology/Animal +
|
| rdfs:comment |
Shmuel Safra (Hebrew: שמואל ספרא) is an Is … Shmuel Safra (Hebrew: שמואל ספרא) 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.eading only a constant number of its bits.
, Shmuel Safra (n. en Jerusalén) es un profe … Shmuel Safra (n. en Jerusalén) es un profesor israelí de ciencias de la computación de la Universidad de Tel Aviv. Su investigación incluye las áreas de complejidad computacional y teoría de autómatas. Su trabajo en complejidad computacional incluye la clasificación de problemas de aproximación y la teoría de PCP, incluyendo el , que da una fuerte caracterización de la clase NP, a través de un oráculo que puede ser verificado leyendo sólo un número constante de bits. leyendo sólo un número constante de bits.
, Shmuel (Muli) Safra est un professeur et chercheur en informatique théorique, de l'université de Tel Aviv.
, Shmuel Safra (hebräisch שמואל "מולי" ספרא, … Shmuel Safra (hebräisch שמואל "מולי" ספרא, genannt Muli Safra) (* in Jerusalem) ist ein israelischer Informatiker. Safra wurde 1990 am Weizmann-Institut für Wissenschaften bei Amir Pnueli promoviert (Complexity of Automata on Infinite Objects). Als Post-Doc war er an der Stanford University und am IBM Almaden Research Center, wo es zu seiner Zusammenarbeit mit Sanjeev Arora über das PCP-Theorem kam. Er ist Professor für Informatik an der Universität Tel Aviv. Zu seinen Doktoranden zählt Irit Dinur.v. Zu seinen Doktoranden zählt Irit Dinur.
|
| rdfs:label |
Shmuel Safra
|
