Makrand Sinha is a graduate student at the Paul G. Allen School of Computer Science and Engineering at University of Washington, where he is advised by Anup Rao. His research interests lie in complexity theory, in particular, in communication complexity, lower bounds for linear/semidefinite programs, and derandomization. He is also interested in the applications of information theoretic tools to other areas.
- Lower Bounds in Computational Complexity, Fall 2018. Visiting Graduate Student.