He completed his Ph.D. in 2008 at the University of Chicago under the supervision of László Babai. His research interests lie in the classical and quantum complexity of Boolean functions (including property testing and different combinatorial measures of the complexity of Boolean functions), electronic commerce, graph algorithms, and coding theory.