| Publication | Date of Publication | Type |
|---|
| On the power of symmetric linear programs | 2024-12-19 | Paper |
| Consistency, acyclicity, and positive Semirings | 2024-10-01 | Paper |
| Promise constraint satisfaction and width | 2024-07-19 | Paper |
| Towards a theory of algorithmic proof complexity (invited talk) | 2024-06-24 | Paper |
| Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem | 2023-10-26 | Paper |
| Circular (Yet Sound) Proofs in Propositional Logic | 2023-07-18 | Paper |
| On the Consistency of Circuit Lower Bounds for Non-Deterministic Time | 2023-03-02 | Paper |
| Clique Is Hard on Average for Regular Resolution | 2022-12-08 | Paper |
| On the Power of Symmetric Linear Programs | 2022-12-08 | Paper |
| Size-degree trade-offs for sums-of-squares and positivstellensatz proofs | 2022-07-27 | Paper |
| Definable Inapproximability: New Challenges for Duplicator | 2022-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002801 | 2021-07-28 | Paper |
| On the Expressive Power of Homomorphism Counts | 2021-01-29 | Paper |
| Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism Problem | 2021-01-20 | Paper |
| Automating Resolution is NP-Hard | 2020-11-11 | Paper |
| Proof complexity meets algebra | 2020-05-27 | Paper |
| Circular (yet sound) proofs | 2020-05-20 | Paper |
| Definable inapproximability: new challenges for duplicator | 2020-02-17 | Paper |
| Clique is hard on average for regular resolution | 2019-08-22 | Paper |
| Generalized satisfiability problems via operator assignments | 2019-08-07 | Paper |
| Quantum and non-signalling graph isomorphisms | 2019-06-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4625699 | 2019-02-25 | Paper |
| Proof Complexity Meets Algebra | 2019-02-07 | Paper |
| Entailment among Probabilistic Implications | 2018-04-23 | Paper |
| Generalized satisfiability problems via operator assignments | 2017-11-22 | Paper |
| Non-Homogenizable Classes of Finite Structures | 2017-07-19 | Paper |
| Narrow Proofs May Be Maximally Long | 2017-07-12 | Paper |
| Bounded-width QBF is PSPACE-complete | 2017-01-30 | Paper |
| Sherali-Adams relaxations and indistinguishability in counting logics | 2016-10-07 | Paper |
| The Ordering Principle in a Fragment of Approximate Counting | 2015-09-17 | Paper |
| LOWER BOUNDS FOR DNF-REFUTATIONS OF A RELATIVIZED WEAK PIGEONHOLE PRINCIPLE | 2015-08-14 | Paper |
| On sufficient conditions for unsatisfiability of random formulas | 2015-08-01 | Paper |
| Partially definable forcing and bounded arithmetic | 2015-02-23 | Paper |
| Book review of: E. Grädel, P. Kolaitis, L. Libkin, M. Marx, I. Spencer, M. Vardi, Y. Venema, S. Weinstein, Finite model theory and its applications | 2014-10-07 | Paper |
| Bounded-width QBF is PSPACE-complete | 2014-06-10 | Paper |
| Degree lower bounds of tower-type for approximating formulas with parity quantifiers | 2014-04-16 | Paper |
| Size bounds and query plans for relational joins | 2013-11-14 | Paper |
| The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree Semi-algebraic Proofs | 2013-08-05 | Paper |
| Sherali-Adams relaxations and indistinguishability in counting logics | 2013-07-04 | Paper |
| Degree Lower Bounds of Tower-Type for Approximating Formulas with Parity Quantifiers | 2012-11-01 | Paper |
| Mean-payoff games and propositional proofs | 2011-04-28 | Paper |
| Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution | 2011-03-08 | Paper |
| Mean-Payoff Games and Propositional Proofs | 2010-09-07 | Paper |
| Decidable Relationships between Consistency Notions for Constraint Satisfaction Problems | 2009-11-12 | Paper |
| Preservation under Extensions on Well-Behaved Finite Structures | 2009-08-20 | Paper |
| Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution | 2009-07-07 | Paper |
| Affine systems of equations and counting infinitary logic | 2009-04-29 | Paper |
| On preservation under homomorphisms and unions of conjunctive queries | 2008-12-21 | Paper |
| Principles and Practice of Constraint Programming – CP 2004 | 2008-09-09 | Paper |
| On digraph coloring problems and treewidth duality | 2008-05-13 | Paper |
| A combinatorial characterization of resolution width | 2008-03-11 | Paper |
| On the Power of k-Consistency | 2007-11-28 | Paper |
| Affine Systems of Equations and Counting Infinitary Logic | 2007-11-28 | Paper |
| Conjunctive query evaluation by search-tree revisited | 2007-03-12 | Paper |
| Automata, Languages and Programming | 2006-01-10 | Paper |
| Database Theory - ICDT 2005 | 2005-09-13 | Paper |
| Computer Science Logic | 2005-08-22 | Paper |
| On the automatizability of resolution and related propositional proof systems | 2004-10-04 | Paper |
| Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411848 | 2003-07-10 | Paper |
| Monotone simulations of non-monotone proofs. | 2003-05-14 | Paper |
| Lower bounds for the weak pigeonhole principle and random formulas beyond resolution | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779142 | 2002-11-25 | Paper |
| Monotone proofs of the pigeon hole principle | 2002-06-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4535079 | 2002-06-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753672 | 2001-11-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754140 | 2001-11-11 | Paper |
