| Publication | Date of Publication | Type |
|---|
| Pinpointing computation with modular queries in the Boolean hierarchy | 2024-07-05 | Paper |
| Weighted sum-of-squares lower bounds for univariate polynomials imply \(\mathsf{VP} \neq \mathsf{VNP}\) | 2024-05-22 | Paper |
| Factorization of polynomials given by arithmetic branching programs | 2022-07-21 | Paper |
| The Complexity of Poset Games | 2022-06-28 | Paper |
| The complexity of regex crosswords | 2022-06-13 | Paper |
| Factorization of polynomials given by arithmetic branching programs | 2021-11-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5002753 | 2021-07-28 | Paper |
| Bipartite Perfect Matching is in Quasi-NC | 2021-06-29 | Paper |
| Linear matroid intersection is in quasi-NC | 2021-05-25 | Paper |
| Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces | 2021-04-14 | Paper |
| Exact Perfect Matching in Complete Graphs | 2019-12-06 | Paper |
| Planarizing Gadgets for Perfect Matching Do Not Exist | 2019-12-06 | Paper |
| Reductions to sets of low information content | 2019-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4601835 | 2018-01-24 | Paper |
| Deterministic identity testing for sum of read-once oblivious arithmetic branching programs | 2017-12-18 | Paper |
| The complexity of generating and checking proofs of membership | 2017-11-16 | Paper |
| A note on the search for \(k\) elements via quantum walk | 2017-11-03 | Paper |
| Bipartite perfect matching is in quasi-NC | 2017-09-29 | Paper |
| Linear matroid intersection is in quasi-NC | 2017-08-17 | Paper |
| Counting the number of perfect matchings in \(K_{5}\)-free graphs | 2017-01-12 | Paper |
| Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games | 2016-01-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3191145 | 2014-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4910756 | 2013-03-19 | Paper |
| A Kolmogorov complexity proof of the Lovász local lemma for satisfiability | 2012-11-27 | Paper |
| Graph isomorphism for \(K_{3,3}\)-free and \(K_5\)-free graphs is in Log-space | 2012-10-24 | Paper |
| Planarizing Gadgets for Perfect Matching Do Not Exist | 2012-09-25 | Paper |
| A Kolmogorov Complexity Proof of the Lovász Local Lemma for Satisfiability | 2011-08-17 | Paper |
| The complexity of the inertia | 2011-02-18 | Paper |
| The isomorphism problem for planar 3-connected graphs is in unambiguous logspace | 2010-10-06 | Paper |
| The quantum query complexity of the determinant | 2010-06-16 | Paper |
| Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space | 2009-10-20 | Paper |
| On the Bipartite Unique Perfect Matching Problem | 2009-03-12 | Paper |
| The Quantum Complexity of Group Testing | 2008-03-07 | Paper |
| The Quantum Query Complexity of Algebraic Properties | 2008-02-26 | Paper |
| The Polynomially Bounded Perfect Matching Problem Is in NC 2 | 2007-09-03 | Paper |
| ON THE MINIMAL POLYNOMIAL OF A MATRIX | 2005-10-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808620 | 2004-08-12 | Paper |
| The complexity of the characteristic and the minimal polynomial. | 2003-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415256 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4779160 | 2002-11-25 | Paper |
| The satisfiability problem for probabilistic ordered branching programs | 2002-06-02 | Paper |
| The Formula Isomorphism Problem | 2000-10-18 | Paper |
| The computational complexity of equivalence and isomorphism problems | 2000-10-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942650 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268448 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258566 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4258573 | 1999-09-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259998 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259991 | 1999-09-08 | Paper |
| Functions computable with nonadaptive queries to NP | 1998-08-24 | Paper |
| Threshold Computation and Cryptographic Security | 1997-08-17 | Paper |
| On sets bounded truth-table reducible to $P$-selective sets | 1997-04-13 | Paper |
| On closure properties of \(\#\text{P}\) in the context of \(\text{PF} \circ \#\text{P}\) | 1997-03-31 | Paper |
| Restricted information from nonadaptive queries to NP | 1997-02-03 | Paper |
| On the correlation of symmetric functions | 1996-09-09 | Paper |
| NONDETERMINISTICALLY SELECTIVE SETS | 1996-08-13 | Paper |
| On closure properties of GapP | 1995-05-14 | Paper |
| A note on SpanP functions | 1994-08-03 | Paper |
| Complexity-Restricted Advice Functions | 1994-05-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281491 | 1994-03-10 | Paper |
