We're happy to announce that Ian Mertz has joined the department as a Research Fellow. He is currently funded by the project "New approaches to unconditional computational lower bounds", with support from the Royal Society.

Ian Mertz completed his PhD at the University of Toronto in 2022 under the supervision of Toniann Pitassi, with stints at the Simons Institute for the Theory of Computing (UC Berkeley) and at the Institute for Advanced Study in Princeton.

Ian's primary research area is computational complexity theory. His interests at the moment include catalytic computing, lifting theorems, arithmetic circuit complexity, and proof complexity.