| On Vanishing Sums of Roots of Unity in Polynomial Calculus and Sum-Of-Squares | 0 | 0.34 | 2022 |
| Cops-Robber Games and the Resolution of Tseitin Formulas | 0 | 0.34 | 2020 |
| Bounded-depth Frege complexity of Tseitin formulas for all graphs. | 0 | 0.34 | 2019 |
| Polynomial Calculus Space and Resolution Width | 0 | 0.34 | 2019 |
| Cops-Robber Games and the Resolution of Tseitin Formulas. | 0 | 0.34 | 2018 |
| Vertex-Connectivity Measures for Node Failure Identification in Boolean Network Tomography. | 0 | 0.34 | 2018 |
| Tight Bounds for Maximal Identifiability of Failure Nodes in Boolean Network Tomography | 0 | 0.34 | 2018 |
| Resolution and the binary encoding of combinatorial principles. | 0 | 0.34 | 2018 |
| On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies. | 0 | 0.34 | 2016 |
| A Framework for Space Complexity in Algebraic Proof Systems | 6 | 0.42 | 2015 |
| Space proof complexity for random $3$-CNFs via a $(2-ε)$-Hall's Theorem. | 0 | 0.34 | 2014 |
| The space complexity of cutting planes refutations. | 2 | 0.37 | 2014 |
| A characterization of tree-like Resolution size | 5 | 0.43 | 2013 |
| Parameterized Complexity of DPLL Search Procedures. | 1 | 0.35 | 2013 |
| Proofs of Space: When Space Is of the Essence. | 26 | 1.60 | 2013 |
| Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems | 6 | 0.47 | 2012 |
| Parameterized Bounded-Depth Frege is Not Optimal | 5 | 0.48 | 2012 |
| SAT Interactions (Dagstuhl Seminar 12471). | 0 | 0.34 | 2012 |
| Parameterized Complexity of DPLL Search Procedures | 16 | 0.63 | 2011 |
| A lower bound for the pigeonhole principle in tree-like Resolution by asymmetric Prover-Delayer games | 7 | 0.47 | 2010 |
| Optimality of size-degree tradeoffs for polynomial calculus | 12 | 0.49 | 2010 |
| Hardness of Parameterized Resolution. | 4 | 0.44 | 2010 |
| Paris-Harrington Tautologies | 2 | 0.37 | 2010 |
| On the Automatizability of Polynomial Calculus | 5 | 0.40 | 2009 |
| Extending Polynomial Calculus to $k$-DNF Resolution | 2 | 0.37 | 2007 |
| Rank Bounds and Integrality Gaps for Cutting Planes Procedures | 47 | 2.44 | 2006 |
| The Complexity of Treelike Systems over lamda-Local Formulae | 1 | 0.36 | 2004 |
| On the Complexity of Resolution with Bounded Conjunctions | 22 | 0.92 | 2004 |
| Polynomial Time SAT Decision, Hypergraph Transversals and the Hermitian Rank | 6 | 0.43 | 2004 |
| Degree complexity for a modified pigeonhole principle | 1 | 0.36 | 2003 |
| Space Complexity of Random Formulae in Resolution | 38 | 1.04 | 2003 |
| Monotone simulations of non-monotone proofs | 12 | 0.78 | 2002 |
| Optimality of size-width tradeoffs for resolution | 39 | 1.12 | 2001 |
| On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems | 43 | 2.07 | 2000 |
| Monotone simulations of nonmonotone propositional proofs | 0 | 0.34 | 2000 |
| Monotone Proofs of the Pigeon Hole Principle | 4 | 0.48 | 2000 |
| A study of proof search algorithms for resolution and polynomial calculus | 34 | 3.78 | 1999 |
| Exponential Separations between Restricted Resolution and Cutting Planes Proof Systems | 17 | 1.83 | 1998 |
| Linear Lower Bounds and Simulations in Frege Systems with Substitutions | 1 | 0.36 | 1997 |
| Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy | 2 | 0.41 | 1997 |
| A Syntactic Characterization of Bounded-Rank Decision Trees in Terms of Decision Lists | 1 | 0.34 | 1997 |
