课题基金 / 基金详情

2010 Waterman Award

2010 Waterman Award
2010年沃特曼奖
批准号:
1061938
负责人:
Subhash Khot
金额:
$50.0万
依托单位:
依托单位国家:
美国
项目类别:
Standard Grant
财政年份:
2010
资助国家:
美国
项目状态:
已结题
起止时间:
2010-10-01 至 2015-09-30
关键词:

项目摘要

项目成果

Subhash Khot的其他基金

相似基金

相关文献

中文摘要
翻译
美国国家科学基金会(NSF)很自豪地宣布,纽约大学的Subhash Khot,在柯朗数学科学研究所副教授的选择,以获得其2010年艾伦T。沃特曼奖 霍特是一位理论计算机科学家,他在一个名为“计算复杂性”的领域工作,该领域旨在了解高效计算的能力和局限性。一年一度的沃特曼奖旨在表彰NSF支持的任何科学或工程领域的杰出年轻研究人员。候选人不得超过35岁,或获得博士学位后7年,必须以个人成就脱颖而出。除了奖章外,获奖者还将在3年内获得50万美元的赠款,用于其领域的科学研究或高级研究。Khot是一位杰出的理论计算机科学家,以他的独特游戏猜想而闻名。他对计算复杂性做出了许多意想不到的原创性贡献,他的工作将优化、计算机科学和数学联系起来。Khot与NSF有着长期的合作关系,获奖的历史甚至更长。他获得了NSF职业奖,斯隆基金会奖学金和微软新教师奖学金。他和他在纽约大学、普林斯顿大学、罗格斯大学和高等研究院的同事们一起,参与了美国国家科学基金会1000万美元的“计算探险”项目,研究人员正在寻求弥合我们对计算困难性理解的根本差距。
英文摘要
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.
期刊论文(0)
专著(0)
科研奖励(0)
会议论文
AF: Small: Hardness of Approximation: Classical and New
  • 批准号:
    2130816
  • 项目类别:
    Standard Grant
  • 资助金额:
    $35.0万
  • 财政年份:
    2021
  • 负责人:
    Subhash Khot
  • 依托单位:
AF: Small: Analysis, Geometry, and Hardness of Approximation
  • 批准号:
    1813438
  • 项目类别:
    Standard Grant
  • 资助金额:
    $50.0万
  • 财政年份:
    2018
  • 负责人:
    Subhash Khot
  • 依托单位:
AF: Small: Challenges in Hardness of Approximation
  • 批准号:
    1422159
  • 项目类别:
    Standard Grant
  • 资助金额:
    $49.59万
  • 财政年份:
    2014
  • 负责人:
    Subhash Khot
  • 依托单位:
CAREER: New Directions in Inapproximability and Probabilistically Checkable Proofs
  • 批准号:
    0833228
  • 项目类别:
    Continuing Grant
  • 资助金额:
    $23.99万
  • 财政年份:
    2008
  • 负责人:
    Subhash Khot
  • 依托单位:
海外基金