Ankit Garg received his bachelor’s degree from Indian Institute of Technology, Delhi, and is currently a Ph.D. student in the Theoretical Computer Science group at Princeton University. His research focuses on the applications of information theory in complexity theory, which is a growing area with connections to communication complexity, hardness amplification and the linear programming lower bounds. One of his papers obtained exact upper and lower bounds on the randomized communication complexity of a well-studied problem, set disjointness. Another paper developed a technique for obtaining information complexity lower bounds from communication complexity lower bounds in a black box manner. This paper won the best paper award at International Computer Science Symposium in Russia, 2013.