| Publication | Date of Publication | Type |
|---|
Enumeration classes defined by circuits
ACM Transactions on Computation Theory | 2026-01-20 | Paper |
Counting of teams in first-order team logics
ACM Transactions on Computational Logic | 2026-01-07 | Paper |
A logical characterization of constant-depth circuits over the reals
Journal of Logic and Computation | 2025-09-30 | Paper |
Parameterized complexity of weighted team definability
Mathematical Structures in Computer Science | 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
(available as arXiv preprint) | 2022-06-24 | Paper |
Descriptive complexity of \#P functions: a new perspective
Journal of Computer and System Sciences | 2021-01-22 | Paper |
Model-theoretic characterization of Boolean and arithmetic circuit classes of small depth
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-20 | Paper |
Expressivity and Complexity of Dependence Logic
Dependence Logic | 2020-02-04 | Paper |
Satisfiability of modal inclusion logic. Lax and strict semantics
ACM Transactions on Computational Logic | 2019-11-22 | Paper |
A complexity theory for hard enumeration problems
Discrete Applied Mathematics | 2019-09-19 | Paper |
A model-theoretic characterization of constant-depth arithmetic circuits
Annals of Pure and Applied Logic | 2019-09-18 | Paper |
| Complexity of model checking for logics over Kripke models | 2018-09-04 | Paper |
Modal indepence logic
(available as arXiv preprint) | 2018-04-23 | Paper |
Complexity of propositional logics in team semantic
ACM Transactions on Computational Logic | 2018-03-22 | Paper |
Modal independence logic
Journal Of Logic And Computation | 2018-02-13 | Paper |
A Van Benthem Theorem for Modal Team Semantics
(available as arXiv preprint) | 2017-08-31 | Paper |
Paradigms for parameterized enumeration
Theory of Computing Systems | 2017-08-15 | Paper |
Descriptive complexity of \#AC\(^0\) functions
(available as arXiv preprint) | 2017-07-19 | Paper |
On the complexity of hard enumeration problems
Lecture Notes in Computer Science | 2017-06-01 | Paper |
A model-theoretic characterization of constant-depth arithmetic circuits
Lecture Notes in Computer Science | 2016-09-09 | Paper |
Dependence logic with a majority quantifier
Journal of Logic, Language and Information | 2016-07-04 | Paper |
Parameterized complexity of weighted satisfiability problems: decision, enumeration, counting
Fundamenta Informaticae | 2016-05-11 | Paper |
Erratum to: ``The complexity of satisfiability for fragments of CTL and \(\mathrm{CTL}^\star\)''
International Journal of Foundations of Computer Science | 2016-04-15 | Paper |
Parameterized enumeration for modification problems
Language and Automata Theory and Applications | 2016-04-08 | Paper |
| \textsf{LoCo} -- a logic for configuration problems | 2015-12-11 | Paper |
The tractability of model checking for LTL: the good, the bad, and the ugly fragments
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
LoCo—A Logic for Configuration Problems
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Complexity of Propositional Independence and Inclusion Logic
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Modal inclusion logic: being lax is simpler than being strict
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Lindström quantifiers and leaf language definability
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
The tractability of model-checking for LTL: the good, the bad, and the ugly fragments
Electronic Notes in Theoretical Computer Science | 2015-03-23 | Paper |
A fragment of dependence logic capturing polynomial time
Logical Methods in Computer Science | 2014-09-05 | Paper |
Paradigms for parameterized enumeration
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
Extended modal dependence logic \(\mathcal{EMDL}\)
Logic, Language, Information, and Computation | 2013-09-17 | Paper |
Model checking for modal dependence logic: an approach through Post's lattice
Logic, Language, Information, and Computation | 2013-09-17 | Paper |
Parameterized complexity of weighted satisfiability problems
Theory and Applications of Satisfiability Testing – SAT 2012 | 2013-08-12 | Paper |
Complexity results for modal dependence logic
Studia Logica | 2013-06-13 | Paper |
Complexity classifications for different equivalence and audit problems for Boolean circuits
Logical Methods in Computer Science | 2012-10-22 | Paper |
Dependence logic with a majority quantifier
(available as arXiv preprint) | 2012-08-31 | Paper |
The complexity of reasoning for fragments of default logic
Journal of Logic and Computation | 2012-06-20 | Paper |
On the parameterized complexity of default logic and autoepistemic logic
Language and Automata Theory and Applications | 2012-06-08 | Paper |
The complexity of problems for quantified constraints
Theory of Computing Systems | 2010-10-06 | Paper |
On second-order monadic monoidal and groupoidal quantifiers
Logical Methods in Computer Science | 2010-09-21 | Paper |
Complexity Results for Modal Dependence Logic
Computer Science Logic | 2010-09-03 | Paper |
Bases for Boolean co-clones
Information Processing Letters | 2009-12-18 | Paper |
The complexity of deciding if a Boolean function can be computed by circuits over a restricted basis
Theory of Computing Systems | 2009-08-06 | Paper |
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences | 2009-04-30 | Paper |
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Logical Methods in Computer Science | 2009-04-29 | Paper |
Boolean Constraint Satisfaction Problems: When Does Post’s Lattice Help?
Complexity of Constraints | 2009-01-22 | Paper |
On Second-Order Monadic Groupoidal Quantifiers
Logic, Language, Information and Computation | 2008-07-10 | Paper |
Computational Complexity of Constraint Satisfaction
Lecture Notes in Computer Science | 2007-11-13 | Paper |
STACS 2004
Lecture Notes in Computer Science | 2007-10-01 | Paper |
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
The many faces of a translation
Journal of Computer and System Sciences | 2006-01-10 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
The complexity of base station positioning in cellular networks
Discrete Applied Mathematics | 2005-05-04 | Paper |
Functions computable in polynomial space
Information and Computation | 2005-05-04 | Paper |
Arithmetic Circuits and Polynomial Replacement Systems
SIAM Journal on Computing | 2005-02-21 | Paper |
| scientific article; zbMATH DE number 2102762 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2087227 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2080200 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 1759420 (Why is no real title available?) | 2004-03-23 | Paper |
Optimal satisfiability for propositional calculi and constraint satisfaction problems.
Information and Computation | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2040898 (Why is no real title available?) | 2004-02-11 | Paper |
On the Autoreducibility of Random Sequences
SIAM Journal on Computing | 2004-01-08 | Paper |
Generic separations and leaf languages
MLQ | 2003-07-31 | Paper |
| scientific article; zbMATH DE number 1948177 (Why is no real title available?) | 2003-07-10 | Paper |
| scientific article; zbMATH DE number 1841830 (Why is no real title available?) | 2002-12-04 | Paper |
| scientific article; zbMATH DE number 1759450 (Why is no real title available?) | 2002-06-25 | Paper |
Finite automata with generalized acceptance criteria
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-01-07 | Paper |
Finite automata with generalized acceptance criteria
Discrete Mathematics and Theoretical Computer Science. DMTCS | 2002-01-07 | Paper |
| scientific article; zbMATH DE number 1670879 (Why is no real title available?) | 2001-11-11 | Paper |
The descriptive complexity approach to LOGCFL
Journal of Computer and System Sciences | 2001-10-14 | Paper |
UNIFORM CHARACTERIZATIONS OF COMPLEXITY CLASSES OF FUNCTIONS
International Journal of Foundations of Computer Science | 2001-05-20 | Paper |
Characterizing small depth and small space classes by operators of higher types
Chicago Journal of Theoretical Computer Science | 2001-05-15 | Paper |
| scientific article; zbMATH DE number 1453080 (Why is no real title available?) | 2001-05-08 | Paper |
A note on closure properties of logspace MOD classes
Information Processing Letters | 2000-10-26 | Paper |
| scientific article; zbMATH DE number 1414291 (Why is no real title available?) | 2000-03-16 | Paper |
| scientific article; zbMATH DE number 1405667 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 1304331 (Why is no real title available?) | 1999-11-15 | Paper |
scientific article; zbMATH DE number 1332676 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science | 1999-09-08 | Paper |
Probabilistic type-2 operators and ``almost''-classes
Computational Complexity | 1999-02-02 | Paper |
Relating polynomial time to constant depth
Theoretical Computer Science | 1999-01-12 | Paper |
| scientific article; zbMATH DE number 1136092 (Why is no real title available?) | 1998-07-27 | Paper |
Gap-languages and log-time complexity classes
Theoretical Computer Science | 1998-06-30 | Paper |
| scientific article; zbMATH DE number 1161568 (Why is no real title available?) | 1998-06-10 | Paper |
The chain method to separate counting classes
Theory of Computing Systems | 1998-04-20 | Paper |
Nondeterministic NC^1 computation
Journal of Computer and System Sciences | 1998-01-01 | Paper |
Recursion theoretic characterizations of complexity classes of counting functions
Theoretical Computer Science | 1997-09-10 | Paper |
| scientific article; zbMATH DE number 1008517 (Why is no real title available?) | 1997-05-12 | Paper |
On balanced versus unbalanced computation trees
Mathematical Systems Theory | 1996-08-05 | Paper |
Complexity classes of optimization functions
Information and Computation | 1996-04-16 | Paper |
THE COMPLEXITY OF FINDING MIDDLE ELEMENTS
International Journal of Foundations of Computer Science | 1995-01-12 | Paper |
| scientific article; zbMATH DE number 512990 (Why is no real title available?) | 1994-03-10 | Paper |
