John Wright did his undergraduate education at the University of Texas at Austin and is now is a Ph.D. student at Carnegie Mellon University. His main research areas are hardness of approximation, analysis of Boolean functions, and quantum computing. He has published in STOC, SODA, CCC, APPROX, ITCS and ICALP. In one of his results with Ryan O’Donnell, he proved the best-known NP-hardness of approximation for the well-studied unique games conjecture. In another result, he and his coauthors showed NP-hardness for a natural approximation variation of the graph isomorphism problem.