Yuan Zhou received his bachelor’s degree in Computer Science from Tsinghua University in 2009, where he attended the Special Pilot CS Class supervised by Turing Award laureate Professor Andrew Yao. Zhou is currently a graduate student at Carnegie Mellon University, working on theoretical computer science with Professors Venkatesan Guruswami and Ryan O’Donnell. His research interests focus on approximability of fundamental optimization problems. In his past research projects, he designed approximation algorithms and proved inapproximability results for solving sparse linear equations, graph cut and graph bisection problems, unique games, several constraint satisfaction and ordering problems, and the densest subgraph problem. Zhou also publishes work on other topics of theoretical computer science, including analysis of Boolean functions, algebraic dichotomy theory, algorithmic game theory and quantum information theory.