Sanjeev Arora Named Winner of 2011 ACM-Infosys Award
CCC Blog (03/30/12) Erwin Gianchandani
Princeton University professor Sanjeev Arora has received the 2011 ACM-Infosys Foundation Award in Computing Sciences for his contributions to computational complexity, algorithms, and optimization. "Arora’s research revolutionized the approach to essentially unsolvable problems that have long bedeviled the computing field, the so-called NP-complete problems," according to an ACM-Infosys press release. Arora is an ACM Fellow and won the Gödel Prize in 2001 and 2010, as well as the ACM Doctoral Dissertation Award in 1995. Arora also is the founding director of Princeton's Center for Computational Intractability, which addresses the phenomenon that many problems seem inherently impossible to solve on currently computational models. "With his new tools and techniques, Arora has developed a fundamentally new way of thinking about how to solve problems,” says ACM President Alain Chesnais. “In particular, his work on the PCP theorem is considered the most important development in computational complexity theory in the last 30 years. He also perceived the practical applications of his work, which has moved computational theory into the realm of real world uses.” The ACM-Infosys Foundation Award recognizes personal contributions by young scientists and system developers to a contemporary innovation and includes a $175,000 prize.
CCC Blog (03/30/12) Erwin Gianchandani
Princeton University professor Sanjeev Arora has received the 2011 ACM-Infosys Foundation Award in Computing Sciences for his contributions to computational complexity, algorithms, and optimization. "Arora’s research revolutionized the approach to essentially unsolvable problems that have long bedeviled the computing field, the so-called NP-complete problems," according to an ACM-Infosys press release. Arora is an ACM Fellow and won the Gödel Prize in 2001 and 2010, as well as the ACM Doctoral Dissertation Award in 1995. Arora also is the founding director of Princeton's Center for Computational Intractability, which addresses the phenomenon that many problems seem inherently impossible to solve on currently computational models. "With his new tools and techniques, Arora has developed a fundamentally new way of thinking about how to solve problems,” says ACM President Alain Chesnais. “In particular, his work on the PCP theorem is considered the most important development in computational complexity theory in the last 30 years. He also perceived the practical applications of his work, which has moved computational theory into the realm of real world uses.” The ACM-Infosys Foundation Award recognizes personal contributions by young scientists and system developers to a contemporary innovation and includes a $175,000 prize.
No comments:
Post a Comment