Ian Mertz is a second year MSc/PhD student in the Theory Group at the University of Toronto, supervised by Toniann Pitassi. Previously, he was an undergraduate at Rutgers University working with Eric Allender. His research interests include circuit complexity, communication complexity, and proof complexity, as well as old research on arithmetic circuit complexity, Kolmogorov complexity, and the Minimum Circuit Size Problem.
- Lower Bounds in Computational Complexity, Fall 2018. Visiting Graduate Student.