Yaqiao completed his master's degree in pure mathematics and is currenty a fourth year PhD student studying theoretical computer science, with a focus on communication and information complexity. He has studied the information complexity of boolean functions with a small error allowance. Currently, Yaqiao is working on lifting theorems that relate communication complexity to decision tree complexity for composite functions.
- Lower Bounds in Computational Complexity, Fall 2018. Visiting Graduate Student.