2019 Waterman Award

美国国家科学基金会（NSF）已任命马克·布雷弗曼博士为2019年艾伦·T。沃特曼奖该奖项是美国国家科学基金会的最高荣誉，每年表彰一位40岁或以下的杰出研究人员，并资助他或她在任何科学或工程领域的研究。今年的获奖者将在五年内获得100万美元的资助，用于在他的领域进行进一步的深造。Braverman博士是普林斯顿大学的计算机科学教授，他在计算机科学和数学的边界上的跨学科研究方面做出了许多贡献，受到国际认可。他的工作在广泛的领域产生了新的见解，包括：信息复杂性，伪随机性，算法博弈论和经济学，连续计算和动态系统，机器学习以及计算机科学在医疗保健和医学中的应用。 他的工作重振了理论计算机科学中两个最热门的研究领域：信息复杂性和机制设计。Braverman博士使用信息复杂性研究了著名的通信复杂性直和问题，并通过证明随机通信复杂性的直和定理解决了一个长期存在的开放问题。布雷弗曼博士还对几十年来长期存在的问题提出了突破性的解决方案，包括证明了关于伪随机性的Linial-Nisan猜想，并反驳了Krivine关于Grothendieck不等式中界值的猜想。Braverman博士是多个奖项的获得者，包括经济学和计算最佳论文奖（2018年）的论文“销售给一个不后悔的买家”，欧洲数学学会奖（2016年），欧洲理论计算机科学协会的Presburger奖（2016年），SIAM杰出论文奖“如何压缩交互式通信”（2016年），计算数学基金会的斯蒂芬·斯梅尔奖（2014年），科学与工程帕卡德奖学金（2014年），约翰·邓普顿基金会的图灵奖学金（2012年），NSF职业奖（2012年）和斯隆研究奖学金（2011年）该奖项反映了NSF的法定使命，并通过使用基金会的知识价值和更广泛的影响审查标准进行评估，被认为值得支持。

The National Science Foundation (NSF) has named Dr Mark Braverman as a 2019 recipient of its Alan T. Waterman Award. This award is NSF's highest honor that annually recognizes an outstanding researcher age 40 years or younger and funds his or her research in any field of science or engineering. This year's awardee will receive a $1 million grant over a five-year period for further advanced study in his field.Dr Braverman is a computer science professor at Princeton University, and is internationally recognized for numerous contributions for his interdisciplinary research at the boundary of computer science and mathematics. His work has yielded new insights into a wide range of areas including: information complexity, pseudorandomness, algorithmic game theory and economics, continuous computation and dynamical systems, machine learning, and applications of computer science in healthcare and medicine. His work has reinvigorated two of the hottest current research areas in theoretical computer science: information complexity and mechanism design. Dr. Braverman has used information complexity to study the famous direct sum problem for communication complexity, and has settled a longstanding open question by proving a direct sum theorem for randomized communication complexity. Dr. Braverman has also made breakthrough solutions to longstanding problems open for decades, including proving the Linial-Nisan conjecture on pseudorandomness and disproving Krivine's conjecture about the value of the bound in the Grothendieck inequality. Dr. Braverman is the recipient of several awards, including Best Full Paper Award in Economics and Computation (2018) for the paper "Selling to a no-regret buyer," the European Mathematical Society Prize (2016), the Presburger Award from the European Association for Theoretical Computer Science (2016), a SIAM Outstanding Paper Prize for "How to compress interactive communication" (2016), the Stephen Smale Prize from the Society for the Foundations of Computational Mathematics (2014), a Packard Fellowship in Science and Engineering (2014), a Turing Fellowship Award of the John Templeton Foundation (2012), an NSF CAREER Award (2012) and a Sloan Research Fellowship (2011).This award reflects NSF's statutory mission and has been deemed worthy of support through evaluation using the Foundation's intellectual merit and broader impacts review criteria.