ACM and Infosys Foundation announced today that Sanjeev Arora, 44, of Princeton University, is the recipient of the 2011 ACM-Infosys Foundation Award in the Computing Sciences for innovative approaches to problem solving.
Arora’s research revolutionized the approach to essentially unsolvable problems that have long bedeviled the computing field, the so-called NP-complete problems. These results have had implications for problems common to cryptography, computational biology, and computer vision among other fields.
Click here for the ACM news release.
A profile of Arora will appear in the June 2012 issue of Communications of the ACM.
No entries found