At the moment my research interests mostly include circuit complexity, communication complexity, and proof complexity, as well as resolving some old research on arithmetic circuit complexity, Kolmogorov complexity, and the Minimum Circuit Size Problem. In the future I also hope to work on quantum complexity.
Proof Complexity and Automatizability (coming soon)
Master's thesis (see also: Short Proofs are Hard to Find)
Short Proofs Are Hard to Find (coming soon)
Eric Allender, Anna Gál, Ian Mertz
computational complexity, 25 pp. 1-43, 2016. An earlier version appeared in Proc. 40th International Symposium on Mathematical Foundations of Computer Science (MFCS '15), Lecture Notes in Computer Science, 9235 pp. 14-25, 2015.
Eric Allender, Ian Mertz
In Proc. 9th International Conference on Language and Automata Theory and Applications (LATA '15), Lecture Notes in Computer Science, 8977 pp. 449-460, 2015.
|winter 2018||CSC 463||computational complexity and computability|
|winter 2018||CSC 165||mathematical expression and reasoning for c.s.|
|summer 2017||CSC 373||algorithm design, analysis, and complexity|
|winter 2017||CSC 463||computational complexity and computability|
|fall 2016||CSC 165||mathematical expression and reasoning for c.s.|
|fall 2015||CS 509||foundations of computer science|
|phd||2018 -||University of Toronto||Toniann Pitassi,
|masters||2016 - 2018||University of Toronto||Toniann Pitassi,
|undergraduate||2012 - 2016||Rutgers University||Eric Allender|
|study abroad||summer 2015||Kyoto University||Kazuo Iwama|
|pact program||2011 - 2012||Princeton University||Rajiv Gandhi|