| 2026 | LICS | Meta-Mathematics of Algebraic Complexity. | Michal Garlk, Svyatoslav Gryaznov, Jiaqi Lu, Rahul Santhanam, Iddo Tzameret |
| 2026 | STOC | Lower Bounds against the Ideal Proof System in Finite Fields. | Tal Elbaz, Nashlen Govindasamy, Jiaqi Lu, Iddo Tzameret |
| 2026 | STOC | The Weak Rank Principle: Lower Bounds and Applications. | Michal Garlk, Svyatoslav Gryaznov, Hanlin Ren, Iddo Tzameret |
| 2025 | STOC | Feasibly Constructive Proof of Schwartz-Zippel Lemma and the Complexity of Finding Hitting Sets. | Albert Atserias, Iddo Tzameret |
| 2024 | STOC | Functional Lower Bounds in Algebraic Proofs: Symmetry, Lifting, and Barriers. | Tuomas Hakoniemi, Nutan Limaye, Iddo Tzameret |
| 2022 | FOCS | Simple Hard Instances for Low-Depth Algebraic Proofs. | Nashlen Govindasamy, Tuomas Hakoniemi, Iddo Tzameret |
| 2021 | LICS | First-Order Reasoning and Efficient Semi-Algebraic Proofs. | Fedor Part, Neil Thapen, Iddo Tzameret |
| 2021 | STOC | Iterated lower bound formulas: a diagonalization-based approach to proof complexity. | Rahul Santhanam, Iddo Tzameret |
| 2020 | CSL | From Classical Proof Theory to P versus NP: a Guide to Bounded Theories (Invited Talk). | Iddo Tzameret |
| 2020 | STOC | Semi-algebraic proofs, IPS lower bounds, and the τ-conjecture: can a natural number be negative? | Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch, Iddo Tzameret |
| 2017 | LICS | Uniform, integral and efficient proofs for the determinant identities. | Iddo Tzameret, Stephen A. Cook |
| 2014 | ICALP | Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem - (Extended Abstract). | Iddo Tzameret |
| 2012 | LICS | Short Propositional Refutations for Dense Random 3CNF Formulas. | Sebastian Mller, Iddo Tzameret |
| 2012 | STOC | Short proofs for the determinant identities. | Pavel Hrubes, Iddo Tzameret |
| 2010 | TAMC | Algebraic Proofs over Noncommutative Formulas. | Iddo Tzameret |
| 2007 | ICALP | Complexity of Propositional Proofs Under a Promise. | Nachum Dershowitz, Iddo Tzameret |