| Publication | Date of Publication | Type |
|---|
| Modular SAT-based techniques for reasoning tasks in team semantics | 2024-10-08 | Paper |
| Enumeration classes defined by circuits | 2024-08-06 | Paper |
| Tractability Frontier of Data Complexity in Team Semantics | 2022-12-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5013879 | 2021-12-03 | Paper |
| Descriptive complexity of \#P functions: a new perspective | 2021-01-22 | Paper |
| Model-Theoretic Characterization of Boolean and Arithmetic Circuit Classes of Small Depth | 2021-01-20 | Paper |
| Expressivity and Complexity of Dependence Logic | 2020-02-04 | Paper |
| Approximation and dependence via multiteam semantics | 2018-09-21 | Paper |
| Probabilistic team semantics | 2018-06-26 | Paper |
| Descriptive Complexity of #AC^0 Functions | 2017-07-19 | Paper |
| First-order queries on structures of bounded degree are computable with constant delay | 2017-07-12 | Paper |
| Homomorphism Polynomials Complete for VP | 2017-04-25 | Paper |
| The arithmetic complexity of tensor contractions | 2017-01-30 | Paper |
| Dependence logic with a majority quantifier | 2016-07-04 | Paper |
| The arithmetic complexity of tensor contraction | 2016-06-03 | Paper |
| Homomorphism polynomials complete for VP | 2016-05-24 | Paper |
| Approximation and Dependence via Multiteam Semantics | 2016-05-19 | Paper |
| Structural tractability of counting of solutions to conjunctive queries | 2016-04-18 | Paper |
| Hierarchies in Dependence Logic | 2015-09-17 | Paper |
| Hypergraph Acyclicity and Propositional Model Counting | 2014-09-26 | Paper |
| The complexity of weighted counting for acyclic conjunctive queries | 2014-01-28 | Paper |
| Fifty years of the spectrum problem: survey and new results | 2013-01-17 | Paper |
| Trichotomies in the complexity of minimal inference | 2012-12-06 | Paper |
| Enumeration complexity of logical query problems with second-order variables | 2012-09-18 | Paper |
| Dependence logic with a majority quantifier | 2012-08-31 | Paper |
| Complexity issues for the sandwich homogeneous set problem | 2011-04-19 | Paper |
| Efficient Enumeration for Conjunctive Queries over X-underbar Structures | 2010-09-03 | Paper |
| On the counting complexity of propositional circumscription | 2010-04-19 | Paper |
| First-Order Queries over One Unary Function | 2009-03-12 | Paper |
| On Acyclic Conjunctive Queries and Constant Delay Enumeration | 2009-03-05 | Paper |
| Computing thejth solution of a first-order query | 2008-07-21 | Paper |
| The expressive power of bijections over weakly arithmetized structures | 2006-10-25 | Paper |
| Subtractive reductions and complete problems for counting complexity classes | 2005-09-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474838 | 2004-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4418672 | 2003-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941892 | 2003-05-19 | Paper |
| Nonerasing, counting, and majority over the linear time hierarchy | 2003-01-14 | Paper |
| Linear time and the power of one first-order universal quantifier | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536368 | 2002-11-04 | Paper |
| On the complexity of recognizing the Hilbert basis of a linear Diophantine system | 2002-03-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218932 | 1998-11-15 | Paper |
| Subclasses of binary NP | 1998-07-28 | Paper |
| First-order spectra with one binary predicate | 1997-02-27 | Paper |
