| Publication | Date of Publication | Type |
|---|
Optimally rewriting formulas and database queries: a confluence of term rewriting, structural decomposition, and complexity
Logical Methods in Computer Science | 2026-05-29 | Paper |
| Optimally rewriting formulas and database queries: a confluence of term rewriting, structural decomposition, and complexity | 2025-11-11 | Paper |
| Testing assignments to constraint satisfaction problems | 2025-08-06 | Paper |
Sparsification lower bounds for list H-coloring
ACM Transactions on Computation Theory | 2025-02-24 | Paper |
Algebraic global gadgetry for surjective constraint satisfaction
Computational Complexity | 2024-08-01 | Paper |
Sparsification lower bounds for list \(H\)-coloring
(available as arXiv preprint) | 2023-11-14 | Paper |
| Computability and complexity | 2023-01-25 | Paper |
Best-case and worst-case sparsifiability of Boolean CSPs
(available as arXiv preprint) | 2021-08-04 | Paper |
| The logic of counting query answers | 2021-01-19 | Paper |
The logic of counting query answers
(available as arXiv preprint) | 2021-01-19 | Paper |
Best-case and worst-case sparsifiability of Boolean CSPs
Algorithmica | 2020-08-12 | Paper |
| The Exponential Time complexity of counting (quantum) graph homomorphisms | 2020-02-24 | Paper |
Asking the Metaquestions in Constraint Tractability
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
Proof complexity modulo the polynomial hierarchy: understanding alternation as a source of hardness
ACM Transactions on Computation Theory | 2019-12-06 | Paper |
How many variables are needed to express an existential positive query?
Theory of Computing Systems | 2019-09-05 | Paper |
Constant-query testability of assignments to constraint satisfaction problems
SIAM Journal on Computing | 2019-09-02 | Paper |
| Learnability of solutions to conjunctive queries | 2019-06-07 | Paper |
| How many variables are needed to express an existential positive query? | 2018-07-18 | Paper |
The tractability frontier of graph-like first-order query sets
Journal of the ACM | 2018-05-17 | Paper |
The tractability frontier of graph-like first-order query sets
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
The tractability frontier of graph-like first-order query sets
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
One hierarchy spawns another, graph deconstructions and the complexity classification of conjunctive queries
ACM Transactions on Computational Logic | 2018-03-22 | Paper |
Proof Complexity Modulo the Polynomial Hierarchy: Understanding Alternation as a Source of Hardness
(available as arXiv preprint) | 2017-12-19 | Paper |
The parameterized space complexity of embedding along a path
Theory of Computing Systems | 2017-10-12 | Paper |
Parameter compilation
(available as arXiv preprint) | 2017-09-29 | Paper |
| Quantified constraint satisfaction on monoids | 2017-07-19 | Paper |
A trichotomy in the complexity of counting answers to conjunctive queries
(available as arXiv preprint) | 2017-06-13 | Paper |
Decomposing quantified conjunctive (or disjunctive) formulas
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
An algebraic preservation theorem for aleph-zero categorical quantified constraint satisfaction
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
Decomposing Quantified Conjunctive (or Disjunctive) Formulas
SIAM Journal on Computing | 2016-12-13 | Paper |
The fine classification of conjunctive queries and parameterized logarithmic space
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
The fine classification of conjunctive queries and parameterized logarithmic space
ACM Transactions on Computation Theory | 2016-10-24 | Paper |
Quantified Constraints and Containment Problems
Logical Methods in Computer Science | 2015-10-29 | Paper |
Tractability of quantified temporal constraints to the max
International Journal of Algebra and Computation | 2015-02-24 | Paper |
Beyond Q-resolution and prenex form: a proof system for quantified constraint satisfaction
Logical Methods in Computer Science | 2015-01-15 | Paper |
An algebraic hardness criterion for surjective constraint satisfaction.
Algebra Universalis | 2015-01-09 | Paper |
The complexity of equivalence, entailment, and minimization in existential positive logic
Journal of Computer and System Sciences | 2014-11-24 | Paper |
On the complexity of existential positive queries
ACM Transactions on Computational Logic | 2014-04-16 | Paper |
On the complexity of existential positive queries
ACM Transactions on Computational Logic | 2014-04-16 | Paper |
| A coalgebraic approach to Kleene algebra with tests | 2013-08-23 | Paper |
Bounded rationality, strategy simplification, and equilibrium
International Journal of Game Theory | 2013-08-19 | Paper |
Block-Sorted Quantified Conjunctive Queries
Automata, Languages, and Programming | 2013-08-07 | Paper |
Generic expression hardness results for primitive positive formula comparison
Information and Computation | 2013-06-06 | Paper |
Arc consistency and friends
Journal Of Logic And Computation | 2013-04-19 | Paper |
An algebraic preservation theorem for _0-categorical quantified constraint satisfaction
Logical Methods in Computer Science | 2013-04-09 | Paper |
On the expression complexity of equivalence and isomorphism of primitive positive formulas
Theory of Computing Systems | 2012-12-06 | Paper |
On the complexity of MMSNP
SIAM Journal on Discrete Mathematics | 2012-08-22 | Paper |
Meditations on quantified constraint satisfaction
Logic and Program Semantics | 2012-07-16 | Paper |
Generic expression hardness results for primitive positive formula comparison
Lecture Notes in Computer Science | 2011-07-07 | Paper |
Quantified constraint satisfaction and the polynomially generated powers property
Algebra Universalis | 2011-06-01 | Paper |
Quantified Equality Constraints
SIAM Journal on Computing | 2011-04-04 | Paper |
The reducts of equality up to primitive positive interdefinability
Journal of Symbolic Logic | 2011-01-12 | Paper |
Constraint satisfaction with succinctly specified relations
Journal of Computer and System Sciences | 2010-10-07 | Paper |
Causal graphs and structurally restricted planning
Journal of Computer and System Sciences | 2010-08-18 | Paper |
Periodic constraint satisfaction problems: polynomial-time algorithms
Lecture Notes in Computer Science | 2010-03-02 | Paper |
Qualitative temporal and spatial reasoning revisited
Journal Of Logic And Computation | 2010-01-14 | Paper |
Peek arc consistency
Theoretical Computer Science | 2009-12-15 | Paper |
The complexity of constraint satisfaction games and QCSP
Information and Computation | 2009-09-14 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2009-07-24 | Paper |
On-the-Fly Macros
Logic, Language, Information and Computation | 2009-07-02 | Paper |
Relatively quantified constraint satisfaction
Constraints | 2009-05-29 | Paper |
Maximal infinite-valued constraint languages
Theoretical Computer Science | 2009-04-29 | Paper |
Existentially restricted quantified constraint satisfaction
Information and Computation | 2009-04-16 | Paper |
Collapsibility in Infinite-Domain Quantified Constraint Satisfaction
Computer Science Logic | 2009-03-12 | Paper |
Qualitative Temporal and Spatial Reasoning Revisited
Computer Science Logic | 2009-03-05 | Paper |
The Complexity of Quantified Constraint Satisfaction: Collapsibility, Sink Algebras, and the Three-Element Case
SIAM Journal on Computing | 2008-10-28 | Paper |
Beyond Hypertree Width: Decomposition Methods Without Decompositions
Principles and Practice of Constraint Programming - CP 2005 | 2008-09-09 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Principles and Practice of Constraint Programming – CP 2004
Lecture Notes in Computer Science | 2008-09-09 | Paper |
Inverse NP problems
Computational Complexity | 2008-08-20 | Paper |
Quantified Constraint Satisfaction and the Polynomially Generated Powers Property
Automata, Languages and Programming | 2008-08-19 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
Maximal Infinite-Valued Constraint Languages
Automata, Languages and Programming | 2007-11-28 | Paper |
Learning intersection-closed classes with signatures
Theoretical Computer Science | 2007-09-18 | Paper |
Oligomorphic clones
Algebra Universalis | 2007-09-03 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Periodic constraint satisfaction problems: Tractable subclasses
Constraints | 2006-02-23 | Paper |
The expressive rate of constraints
Annals of Mathematics and Artificial Intelligence | 2006-01-23 | Paper |
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science | 2005-12-16 | Paper |
STACS 2005
Lecture Notes in Computer Science | 2005-12-02 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
A coalgebraic approach to Kleene algebra with tests
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2084720 (Why is no real title available?) | 2004-08-09 | Paper |
