Sanjeev Arora (Q92664)

From Wikidata
Jump to navigation Jump to search
Theoretical computer scientist
edit
Language Label Description Also known as
English
Sanjeev Arora
Theoretical computer scientist

    Statements

    image
    Sanjeev Arora.jpg
    283 × 400; 21 KB
    0 references
    name in native language
    Sanjeev Arora (English)
    0 references
    date of birth
    January 1968
    1 reference
    stated in
    Integrated Authority File
    retrieved
    24 April 2014
    award received
    ACM Prize in Computing
    point in time
    2011
    award rationale
    For contributions to computational complexity, algorithms, and optimization that have helped reshape our understanding of computation (English)
    1 reference
    reference URL
    https://awards.acm.org/award_winners/arora_N027029#165
    ACM Fellow
    point in time
    2008
    award rationale
    For foundational work on probabilistically checkable proofs and approximate solutions to NP-hard optimization problems (English)
    1 reference
    reference URL
    https://awards.acm.org/award_winners/arora_N027029#158
    ACM Doctoral Dissertation Award
    point in time
    1995
    award rationale
    For his dissertation "Probabilistic Checking of Proofs and Hardness of Approximation Problems." (English)
    1 reference
    reference URL
    https://awards.acm.org/award_winners/arora_N027029#146
    Erdős number
    2
    0 references

    Identifiers

    Academic Tree ID
    188235
    0 references
    DBLP author ID
    a/SArora
    0 references
    UOM ID
    138609
    0 references
     
    edit
    edit
      edit
        edit
          edit
            edit
              edit
                edit
                  edit
                    Retrieved from "https://www.wikidata.org/w/index.php?title=Q92664&oldid=2139752300"