2019 Waterman Award

美国国家科学基金会(NSF)提名马克·布雷弗曼博士为2019年艾伦·T·沃特曼奖的获奖者。该奖项是NSF的最高荣誉，每年表彰年龄在40岁或以下的杰出研究人员，并为他或她在任何科学或工程领域的研究提供资金。今年的得奖者将获得一百万元资助，在五年内继续深造。Braverman博士是普林斯顿大学的计算机科学教授，因其在计算机科学和数学领域的跨学科研究而享誉国际。他的工作在广泛的领域产生了新的见解，包括：信息复杂性、伪随机性、算法博弈论和经济学、连续计算和动力系统、机器学习以及计算机科学在医疗保健和医学中的应用。他的工作重振了当前理论计算机科学中最热门的两个研究领域：信息复杂性和机制设计。Braverman博士利用信息复杂性研究了著名的通信复杂性直和问题，并通过证明随机通信复杂性的直和定理解决了一个长期悬而未决的问题。布雷弗曼博士还为几十年来悬而未决的问题提供了突破性的解决方案，包括证明了关于伪随机性的Linial-Nisan猜想，并反驳了克里文关于Grothendieck不等式界的值的猜想。Braverman博士获得了多个奖项，包括因论文《向无遗憾的买家销售》而获得的经济学和计算最佳论文奖(2018)、欧洲数学学会奖(2016)、欧洲理论计算机科学协会的Presburger奖(2016)、SIAM因《如何压缩交互通信》而获得的杰出论文奖(2016)、计算数学基础学会的Stephen Smel奖(2014)、Packard科学与工程奖(2014)、John Templeton基金会的图灵研究员奖(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.