Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q92664> ?p ?o }
- Q92664 description "Theoretical computer scientist".
- Q92664 description "Theoretical computer scientist".
- Q92664 subject Q5312304.
- Q92664 subject Q6368932.
- Q92664 subject Q6465255.
- Q92664 subject Q6647690.
- Q92664 subject Q6946332.
- Q92664 subject Q7012291.
- Q92664 subject Q7017947.
- Q92664 subject Q8503235.
- Q92664 subject Q9580543.
- Q92664 abstract "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. Fitzmorris Professor of Computer Science at Princeton University, and his research interests include computational complexity theory, uses of randomness in computation, probabilistically checkable proofs, computing approximate solutions to NP-hard problems, and geometric embeddings of metric spaces.He received a B.S. in Mathematics with Computer Science from MIT in 1990 and received a Ph.D. in Computer Science from the University of California, Berkeley in 1994 under Umesh Vazirani. Earlier, in 1986, Sanjeev Arora had topped the prestigious IIT JEE but transferred to MIT after 2 years at IIT Kanpur. He was a visiting scholar at the Institute for Advanced Study in 2002-03.His Ph.D. thesis on probabilistically checkable proofs received the ACM Doctoral Dissertation Award in 1995. He was awarded the Gödel Prize for his work on the PCP theorem in 2001 and again in 2010 for the discovery (concurrently with Joseph S. B. Mitchell) of a polynomial time approximation scheme for the euclidean travelling salesman problem. In 2008 he was inducted as a Fellow of the Association for Computing Machinery.In 2011 he was awarded the ACM Infosys Foundation Award, given to mid-career researchers in Computer Science. Arora has been awarded the Fulkerson Prize for 2012 for his work on improving the approximation ratio for graph separators and related problems (jointly with Satish Rao and Umesh Vazirani).He is a coauthor (with Boaz Barak) of the book Computational Complexity: A Modern Approach and is a founder, and on the Executive Board, of Princeton's Center for Computational Intractability. He and his coauthors have argued that certain financial products are associated with computational asymmetry which under certain conditions may lead to market instability.".
- Q92664 almaMater Q168756.
- Q92664 almaMater Q49108.
- Q92664 award Q1004305.
- Q92664 award Q1417143.
- Q92664 birthDate "1968".
- Q92664 birthPlace Q1437.
- Q92664 birthPlace Q200019.
- Q92664 birthPlace Q668.
- Q92664 birthYear "1968".
- Q92664 citizenship Q30.
- Q92664 doctoralAdvisor Q92805.
- Q92664 field Q2878974.
- Q92664 knownFor Q1140200.
- Q92664 knownFor Q841495.
- Q92664 notableStudent Q7631228.
- Q92664 residence Q30.
- Q92664 thumbnail Sanjeev_Arora.jpg?width=300.
- Q92664 wikiPageExternalLink id.php?id=69543.
- Q92664 wikiPageExternalLink acm-infosys-award-2011.
- Q92664 wikiPageExternalLink ~arora.
- Q92664 wikiPageWikiLink Q1004305.
- Q92664 wikiPageWikiLink Q1137554.
- Q92664 wikiPageWikiLink Q1140200.
- Q92664 wikiPageWikiLink Q127992.
- Q92664 wikiPageWikiLink Q1417143.
- Q92664 wikiPageWikiLink Q1437.
- Q92664 wikiPageWikiLink Q14492150.
- Q92664 wikiPageWikiLink Q168756.
- Q92664 wikiPageWikiLink Q200019.
- Q92664 wikiPageWikiLink Q205084.
- Q92664 wikiPageWikiLink Q21578.
- Q92664 wikiPageWikiLink Q2643509.
- Q92664 wikiPageWikiLink Q2878974.
- Q92664 wikiPageWikiLink Q30.
- Q92664 wikiPageWikiLink Q322212.
- Q92664 wikiPageWikiLink Q3521140.
- Q92664 wikiPageWikiLink Q49108.
- Q92664 wikiPageWikiLink Q5312304.
- Q92664 wikiPageWikiLink Q583461.
- Q92664 wikiPageWikiLink Q621751.
- Q92664 wikiPageWikiLink Q635642.
- Q92664 wikiPageWikiLink Q6368932.
- Q92664 wikiPageWikiLink Q6465255.
- Q92664 wikiPageWikiLink Q6647690.
- Q92664 wikiPageWikiLink Q668.
- Q92664 wikiPageWikiLink Q6946332.
- Q92664 wikiPageWikiLink Q7012291.
- Q92664 wikiPageWikiLink Q7017947.
- Q92664 wikiPageWikiLink Q7631228.
- Q92664 wikiPageWikiLink Q782682.
- Q92664 wikiPageWikiLink Q841495.
- Q92664 wikiPageWikiLink Q8503235.
- Q92664 wikiPageWikiLink Q92805.
- Q92664 wikiPageWikiLink Q9580543.
- Q92664 almaMater Q168756.
- Q92664 almaMater Q49108.
- Q92664 awards Q1417143.
- Q92664 awards "Fulkerson Prize".
- Q92664 birthPlace Q1437.
- Q92664 birthPlace Q200019.
- Q92664 birthPlace Q668.
- Q92664 citizenship Q30.
- Q92664 dateOfBirth "1968".
- Q92664 doctoralAdvisor Q92805.
- Q92664 fields Q2878974.
- Q92664 knownFor Q1140200.
- Q92664 knownFor "Probabilistically checkable proofs".
- Q92664 name "Arora, Sanjeev".
- Q92664 name "Sanjeev Arora".
- Q92664 notableStudents Q7631228.
- Q92664 placeOfBirth "India".
- Q92664 residence "United States".
- Q92664 shortDescription "Theoretical computer scientist".
- Q92664 type Person.
- Q92664 type Agent.
- Q92664 type Person.
- Q92664 type Scientist.
- Q92664 type Agent.
- Q92664 type NaturalPerson.
- Q92664 type Thing.
- Q92664 type Q215627.
- Q92664 type Q5.
- Q92664 type Q901.
- Q92664 type Person.
- Q92664 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.".
- Q92664 label "Sanjeev Arora".
- Q92664 depiction Sanjeev_Arora.jpg.
- Q92664 givenName "Sanjeev".