| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7361813 (Why is no real title available?) | 2021-06-22 | Paper |
scientific article; zbMATH DE number 7361813 (Why is no real title available?)
(available as arXiv preprint) | 2021-06-22 | Paper |
Efficient computation of the large inductive dimension using order- and graph-theoretic means
Fundamenta Informaticae | 2021-05-20 | Paper |
| Dichotomy for pure scoring rules under manipulative electoral actions | 2018-07-12 | Paper |
Modal indepence logic
(available as arXiv preprint) | 2018-04-23 | 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 |
Control of Condorcet voting: complexity and a relation-algebraic approach
European Journal of Operational Research | 2016-10-06 | Paper |
| Weighted manipulation for four-candidate Llull is easy | 2015-12-11 | Paper |
Nonuniform Boolean constraint satisfaction problems with cardinality constraint
ACM Transactions on Computational Logic | 2015-09-17 | 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 |
Active linking attacks
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | 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 |
Relation Algebra and RelView Applied to Approval Voting
Relational and Algebraic Methods in Computer Science | 2014-04-16 | Paper |
Noninterference with Local Policies
Mathematical Foundations of Computer Science 2013 | 2013-09-20 | Paper |
| On the complexity of elementary modal logics | 2013-03-19 | Paper |
Complexity classifications for different equivalence and audit problems for Boolean circuits
Logical Methods in Computer Science | 2012-10-22 | Paper |
A Universally Defined Undecidable Unimodal Logic
Mathematical Foundations of Computer Science 2011 | 2011-08-17 | Paper |
The complexity of problems for quantified constraints
Theory of Computing Systems | 2010-10-06 | Paper |
Generalized modal satisfiability
Journal of Computer and System Sciences | 2010-08-18 | Paper |
The complexity of model checking for Boolean formulas
International Journal of Foundations of Computer Science | 2010-06-18 | Paper |
Bases for Boolean co-clones
Information Processing Letters | 2009-12-18 | Paper |
Computationally Sound Analysis of a Probabilistic Contract Signing Protocol
Computer Security – ESORICS 2009 | 2009-10-16 | 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 |
Partial Polymorphisms and Constraint Satisfaction Problems
Complexity of Constraints | 2009-01-22 | Paper |
Non-uniform Boolean Constraint Satisfaction Problems with Cardinality Constraint
Computer Science Logic | 2008-11-20 | Paper |
Generalized Modal Satisfiability
STACS 2006 | 2008-03-19 | Paper |
The complexity of the descriptiveness of Boolean circuits over different sets of gates
Theory of Computing Systems | 2007-12-19 | Paper |
The Complexity of Generalized Satisfiability for Linear Temporal Logic
Foundations of Software Science and Computational Structures | 2007-09-07 | Paper |
Enumerating All Solutions for Constraint Satisfaction Problems
STACS 2007 | 2007-09-03 | Paper |
Mathematical Foundations of Computer Science 2005
Lecture Notes in Computer Science | 2006-10-20 | Paper |
