postdoctoral researcher
Centre for Discrete Mathematics and its Applications (DIMAP) Department of Computer Science University of Warwick
Room MS 1.15 6 Lord Bhattacharyya Way Coventry, United Kingdom, CV4 7EZ
first_name [dot] last_name [at] warwick.ac.uk
I'm a postdoctoral researcher in the Theory and Foundations Group at the University of Warwick, where I'm fortunate to be working with Igor Carboni Oliveira. Before this I was a graduate student at University of Toronto advised by Toniann Pitassi, and before that I was an undergraduate at Rutgers University.
At the moment my research interests mostly include catalytic computing, lifting theorems, arithmetic circuit complexity, and proof complexity.
TCS PAPERS |
|
James Cook, Ian Mertz
In Proc. 37th Computational Complexity Conference (CCC 2022), pp. 8:1-8:21, 2022. [video (CCC)] [slides] |
|
James Cook, Ian Mertz
Upcoming journal version to be merged with Catalytic Approaches to the Tree Evaluation Problem, 2021. |
|
Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, Jiapeng Zhang
In Proc. 19th Innovations in Theoretical Computer Science (ITCS '22), pp. 104:1-104:24, 2022. [video (ITCS)] [video (MIAO)] [slides] |
|
James Cook, Ian Mertz
Proc. 52nd ACM Symposium on Theory of Computing (STOC '20), pp. 752-760, 2020. |
|
Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi
Proc. 52nd ACM Symposium on Theory of Computing (STOC '20), pp. 68-77, 2020. [video (STOC)] [slides] |
|
Ian Mertz, Toniann Pitassi, Yuanhao Wei
Proc. 46th International Colloquium on Automata, Languages and Programming (ICALP '19), Leibniz International Proceedings in Informatics (LIPIcs), 84 (132) pp. 1-16, 2019. [video (IAS)] [slides] |
|
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. [slides] |
|
Eric Allender, Ian Mertz
Journal of Computer and System Sciences, 104 pp. 5-16, 2019. An earlier version appeared in Proc. 9th International Conference on Language and Automata Theory and Applications (LATA '15), Lecture Notes in Computer Science, 8977 pp. 449-460, 2015. [slides] |
TECHNICAL NOTES / MISCELLANEOUS |
|
Ian Mertz
Ph.D thesis. [slides] |
|
Ian Mertz
Thesis proposal. See also: Catalytic Approaches to the Tree Evaluation Problem. [slides] |
|
Ian Mertz
Qualifying exam. See also: Catalytic Approaches to the Tree Evaluation Problem. [slides] |
|
Proof Complexity and Automatizability
Ian Mertz
Master's thesis. See also: Short Proofs are Hard to Find. [slides] |
|
Transforming Potential into Promise: A Depth-First Approach
|
| 2022 - 2024 | postdoc | University of Warwick | Igor Carboni Oliveira |
| 2018 - 2022 | phd | University of Toronto | Toniann Pitassi |
| 2016 - 2018 | masters | University of Toronto | Toniann Pitassi, Stephen Cook |
| 2012 - 2016 | undergraduate | Rutgers University | Eric Allender |
| spring 2023 | Simons Institute | |
| summer 2022 | Charles University | Michal Koucký |
| spring 2022 | Institute for Advanced Study | Toniann Pitassi |
| spring 2020 | Institute for Advanced Study | Toniann Pitassi |
| fall 2019 | Heidelberg Laureate Forum | |
| fall 2018 | Simons Institute | |
| fall 2017 | Institute for Advanced Study | Toniann Pitassi |
| fall 2016 | Heidelberg Laureate Forum | |
| summer 2015 | Kyoto University | Kazuo Iwama |
| summer 2012 | PACT program (instructor) | Rajiv Gandhi |
| summer 2011 | PACT program | Rajiv Gandhi |
| summer 2021 | CSC 165 | mathematical expression and reasoning for c.s. |
| fall 2020 | CSC 236 CSC 2426 |
introduction to the theory of computation fundamentals of cryptography |
| fall 2019 | CSC 165 | mathematical expression and reasoning for c.s. |
| winter 2019 | CSC 165 (x2) | mathematical expression and reasoning for c.s. |
| winter 2018 | CSC 165 CSC 463 |
mathematical expression and reasoning for c.s. computational complexity and computability |
| 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 |