| Publication | Date of Publication | Type |
|---|
| Query complexity of search problems | 2024-12-03 | Paper |
| QBF merge resolution is powerful but unnatural | 2024-11-12 | Paper |
| Dependency schemes in CDCL-based QBF solving: a proof-theoretic study | 2024-09-27 | Paper |
| QBF merge resolution is powerful but unnatural | 2024-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187028 | 2024-02-05 | Paper |
| On (simple) decision tree rank | 2023-10-12 | Paper |
| Linear threshold functions in decision lists, decision trees, and depth-2 circuits | 2023-10-12 | Paper |
| Hardness Characterisations and Size-width Lower Bounds for QBF Resolution | 2023-04-05 | Paper |
| Logspace verifiers, NC, and NP | 2023-03-21 | Paper |
| MaxSAT Resolution and Subcube Sums | 2023-02-07 | Paper |
| Determinant: Old algorithms, new insights | 2022-12-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5092471 | 2022-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5090460 | 2022-07-18 | Paper |
| Building strategies into QBF proofs | 2021-06-09 | Paper |
| Lower bounds for linear decision lists | 2021-05-14 | Paper |
| MaxSAT resolution and subcube sums | 2021-04-07 | Paper |
| Hardness Characterisations and Size-Width Lower Bounds for QBF Resolution | 2021-01-21 | Paper |
| Lower bound techniques for QBF proof systems | 2020-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111291 | 2020-05-26 | Paper |
| Short proofs in QBF expansion | 2020-05-20 | Paper |
| Space-efficient approximations for subset sum | 2019-12-06 | Paper |
| A quest for structure in complexity | 2019-07-03 | Paper |
| Understanding cutting planes for QBFs | 2018-09-27 | Paper |
| Understanding cutting planes for QBFs | 2018-04-19 | Paper |
| Are Short Proofs Narrow? QBF Resolution Is Not So Simple | 2018-03-22 | Paper |
| Are Short Proofs Narrow? QBF Resolution is not Simple. | 2018-01-24 | Paper |
| Sums of read-once formulas: how many summands are necessary? | 2017-12-20 | Paper |
| The shifted partial derivative complexity of elementary symmetric polynomials | 2017-10-11 | Paper |
| Feasible interpolation for QBF resolution calculi | 2017-06-22 | Paper |
| Homomorphism polynomials complete for VP | 2017-04-25 | Paper |
| Building above read-once polynomials: identity testing and hardness of representation | 2016-12-21 | Paper |
| Algebraic complexity classes | 2016-09-22 | Paper |
| Sums of read-once formulas: how many summands suffice? | 2016-07-25 | Paper |
| Homomorphism polynomials complete for VP | 2016-05-24 | Paper |
| Level-ordered \(Q\)-resolution and tree-like \(Q\)-resolution are incomparable | 2016-01-05 | Paper |
| \textsf{VNP} = \textsf{VP} in the multilinear world | 2015-12-01 | Paper |
| Feasible interpolation for QBF resolution calculi | 2015-10-27 | Paper |
| Planarity, determinants, permanents, and (unique) matchings | 2015-09-24 | Paper |
| The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials | 2015-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5501853 | 2015-08-14 | Paper |
| A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) | 2014-09-26 | Paper |
| Building above read-once polynomials: identity testing and hardness of representation | 2014-09-26 | Paper |
| Longest paths in planar DAGs in unambiguous log-space | 2014-05-06 | Paper |
| Some perfect matchings and perfect half-integral matchings in NC | 2014-05-06 | Paper |
| Monomials, multilinearity and identity testing in simple read-restricted circuits | 2014-02-11 | Paper |
| Comments on ``Arithmetic complexity, Kleene closure, and formal power series | 2013-10-21 | Paper |
| Resource trade-offs in syntactically multilinear arithmetic circuits | 2013-09-30 | Paper |
| Small space analogues of Valiant's classes and the limitations of skew formulas | 2013-04-11 | Paper |
| Counting paths in VPA is complete for \(\#\mathrm{NC}^1\) | 2012-11-21 | Paper |
| Identity testing, multilinearity testing, and monomials in read-once/twice formulas and branching programs | 2012-09-25 | Paper |
| The complexity of unary subset sum | 2012-09-25 | Paper |
| The planar \(k\)-means problem is NP-hard | 2012-08-08 | Paper |
| Upper bounds for monotone planar circuit value and variants | 2011-02-18 | Paper |
| On the complexity of membership and counting in height-deterministic pushdown automata | 2010-09-20 | Paper |
| Counting paths in VPA is complete for \#NC\(^{1}\) | 2010-07-20 | Paper |
| Arithmetizing classes around {\textsf{NC}}\(^{1}\) and {\textsf{L}} | 2010-05-05 | Paper |
| Rigidity of a simple extended lower triangular matrix | 2010-04-19 | Paper |
| On the complexity of matrix rank and rigidity | 2010-03-05 | Paper |
| Small-Space Analogues of Valiant’s Classes | 2009-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3396604 | 2009-09-19 | Paper |
| Membership Testing: Removing Extra Stacks from Multi-stack Pushdown Automata | 2009-04-02 | Paper |
| On the Bipartite Unique Perfect Matching Problem | 2009-03-12 | Paper |
| Parameterizing above or below guaranteed values | 2009-03-11 | Paper |
| The Planar k-Means Problem is NP-Hard | 2009-02-24 | Paper |
| Arithmetic Circuits, Syntactic Multilinearity, and the Limitations of Skew Formulae | 2009-02-03 | Paper |
| Simultaneous matchings: Hardness and approximation | 2008-06-26 | Paper |
| On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata | 2008-06-05 | Paper |
| On the Complexity of Matrix Rank and Rigidity | 2008-06-03 | Paper |
| Planarity, Determinants, Permanents, and (Unique) Matchings | 2008-06-03 | Paper |
| Parameterizing MAX SNP Problems Above Guaranteed Values | 2008-06-03 | Paper |
| Evaluating Monotone Circuits on Cylinders, Planes and Tori | 2008-03-19 | Paper |
| Arithmetizing Classes Around NC 1 and L | 2007-09-03 | Paper |
| On Sorting by 3-Bounded Transpositions | 2007-05-29 | Paper |
| Algorithms and Computation | 2006-11-14 | Paper |
| APPROXIMATE BLOCK SORTING | 2006-05-10 | Paper |
| Algorithms – ESA 2004 | 2005-08-18 | Paper |
| The combinatorial approach yields an NC algorithm for computing Pfaffians | 2004-11-23 | Paper |
| The complexity of planarity testing | 2004-11-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4470491 | 2004-07-01 | Paper |
| Arithmetic complexity, Kleene closure, and formal power series | 2003-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501524 | 2001-04-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938661 | 2000-10-18 | Paper |
| Determinant: Old Algorithms, New Insights | 1999-11-23 | Paper |
| Parameterizing above Guaranteed Values: MaxSat and MaxCut | 1999-09-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259990 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4246721 | 1999-06-16 | Paper |
| Non-commutative arithmetic circuits: depth reduction and size lower bounds | 1999-01-12 | Paper |
| A note on Mod and generalised Mod classes | 1997-02-28 | Paper |
| Nondeterministic, probabilistic and alternating computations on cellular array models | 1997-02-28 | Paper |
| A note on SpanP functions | 1994-08-03 | Paper |
| Language classes defined by time-bounded relativised cellular automata | 1994-04-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036784 | 1993-05-18 | Paper |
| Some results on time-varying and relativised cellular automata* | 1993-01-16 | Paper |
| Fuzzy L-systems | 1990-01-01 | Paper |
