2010 Waterman Award

美国国家科学基金会（NSF）自豪地宣布，纽约大学数学科学研究所副教授Subhash Khot被选为2010年Alan T. Waterman奖得主。Khot是一位理论计算机科学家，他的研究领域是“计算复杂性”，旨在理解高效计算的能力和局限性。一年一度的沃特曼奖旨在表彰由美国国家科学基金会支持的任何科学或工程领域的杰出青年研究员。候选人的年龄不得超过35岁，或在获得博士学位后7年，并且必须在个人成就方面脱颖而出。除奖章外，获奖者还将获得50万美元的资助，为期3年，用于在其领域的科学研究或高级学习。Khot是一位杰出的理论计算机科学家，最著名的是他的独特游戏猜想。他在计算复杂性方面做出了许多意想不到的原创贡献，他的工作将优化、计算机科学和数学联系在一起。Khot与NSF有着长期的合作关系，获得奖项的历史甚至更悠久。他曾获得美国国家科学基金会职业奖、斯隆基金会奖学金和微软新教师奖学金。他与他在纽约大学、普林斯顿大学、罗格斯大学和高等研究院的同事们一起，获得了美国国家科学基金会一千万美元的“计算探险”资助，研究人员正在寻求弥合我们对计算难解性理解上的根本差距。

The National Science Foundation (NSF) is proud to announce the selection of New York University's Subhash Khot, an associate professor at the Courant Institute of Mathematical Sciences, to receive its 2010 Alan T. Waterman Award. Khot, a theoretical computer scientist, works in an area called "Computational Complexity" which seeks to understand the power and limits of efficient computation.The annual Waterman award recognizes an outstanding young researcher in any field of science or engineering supported by NSF. Candidates may not be more than 35 years old, or seven years beyond receiving a doctorate, and must stand out for their individual achievements. In addition to a medal, the awardee receives a grant of $500,000 over a 3-year period for scientific research or advanced study in their field. Khot is a brilliant theoretical computer scientist, and is most well known for his Unique Games Conjecture. He has made many unexpected and original contributions to computational complexity and his work draws connections among optimization, computer science and mathematics.Khot has a long relationship with NSF, and an even longer history receiving awards. He received an NSF CAREER Award, a Sloan Foundation Fellowship, and a Microsoft New Faculty Fellowship. With his colleagues at New York University, Princeton, Rutgers University, and the Institute for Advanced Study, he is part of a $10 million NSF "Expeditions in Computing" grant under which the researchers are seeking to bridge fundamental gaps in our understanding of computational intractability.