About: Ran Raz

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Ran Raz Goto Sponge NotDistinct Permalink

An Entity of Type : yago:Whole100003553, within Data Space : dbpedia.org associated with source document(s)
QRcode icon

http://dbpedia.org/describe/?url=http%3A%2F%2Fdbpedia.org%2Fresource%2FRan_Raz

Ran Raz (Hebrew: רָן רָז) is a computer scientist who works in the area of computational complexity theory. He was a professor in the faculty of mathematics and computer science at the Weizmann Institute. He is now a professor of computer science at Princeton University. Ran Raz received his Ph.D. at the Hebrew University of Jerusalem in 1992 under Avi Wigderson and Michael Ben-Or. Ran Raz is well known for his work on interactive proof systems. His two most-cited papers are on multi-prover interactive proofs and on probabilistically checkable proofs.

Attributes	Values
rdf:type	Thing foaf:Person person dul:NaturalPerson Eukaryote Person Human Animal animal eukaryote scientist species schema:Person yago:WikicatLivingPeople yago:WikicatTheoreticalComputerScientists Scientist yago:CausalAgent100007347 yago:ComputerScientist109951070 yago:ComputerUser109951274 yago:LivingThing100004258 yago:Object100002684 yago:Organism100004475 yago:Person100007846 yago:PhysicalEntity100001930 yago:WikicatIsraeliComputerScientists yago:YagoLegalActor yago:YagoLegalActorGeo yago:Scientist110560637 yago:Whole100003553
rdfs:label	Ran Raz (de) Ran Raz (in) Ran Raz (fr) Ran Raz (en) Ran Raz (pt) 然·拉茨 (zh)
rdfs:comment	Ran Raz (bahasa Ibrani: רָן רָז‎) adalah seorang yang bekerja dalam bidang . Ia adalah profesor di fakultas matematika dan ilmu komputer di . Ia kini menjadi profesor ilmu komputer di Universitas Princeton. (in) Ran Raz est un informaticien israélien spécialiste de théorie de la complexité. (fr) 然·拉茨 (英語：Ran Raz, 希伯來語：רָן רָז‎) 是一位专长于计算复杂性理论的计算机科学家。他现在是以色列魏茨曼科學研究學院数学与计算机科学学部的教授。然·拉茨最著名的工作是交互式证明系统。他的引用数最多的两篇论文是：一篇)是关于；另一篇)是关于. 然·拉茨曾于2002年获得。他也曾多次获得领域顶级会议的最佳论文奖项。他的工作)获得2004年的最佳论文奖。他的工作 )获得2004年IEEE 的最佳论文奖。他的工作)获得2008年IEEE 的最佳论文奖。 (zh) Ran Raz ist ein israelischer Informatiker, der sich insbesondere mit Komplexitätstheorie befasst. Raz wurde 1992 an der Hebräischen Universität bei Avi Wigderson promoviert (Communication Complexity and Circuit Lower Bounds). Er ist Professor am Weizmann-Institut. 2000/2001, 2002 und 2012 war er am Institute for Advanced Study. (de) Ran Raz (Hebrew: רָן רָז) is a computer scientist who works in the area of computational complexity theory. He was a professor in the faculty of mathematics and computer science at the Weizmann Institute. He is now a professor of computer science at Princeton University. Ran Raz received his Ph.D. at the Hebrew University of Jerusalem in 1992 under Avi Wigderson and Michael Ben-Or. Ran Raz is well known for his work on interactive proof systems. His two most-cited papers are on multi-prover interactive proofs and on probabilistically checkable proofs. (en) Ran Raz é um cientista da computação israelense, que trabalha principalmente com teoria da complexidade computacional. Raz obteve um doutorado em 1992 na Universidade Hebraica de Jerusalém, orientado por Avi Wigderson, com a tese Communication Complexity and Circuit Lower Bounds. É professor do Instituto Weizmann de Ciência. Em 2000/2001, 2002 e 2012 esteve no Instituto de Estudos Avançados de Princeton. (pt)
foaf:name	Ran Raz (en)
foaf:homepage	http://www.wisdom.weizmann.ac.il/~ranraz/
name	Ran Raz (en)
foaf:depiction
dcterms:subject	Living people Year of birth missing (living people) Theoretical computer scientists Israeli computer scientists Weizmann Institute of Science faculty
Wikipage page ID	21565753 (xsd:integer)
Wikipage revision ID	1020414787 (xsd:integer)
Link from a Wikipage to another Wikipage	Princeton University Interactive proof system Living people Year of birth missing (living people) SIAM Journal on Computing Computational complexity theory Computer science Computer scientist Probabilistically checkable proof Theoretical computer science Avi Wigderson Theoretical computer scientists Erdős Prize Hebrew University of Jerusalem Israeli computer scientists Weizmann Institute of Science faculty Symposium on Theory of Computing Symposium on Foundations of Computer Science Weizmann Institute Conference on Computational Complexity Multi-prover interactive proof
Link from a Wikipage to an external page	http://www.wisdom.weizmann.ac.il/~ranraz/
sameAs	Ran Raz Ran Raz Ran Raz Ran Raz Ran Raz Ran Raz Ran Raz Ran Raz Ran Raz Ran Raz Ran Raz Ran Raz Ran Raz Ran Raz
thesis title	Communication Complexity and Circuit Lower Bounds (en)
thesis year	1992 (xsd:integer)
workplaces	Princeton University Weizmann Institute (en)
dbp:wikiPageUsesTemplate	dbt:Authority_control dbt:Citation dbt:Harvtxt dbt:Reflist dbt:Script/Hebrew dbt:Infobox_scientist dbt:Compu-scientist-stub

Faceted Search & Find service v1.17_git139 as of Feb 29 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 08.03.3330 as of Mar 19 2024, on Linux (x86_64-generic-linux-glibc212), Single-Server Edition (62 GB total memory, 54 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software