ACM-Infosys Foundation Award Goes to Architect of New Approaches for Computational Problems
Princeton Computer Scientist Sanjeev Arora Honored for Breakthroughs that Have Advanced the Power of Computing
For contributions to computational complexity, algorithms, and optimization that have helped reshape our understanding of computation.
Sanjeev Arora is one of the architects of the Probabilistically Checkable Proofs (PCP) theorem, which revolutionized our understanding of complexity and the approximability of NP-hard problems. He helped create new approximation algorithms for fundamental optimization problems such as the Sparsest Cuts problem and the Euclidean Travelling Salesman problem, and contributed to the development of semi-definite programming as a practical algorithmic tool. He has played a pivotal role in some of the deepest and most influential results in theoretical computer science, and continues to inspire colleagues and new generations of researchers.
The Charles Fitzmorris Professor of Computer Science at Princeton, Arora was a co˗winner of both the 2001 and 2010 Gödel Prize, an award sponsored jointly by the European Association for Theoretical Computer Science (EATCS) and ACM's Special Interest Group on Algorithms and Computation Theory (ACM SIGACT). He was named an ACM Fellow in 2008, and a co˗winner of the ACM Doctoral Dissertation Award in 1995. He coauthored Computational Complexity: A Modern Approach with Boaz Barak, which has become a popular text in higher education. A graduate of the Massachusetts Institute of Technology with an S.B. degree in Mathematics and Computer Science, Arora earned a Ph.D. degree in Computer Science from the University of California, Berkeley. He also attended the Indian Institute of Technology at Kanpur for two years before moving to the U.S.
Arora was the founding director of the Center for Computational Intractability, which addresses the phenomenon that many problems seem inherently impossible to solve on current computational models. The organization, a joint venture of Princeton University, the Institute for Advanced Study, Rutgers University, and New York University, is funded by a grant from the National Science Foundation. It is devoted to designing new approaches to fundamental problems in computing as well as other sciences.
About the ACM-Infosys Foundation Award
The ACM-Infosys Foundation Award, established in August 2007, recognizes personal contributions by young scientists and system developers to a contemporary innovation that exemplifies the greatest recent achievements in the computing field. Financial support for the award, which was increased this year to $175,000, is provided by an endowment from the Infosys Foundation.
ACM will present the ACM-Infosys Foundation Award at the annual ACM Awards Banquet on June 16 in San Francisco, CA.
ACM, the Association for Computing Machinery, is the world's largest educational and scientific computing society, uniting educators, researchers and professionals to inspire dialogue, share resources and address the field's challenges. ACM strengthens the computing profession's collective voice through strong leadership, promotion of the highest standards, and recognition of technical excellence. ACM supports the professional growth of its members by providing opportunities for life-long learning, career development, and professional networking.