| 2026 | STACS | Upper and Lower Bounds for the Linear Ordering Principle. | Edward A. Hirsch, Ilya Volkovich |
| 2025 | STACS | Tropical Proof Systems: Between R(CP) and Resolution. | Yaroslav Alekseev, Dima Grigoriev, Edward A. Hirsch |
| 2023 | CIAC | The Power of the Binary Value Principle. | Yaroslav Alekseev, Edward A. Hirsch |
| 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 |
| 2016 | FOCS | A Better-Than-3n Lower Bound for the Circuit Complexity of an Explicit Function. | Magnus Gausdal Find, Alexander Golovnev, Edward A. Hirsch, Alexander S. Kulikov |
| 2016 | MFCS | On the Limits of Gate Elimination. | Alexander Golovnev, Edward A. Hirsch, Alexander Knop, Alexander S. Kulikov |
| 2011 | SAT | Satisfiability Certificates Verifiable in Subexponential Time. | Evgeny Dantsin, Edward A. Hirsch |
| 2010 | STACS | On Optimal Heuristic Randomized Semidecision Procedures, with Application to Proof Complexity. | Edward A. Hirsch, Dmitry Itsykson |
| 2010 | TAMC | Optimal Acceptors and Optimal Proof Systems. | Edward A. Hirsch |
| 2009 | CSR | A Feebly Secure Trapdoor Function. | Edward A. Hirsch, Sergey I. Nikolenko |
| 2008 | WoLLIC | An Infinitely-Often One-Way Function Based on an Average-Case Assumption. | Edward A. Hirsch, Dmitry Itsykson |
| 2006 | CIAC | Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms. | Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert |
| 2005 | SAT | Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution. | Edward A. Hirsch, Sergey I. Nikolenko |
| 2004 | ICALP | Exponential Lower Bounds for the Running Time of DPLL Algorithms on Satisfiable Formulas. | Michael Alekhnovich, Edward A. Hirsch, Dmitry Itsykson |
| 2004 | STACS | Algorithms for SAT Based on Search in Hamming Balls. | Evgeny Dantsin, Edward A. Hirsch, Alexander Wolpert |
| 2002 | ICALP | Exponential Lower Bound for Static Semi-algebraic Proofs. | Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik |
| 2002 | STACS | Complexity of Semi-algebraic Proofs. | Dima Grigoriev, Edward A. Hirsch, Dmitrii V. Pasechnik |
| 2001 | CP | Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. | Edward A. Hirsch, Arist Kojevnikov |
| 2000 | ICALP | Deterministic Algorithms for | Evgeny Dantsin, Andreas Goerdt, Edward A. Hirsch, Uwe Schning |
| 2000 | ICALP | Worst-case Time Bounds for MAX-k-SAT with respect to the Number of Variables Using Local Search. | Edward A. Hirsch |
| 2000 | STACS | A New Algorithm for MAX-2-SAT. | Edward A. Hirsch |
| 1998 | SODA | Two New Upper Bounds for SAT. | Edward A. Hirsch |