I am currently a Research Assistant Professor at TTI-Chicago. In June 2018 I will join Stanford University as an Assistant Professor of Computer Science.
My research is in theoretical computer science, with an emphasis on complexity theory and unconditional lower bounds. More specifically, I work in circuit complexity, pseudorandomness, analysis of boolean functions, learning theory, and property testing.
Before TTIC, I was a Microsoft Research Fellow at UC Berkeley's Simons Institute. I received my Ph.D. from Columbia University, where I was extremely fortunate to be advised by Rocco Servedio.
Email: liyang @ cs.stanford.edu