O’Donnell wins Okawa Award

Peter Key has a post on Ryan O Donnell winning the Okawa Award. Ryan O Donnel is doing exciting research in fourier analysis, boolean functions and computational learning.

Lee writes:

Ryan has made several seminal contributions, particularly in the area of hardness of approximation. He showed in a recent series of papers that the current best 0.878… approximation factor known for the classic Max-Cut problem is in fact the best factor achievable by any polynomial-time algorithm, under a well-known conjecture in complexity theory. Ryan’s publications are many and have been making a big impact, and this year he was invited to give a special tutorial at the STOC conference — quite an honor and the only theory tutorial on the program this year.

Comments

Popular posts from this blog

Smart Lotteries in School Choice Ex-ante Pareto-Improvement with Ex-post Stability

Fair budgets from ranked ballots: PB-EAR

Proportionally Representative Clustering