| Automating cutting planes is NP-hard M Göös, S Koroth, I Mertz, T Pitassi Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 30 | 2020 |
| Lifting with sunflowers S Lovett, R Meka, I Mertz, T Pitassi, J Zhang Leibniz international proceedings in informatics 215, 2022 | 21 | 2022 |
| Complexity of regular functions E Allender, I Mertz Journal of computer and system sciences 104, 5-16, 2019 | 18 | 2019 |
| Short proofs are hard to find I Mertz, T Pitassi, Y Wei 46th International Colloquium on Automata, Languages, and Programming (ICALP …, 2019 | 15 | 2019 |
| Catalytic approaches to the tree evaluation problem J Cook, I Mertz Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020 | 8 | 2020 |
| Dual VP classes E Allender, A Gál, I Mertz computational complexity 26, 583-625, 2017 | 8 | 2017 |
| Trading time and space in catalytic branching programs J Cook, I Mertz 37th Computational Complexity Conference (CCC 2022), 2022 | 5 | 2022 |
| Encodings and the tree evaluation problem J Cook, I Mertz Electron. Colloquium Comput. Complex, 54, 2021 | 5 | 2021 |
| Reusing Space: Techniques and Open Problems I Mertz Bulletin of EATCS 141 (3), 2023 | 2 | 2023 |
| Tree Evaluation is in Space O (log n· log log n) J Cook, I Mertz | | 2023 |
| The Complexity of Composition: New Approaches to Depth and Space I Mertz University of Toronto (Canada), 2022 | | 2022 |
