| Publication | Date of Publication | Type |
|---|
| TFNP characterizations of proof systems and monotone circuits | 2024-09-25 | Paper |
| Regular resolution effectively simulates resolution | 2024-06-07 | Paper |
| On Herbrand's theorem | 2023-12-12 | Paper |
| On the Consistency of Circuit Lower Bounds for Non-Deterministic Time | 2023-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874198 | 2023-02-07 | Paper |
| Lower Bounds on OBDD Proofs with Several Orders | 2022-12-08 | Paper |
| Substitution and Propositional Proof Complexity | 2022-02-04 | Paper |
| On linear resolution | 2021-12-09 | Paper |
| Propositional proof systems based on maximum satisfiability | 2021-11-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4989407 | 2021-05-25 | Paper |
| Cobham recursive set functions and weak set theories | 2020-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5121904 | 2020-09-22 | Paper |
| Expander construction in \(\mathrm{VNC}^1\) | 2020-06-02 | Paper |
| DRMaxSAT with MaxHS: first contact | 2020-05-20 | Paper |
| DRAT proofs, propagation redundancy, and extended resolution | 2020-05-20 | Paper |
| Short refutations for an equivalence-chain principle for constant-depth formulas | 2020-05-11 | Paper |
| 2-D Tucker is PPA complete | 2019-11-29 | Paper |
| Feasible set functions have small circuits | 2019-10-28 | Paper |
| Proof complexity of systems of (non-deterministic) decision trees and branching programs | 2019-10-18 | Paper |
| Strategies for stable merge sorting | 2019-10-15 | Paper |
| DRAT and Propagation Redundancy Proofs Without New Variables | 2019-09-01 | Paper |
| On transformations of constant depth propositional proofs | 2019-07-10 | Paper |
| Short proofs of the Kneser-Lovász coloring principle | 2018-06-14 | Paper |
| Expander construction in \(\mathsf{VNC}^1\) | 2018-05-03 | Paper |
| Cut Elimination In Situ | 2017-09-27 | Paper |
| Uniform proofs of ACC representations | 2017-09-15 | Paper |
| The NP search problems of Frege and extended Frege proofs | 2017-07-13 | Paper |
| Resource-bounded continuity and sequentiality for type-two functionals | 2017-06-13 | Paper |
| Injection Structures Specified by Finite State Transducers | 2017-04-04 | Paper |
| Linear gaps between degrees for the polynomial calculus modulo distinct primes | 2016-09-29 | Paper |
| Quasipolynomial size Frege proofs of Frankl's theorem on the trace of sets | 2016-08-19 | Paper |
| Towards NP-P via proof complexity and search | 2016-01-27 | Paper |
| Cobham recursive set functions | 2016-01-12 | Paper |
| Safe recursive set functions | 2015-11-09 | Paper |
| Short proofs of the Kneser-Lovász coloring principle | 2015-11-04 | Paper |
| Propositional proofs in Frege and extended Frege systems (abstract) | 2015-10-20 | Paper |
| Limits on alternation trading proofs for time-space lower bounds | 2015-09-21 | Paper |
| Collapsing modular counting in bounded arithmetic and constant depth propositional proofs | 2015-09-08 | Paper |
| Book review of: Matthias Baaz and Alexander Leitsch, Methods of cut-elimination | 2015-06-26 | Paper |
| Quasipolynomial size proofs of the propositional pigeonhole principle | 2015-05-18 | Paper |
| Sub-computable Boundedness Randomness | 2015-01-15 | Paper |
| Fragments of approximate counting | 2014-09-30 | Paper |
| Small Stone in pool | 2014-07-31 | Paper |
| Improved separations of regular resolution from clause learning proof systems | 2014-05-16 | Paper |
| Improved witnessing and local improvement principles for second-order bounded arithmetic | 2014-04-16 | Paper |
| Unshuffling a square is NP-hard | 2014-02-13 | Paper |
| Alternation Trading Proofs and Their Limitations | 2013-09-20 | Paper |
| An improved separation of regular resolution from pool resolution and clause learning | 2013-08-12 | Paper |
| Probabilistic Algorithmic Randomness | 2013-06-24 | Paper |
| Propositional proofs and reductions between NP search problems | 2012-07-11 | Paper |
| Sharpened lower bounds for cut elimination | 2012-06-19 | Paper |
| Lower complexity bounds in justification logic | 2012-04-10 | Paper |
| Towards NP-P via proof complexity and search | 2012-04-10 | Paper |
| Strong isomorphism reductions in complexity theory | 2011-12-23 | Paper |
| Corrected upper bounds for free-cut elimination | 2011-10-10 | Paper |
| Characterising definable search problems in bounded arithmetic via proof notations | 2011-03-09 | Paper |
| The quantifier complexity of polynomial-size iterated definitions in first-order logic | 2011-01-10 | Paper |
| Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic | 2010-08-26 | Paper |
| Pool resolution is NP-hard to recognize | 2009-12-14 | Paper |
| Resolution Trees with Lemmas: Resolution Refinements that Characterize DLL Algorithms with Clause Learning | 2009-04-29 | Paper |
| The NP-Completeness of Reflected Fragments of Justification Logics | 2009-02-24 | Paper |
| The NP-hardness of finding a directed acyclic graph for regular resolution | 2008-05-28 | Paper |
| The computational power of bounded arithmetic from the predicative viewpoint | 2008-04-29 | Paper |
| Polynomial-size Frege and resolution proofs of \(st\)-connectivity and Hex tautologies | 2006-08-16 | Paper |
| Separation results for the size of constant-depth propositional proofs | 2005-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5465358 | 2005-08-22 | Paper |
| Solving the Fisher-Wright and coalescence problems with a discrete Markov chain analysis | 2005-04-05 | Paper |
| A Switching Lemma for Small Restrictions and Lower Bounds for k-DNF Resolution | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474836 | 2004-07-21 | Paper |
| 3-D Computer Graphics | 2003-10-27 | Paper |
| On the computational content of intuitionistic propositional proofs | 2003-04-22 | Paper |
| Ordinal notations and well-orderings in bounded arithmetic | 2003-03-16 | Paper |
| Linear gaps between degrees for the polynomial calculus modulo distinct primes | 2002-03-24 | Paper |
| Minimum propositional proof length is NP-hard to linearly approximate | 2002-01-21 | Paper |
| The prospects for mathematical logic in the twenty-first century | 2001-09-10 | Paper |
| Accurate and efficient simulation of rigid-body rotations. | 2001-05-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4499312 | 2001-03-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4263835 | 2000-10-17 | Paper |
| The complexity of the disjunction and existential properties in intuitionistic logic | 2000-02-15 | Paper |
| Good degree bounds on Nullstellensatz refutations of the induction principle | 1999-09-29 | Paper |
| Bounded arithmetic, proof complexity and two papers of Parikh | 1999-06-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4215630 | 1999-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4215631 | 1999-05-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218098 | 1999-03-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218929 | 1998-11-15 | Paper |
| Proof complexity in algebraic systems and bounded depth Frege systems with modular counting | 1998-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4375786 | 1998-06-24 | Paper |
| Linear and Time Minimum-Cost Matching Algorithms for Quasi-Convex Tours | 1998-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4364501 | 1997-11-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4357061 | 1997-10-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4335196 | 1997-06-01 | Paper |
| Cutting planes, connectivity, and threshold logic | 1996-07-16 | Paper |
| Some remarks on lengths of propositional proofs | 1996-07-16 | Paper |
| Unprovability of consistency statements in fragments of bounded arithmetic | 1996-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850545 | 1995-10-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4850546 | 1995-10-17 | Paper |
| Relating the bounded arithmetic and polynomial time hierarchies | 1995-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4325772 | 1995-03-30 | Paper |
| The Serial Transitive Closure Problem for Trees | 1995-03-27 | Paper |
| On Gödel's theorems on lengths of proofs I: Number of lines and speedup for arithmetics | 1994-11-27 | Paper |
| An Application of Boolean Complexity to Separation Problems in Bounded Arithmetic | 1994-10-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4302463 | 1994-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140633 | 1994-08-16 | Paper |
| Size-depth tradeoffs for Boolean formulae | 1994-04-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3140634 | 1993-12-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3138830 | 1993-11-11 | Paper |
| The deduction rule and linear and near-linear proof simulations | 1993-10-24 | Paper |
| Intuitionistic validity in \(T\)-normal Kripke structures | 1993-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035302 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4031421 | 1993-04-01 | Paper |
| An Optimal Parallel Algorithm for Formula Evaluation | 1993-01-16 | Paper |
| The graph of multiplication is equivalent to counting | 1992-09-26 | Paper |
| On truth-table reducibility to SAT | 1992-06-25 | Paper |
| Propositional consistency proofs | 1992-06-25 | Paper |
| The undecidability of \(k\)-provability | 1992-06-25 | Paper |
| The modal logic of pure provability | 1990-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3476809 | 1990-01-01 | Paper |
| Resolution proofs of generalized pigeonhole principles | 1988-01-01 | Paper |
| Polynomial size proofs of the propositional pigeonhole principle | 1987-01-01 | Paper |
| A Conservation Result Concerning Bounded Theories and the Collection Axiom | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3794177 | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3800030 | 1986-01-01 | Paper |
