Ian Mertz

Department of Computer Science
University of Toronto
10 King's College Road
Sandford Fleming Building, Room SF4302C
Toronto, ON, M5S-3G4

last_name [at] cs.toronto.edu

about

I'm a sixth year M.Sc./Ph.D. student in the Theory Group at the University of Toronto, where I'm fortunate to be working under the supervision of Toniann Pitassi. Before this 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.

I'm currently in charge of the Theory Student Seminar, so feel free to send inquiries to tssadmin [at] cs.toronto.edu. I'm also the current Knight of the Pint (pubmaster) for the Computer Science Graduate Student Union, although nowadays I'm more of a general-purpose social coordinator (for obvious reasons).

You can find my current CV here.

publications

TCS PAPERS

Trading Time and Space in Catalytic Branching Programs
James Cook, Ian Mertz
In submission, 2022.
Encodings and the Tree Evaluation Problem
James Cook, Ian Mertz
Upcoming journal version to be merged with Catalytic Approaches to the Tree Evaluation Problem, 2021.
Lifting with Sunflowers
Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, Jiapeng Zhang
In Proc. 19th Innovations in Theoretical Computer Science (ITCS '22), 104:1-104:24, 2022. [video (ITCS)] [video (MIAO)] [slides]
Catalytic Approaches to the Tree Evaluation Problem
James Cook, Ian Mertz
Proc. 52nd ACM Symposium on Theory of Computing (STOC '20), pp. 752-760, 2020.
Automating Cutting Planes is NP-Hard
Short Proofs Are Hard to Find
Dual VP Classes
Complexity of Regular Functions

TECHNICAL NOTES / MISCELLANEOUS

Catalytic Computing, Tree Evaluation, & Clean Computation
Ian Mertz
Thesis proposal. See also: Catalytic Approaches to the Tree Evaluation Problem. [slides]
Catalytic Computing Between L and P
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
Rajiv Gandhi, David Jacobowitz, Ian Mertz
In production.
teaching assistant
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
research
    日本語