Mathematical Sciences:Postdoctoral Research Fellowship

数学科学博士后研究奖学金是授予最近获得数学科学博士学位的人。这些奖项是为国家科学事业的未来活力作出贡献的一种手段。随着数学科学研究人员扩大与其他学科的互动，随着数学本身各个领域之间的相互作用增加，博士后研究和培训的机会变得越来越重要。该奖学金旨在允许获奖者选择对其未来科学发展有最大影响的研究环境。该奖学金旨在提供24个月的支持，分为18个学年月和3个夏季月。接受者可以选择(1)研究奖学金选项，该选项允许在三年的时间内提供18个月的全日制支持，时间间隔不少于连续3个月；或(2)研究指导选项，该选项允许将18个月的学年支持视为9个月的全日制支持和18个月的半日支持。本奖学金在任何日历年度的夏季资助不得超过两个月。大卫·威廉姆森将在麻省理工学院获得博士学位，并将在康奈尔大学伊娃·塔多斯的指导下进行研究。该研究将在理论计算机科学领域进行，特别是np困难问题的组合优化和近似问题。

The Mathematical Sciences Postdoctoral Research Fellowships are awards to recent recipients of doctoral degrees in the mathematical sciences. These awards are a means of contributing to the future vitality of the scientific effort of the nation. As researchers in the mathematical sciences expand their interactions with other disciplines, and as the interplay increases between the various areas of mathematics itself, opportunities for postdoctoral research and training are becoming increasingly important. The fellowships are designed to permit awardees to choose research environments that will have maximal impact on their future scientific development. The fellowship is designed to provide 24 months of support divided into 18 academic-year months and 3 periods of two summer months. The recipient may choose (1) the Research Fellowship option which allows for full-time support for any 18 academic-year months in a three-year period, in intervals not shorter than 3 consecutive months or (2) the Research Instructorship option which allows the 18 months of academic year support to be taken as 9 months of full-time support and 18 months of half-time support. Not more than two months of summer support from this Fellowship may be received in any calendar year. David Williamson will receive his doctoral degree from the Massachusetts Institute of Technology, and will pursue research under the guidance of Eva Tardos at Cornell University. The research will be conducted in the area of theoretical computer science, specifically problems in combinatorial optimization and approximation for NP-hard problems.