This HTML5 document contains 21 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

PrefixNamespace IRI
n6http://commons.wikimedia.org/wiki/Special:FilePath/Sanjeev_Arora.jpg?width=
dbpedia-owlhttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n5http://dbpedia.org/resource/University_of_California,
dchttp://purl.org/dc/elements/1.1/
rdfshttp://www.w3.org/2000/01/rdf-schema#
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n8http://commons.wikimedia.org/wiki/Special:FilePath/Sanjeev_Arora.
xsdhhttp://www.w3.org/2001/XMLSchema#
dbpediahttp://dbpedia.org/resource/
Subject Item
dbpedia:Sanjeev_Arora
rdfs:comment
Sanjeev Arora (born January 1968) is an Indian American theoretical computer scientist who is best known for his work on probabilistically checkable proofs and, in particular, the PCP theorem. He is currently the Charles C.
foaf:name
Sanjeev Arora Arora, Sanjeev
foaf:depiction
n8:jpg
dc:description
Theoretical computer scientist
dbpedia-owl:almaMater
n5:_Berkeley dbpedia:Massachusetts_Institute_of_Technology
dbpedia-owl:award
dbpedia:Gödel_Prize dbpedia:Fulkerson_Prize
dbpedia-owl:birthPlace
dbpedia:Rajasthan dbpedia:India dbpedia:Jodhpur
dbpedia-owl:birthYear
1968-01-01Z
dbpedia-owl:citizenship
dbpedia:United_States
dbpedia-owl:doctoralAdvisor
dbpedia:Umesh_Vazirani
dbpedia-owl:field
dbpedia:Theoretical_computer_science
dbpedia-owl:knownFor
dbpedia:PCP_theorem dbpedia:Probabilistically_checkable_proof
dbpedia-owl:notableStudent
dbpedia:Subhash_Khot
dbpedia-owl:residence
dbpedia:United_States
dbpedia-owl:thumbnail
n6:300