| Publication | Date of Publication | Type |
|---|
| Parameterized complexity of weighted team definability | 2024-10-16 | Paper |
| Enumeration classes defined by circuits | 2024-08-06 | Paper |
| Relations among parallel and sequential computation models | 2024-06-21 | Paper |
| A logical characterization of constant-depth circuits over the reals | 2022-06-24 | 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 |
| Satisfiability of Modal Inclusion Logic | 2019-11-22 | Paper |
| A complexity theory for hard enumeration problems | 2019-09-19 | Paper |
| A model-theoretic characterization of constant-depth arithmetic circuits | 2019-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584892 | 2018-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4636302 | 2018-04-23 | Paper |
| Complexity of Propositional Logics in Team Semantic | 2018-03-22 | Paper |
| Modal independence logic: | 2018-02-13 | Paper |
| A Van Benthem Theorem for Modal Team Semantics | 2017-08-31 | Paper |
| Paradigms for parameterized enumeration | 2017-08-15 | Paper |
| Descriptive Complexity of #AC^0 Functions | 2017-07-19 | Paper |
| A complexity theory for hard enumeration problems | 2017-06-01 | Paper |
| A model-theoretic characterization of constant-depth arithmetic circuits | 2016-09-09 | Paper |
| Dependence logic with a majority quantifier | 2016-07-04 | Paper |
| Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting | 2016-05-11 | Paper |
| Erratum to: ``The complexity of satisfiability for fragments of CTL and \(\mathrm{CTL}^\star\) | 2016-04-15 | Paper |
| Parameterized Enumeration for Modification Problems | 2016-04-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3457200 | 2015-12-11 | Paper |
| The tractability of model checking for LTL | 2015-09-17 | Paper |
| LoCo—A Logic for Configuration Problems | 2015-09-17 | Paper |
| Complexity of Propositional Independence and Inclusion Logic | 2015-09-16 | Paper |
| Modal Inclusion Logic: Being Lax is Simpler than Being Strict | 2015-09-16 | Paper |
| LINDSTRÖM QUANTIFIERS AND LEAF LANGUAGE DEFINABILITY | 2015-04-29 | Paper |
| The Tractability of Model-checking for LTL: The Good, the Bad, and the Ugly Fragments | 2015-03-23 | Paper |
| A fragment of dependence logic capturing polynomial time | 2014-09-05 | Paper |
| Paradigms for Parameterized Enumeration | 2013-09-20 | Paper |
| Extended Modal Dependence Logic $\mathcal{EMDL}$ | 2013-09-17 | Paper |
| Model Checking for Modal Dependence Logic: An Approach through Post’s Lattice | 2013-09-17 | Paper |
| Parameterized Complexity of Weighted Satisfiability Problems | 2013-08-12 | Paper |
| Complexity results for modal dependence logic | 2013-06-13 | Paper |
| Complexity classifications for different equivalence and audit problems for Boolean circuits | 2012-10-22 | Paper |
| Dependence logic with a majority quantifier | 2012-08-31 | Paper |
| The complexity of reasoning for fragments of default logic | 2012-06-20 | Paper |
| On the Parameterized Complexity of Default Logic and Autoepistemic Logic | 2012-06-08 | Paper |
| The complexity of problems for quantified constraints | 2010-10-06 | Paper |
| On second-order monadic monoidal and groupoidal quantifiers | 2010-09-21 | Paper |
| Complexity Results for Modal Dependence Logic | 2010-09-03 | Paper |
| Bases for Boolean co-clones | 2009-12-18 | Paper |
| The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis | 2009-08-06 | Paper |
| The complexity of satisfiability problems: Refining Schaefer's theorem | 2009-04-30 | Paper |
| The Complexity of Generalized Satisfiability for Linear Temporal Logic | 2009-04-29 | Paper |
| Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help? | 2009-01-22 | Paper |
| On Second-Order Monadic Groupoidal Quantifiers | 2008-07-10 | Paper |
| Computational Complexity of Constraint Satisfaction | 2007-11-13 | Paper |
| STACS 2004 | 2007-10-01 | Paper |
| The Complexity of Generalized Satisfiability for Linear Temporal Logic | 2007-09-07 | Paper |
| Mathematical Foundations of Computer Science 2005 | 2006-10-20 | Paper |
| The many faces of a translation | 2006-01-10 | Paper |
| Theory and Applications of Satisfiability Testing | 2005-12-16 | Paper |
| The complexity of base station positioning in cellular networks | 2005-05-04 | Paper |
| Functions computable in polynomial space | 2005-05-04 | Paper |
| Arithmetic Circuits and Polynomial Replacement Systems | 2005-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818850 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737911 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4472442 | 2004-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536369 | 2004-03-23 | Paper |
| Optimal satisfiability for propositional calculi and constraint satisfaction problems. | 2004-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452054 | 2004-02-11 | Paper |
| On the Autoreducibility of Random Sequences | 2004-01-08 | Paper |
| Generic separations and leaf languages | 2003-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4411838 | 2003-07-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783318 | 2002-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536400 | 2002-06-25 | Paper |
| Finite automata with generalized acceptance criteria | 2002-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754205 | 2001-11-11 | Paper |
| The descriptive complexity approach to LOGCFL | 2001-10-14 | Paper |
| UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS | 2001-05-20 | Paper |
| Characterizing small depth and small space classes by operators of higher types | 2001-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4955353 | 2001-05-08 | Paper |
| A note on closure properties of logspace MOD classes | 2000-10-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942628 | 2000-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938648 | 2000-02-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4251062 | 1999-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259998 | 1999-09-08 | Paper |
| Probabilistic type-2 operators and ``almost-classes | 1999-02-02 | Paper |
| Relating polynomial time to constant depth | 1999-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4381403 | 1998-07-27 | Paper |
| Gap-languages and log-time complexity classes | 1998-06-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4393484 | 1998-06-10 | Paper |
| The chain method to separate counting classes | 1998-04-20 | Paper |
| Nondeterministic \(NC^1\) computation | 1998-01-01 | Paper |
| Recursion theoretic characterizations of complexity classes of counting functions | 1997-09-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4336277 | 1997-05-12 | Paper |
| On balanced versus unbalanced computation trees | 1996-08-05 | Paper |
| Complexity classes of optimization functions | 1996-04-16 | Paper |
| THE COMPLEXITY OF FINDING MIDDLE ELEMENTS | 1995-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281699 | 1994-03-10 | Paper |
