default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIan Mertz
Person information
- affiliation: University of Warwick, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c8]James Cook
, Ian Mertz:
Tree Evaluation Is in Space O(log n · log log n). STOC 2024: 1268-1278- [i13]Marten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker:
Fully Characterizing Lossy Catalytic Computation. CoRR abs/2409.05046 (2024) - [i12]James Cook, Jiatu Li, Ian Mertz, Edward Pyne:
The Structure of Catalytic Space: Capturing Randomness and Time via Compression. Electron. Colloquium Comput. Complex. TR24 (2024) - [i11]Marten Folkertsma, Ian Mertz, Florian Speelman, Quinten Tupker:
Fully Characterizing Lossy Catalytic Computation. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [j3]Ian Mertz:
Reusing Space: Techniques and Open Problems. Bull. EATCS 141 (2023) - [i10]James Cook, Ian Mertz:
Tree Evaluation is in Space O(log n · log log n). Electron. Colloquium Comput. Complex. TR23 (2023) - [i9]Ian Mertz:
Reusing Space: Techniques and Open Problems. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c7]James Cook, Ian Mertz:
Trading Time and Space in Catalytic Branching Programs. CCC 2022: 8:1-8:21 - [c6]Shachar Lovett, Raghu Meka, Ian Mertz, Toniann Pitassi, Jiapeng Zhang:
Lifting with Sunflowers. ITCS 2022: 104:1-104:24 - [i8]James Cook, Ian Mertz:
Trading Time and Space in Catalytic Branching Programs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i7]James Cook, Ian Mertz:
Encodings and the Tree Evaluation Problem. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c5]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating cutting planes is NP-hard. STOC 2020: 68-77 - [c4]James Cook, Ian Mertz:
Catalytic approaches to the tree evaluation problem. STOC 2020: 752-760 - [i6]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating Cutting Planes is NP-Hard}. CoRR abs/2004.08037 (2020) - [i5]James Cook, Ian Mertz:
Catalytic Approaches to the Tree Evaluation Problem. Electron. Colloquium Comput. Complex. TR20 (2020) - [i4]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating Cutting Planes is NP-Hard. Electron. Colloquium Comput. Complex. TR20 (2020) - [i3]Ian Mertz, Toniann Pitassi:
Lifting: As Easy As 1, 2, 3. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j2]Eric Allender, Ian Mertz:
Complexity of regular functions. J. Comput. Syst. Sci. 104: 5-16 (2019) - [c3]Ian Mertz, Toniann Pitassi, Yuanhao Wei:
Short Proofs Are Hard to Find. ICALP 2019: 84:1-84:16 - 2017
- [j1]Eric Allender, Anna Gál, Ian Mertz:
Dual VP Classes. Comput. Complex. 26(3): 583-625 (2017) - 2015
- [c2]Eric Allender, Ian Mertz:
Complexity of Regular Functions. LATA 2015: 449-460 - [c1]Eric Allender, Anna Gál, Ian Mertz:
Dual VP Classes. MFCS (2) 2015: 14-25 - [i2]Eric Allender, Ian Mertz:
Complexity of Regular Functions. Electron. Colloquium Comput. Complex. TR15 (2015) - 2014
- [i1]Eric Allender, Anna Gál, Ian Mertz:
Dual VP Classes. Electron. Colloquium Comput. Complex. TR14 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:10 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
