| Publication | Date of Publication | Type |
|---|
| The complexity of promise constraint satisfaction problem seen from the other side | 2026-03-26 | Paper |
| Promises make finite (constraint satisfaction) problems infinitary | 2024-12-19 | Paper |
Finite algebras with Hom-sets of polynomial size
Transactions of the American Mathematical Society | 2024-12-17 | Paper |
Multisorted Boolean clones determined by binary relations up to minion homomorphisms
Algebra Universalis | 2024-11-20 | Paper |
| Combinatorial gap theorem and reductions between promise CSPs | 2024-07-19 | Paper |
Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
TheoretiCS | 2024-07-03 | Paper |
scientific article; zbMATH DE number 7724184 (Why is no real title available?)
(available as arXiv preprint) | 2023-08-08 | Paper |
| Finite Algebras with Hom-Sets of Polynomial Size | 2023-07-13 | Paper |
| Symmetries of structures that fail to interpret something finite | 2023-02-23 | Paper |
Algebraic Approach to Promise Constraint Satisfaction
Journal of the ACM | 2022-12-08 | Paper |
| Fixed-Template Promise Model Checking Problems | 2022-05-10 | Paper |
| scientific article; zbMATH DE number 7359806 (Why is no real title available?) | 2021-06-15 | Paper |
| Absorption in universal algebra and CSP | 2021-06-15 | Paper |
| The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems | 2021-01-19 | Paper |
| Constraint Satisfaction Problems over Finite Structures | 2020-10-10 | Paper |
| Symmetric Promise Constraint Satisfaction Problems: Beyond the Boolean Case | 2020-10-09 | Paper |
| Sensitive instances of the Constraint Satisfaction Problem | 2020-05-01 | Paper |
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems)
SIAM Journal on Computing | 2020-04-01 | Paper |
Accessible set functors are universal
Commentationes Mathematicae Universitatis Carolinae | 2020-03-06 | Paper |
Algebraic theory of promise constraint satisfaction problems, first steps
(available as arXiv preprint) | 2020-01-30 | Paper |
Equations in oligomorphic clones and the constraint satisfaction problem for \(\omega \)-categorical structures
Journal of Mathematical Logic | 2019-11-29 | Paper |
Accessible set endofunctors are universal
(available as arXiv preprint) | 2019-09-11 | Paper |
The minimal arity of near unanimity polymorphisms
Mathematica Slovaca | 2019-08-12 | Paper |
Finitely related algebras in congruence modular varieties have few subpowers
Journal of the European Mathematical Society (JEMS) | 2018-06-21 | Paper |
The algebraic dichotomy conjecture for infinite domain constraint satisfaction problems
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
The wonderland of reflections
Israel Journal of Mathematics | 2018-04-06 | Paper |
Deciding absorption in relational structures
Algebra Universalis | 2017-10-09 | Paper |
Near unanimity constraints have bounded pathwidth duality
2012 27th Annual IEEE Symposium on Logic in Computer Science | 2017-05-16 | Paper |
The collapse of the bounded width hierarchy
Journal of Logic and Computation | 2016-10-07 | Paper |
Deciding absorption
International Journal of Algebra and Computation | 2016-09-23 | Paper |
Robustly solvable constraint satisfaction problems
SIAM Journal on Computing | 2016-09-02 | Paper |
The constraint satisfaction problem and universal algebra
The Bulletin of Symbolic Logic | 2016-03-21 | Paper |
Mal'tsev conditions, lack of absorption, and solvability.
Algebra Universalis | 2015-09-01 | Paper |
Constraint Satisfaction Problems Solvable by Local Consistency Methods
Journal of the ACM | 2014-09-12 | Paper |
Constraint Satisfaction Problems of Bounded Width
2009 50th Annual IEEE Symposium on Foundations of Computer Science | 2014-07-25 | Paper |
Robust satisfiability of constraint satisfaction problems
Proceedings of the forty-fourth annual ACM symposium on Theory of computing | 2014-05-13 | Paper |
Polymorphisms of small digraphs
Novi Sad Journal of Mathematics | 2013-10-18 | Paper |
CSP dichotomy for special polyads
International Journal of Algebra and Computation | 2013-10-09 | Paper |
Finitely related algebras in congruence distributive varieties have near unanimity terms
Canadian Journal of Mathematics | 2013-02-04 | Paper |
Absorbing subalgebras, cyclic terms, and the constraint satisfaction problem
Logical Methods in Computer Science | 2012-04-03 | Paper |
Cyclic terms for \(\text{SD}_{\vee}\) varieties revisited
Algebra Universalis | 2011-01-07 | Paper |
Congruence distributivity implies bounded width
SIAM Journal on Computing | 2010-09-06 | Paper |
Congruence modularity implies cyclic terms for finite algebras
Algebra Universalis | 2010-01-04 | Paper |
The CSP Dichotomy Holds for Digraphs with No Sources and No Sinks (A Positive Answer to a Conjecture of Bang-Jensen and Hell)
SIAM Journal on Computing | 2009-11-06 | Paper |
CSP dichotomy for special triads
Proceedings of the American Mathematical Society | 2009-09-11 | Paper |
Slices of essentially algebraic categories
Applied Categorical Structures | 2009-06-22 | Paper |
| scientific article; zbMATH DE number 5485593 (Why is no real title available?) | 2009-01-05 | Paper |
Finitary set endofunctors are alg-universal
Algebra Universalis | 2007-09-03 | Paper |
The category of varieties and interpretations is alg-universal
Journal of Pure and Applied Algebra | 2007-09-03 | Paper |
Weakly terminal objects in quasicategories of \(\mathcal{SET}\) endofunctors
Applied Categorical Structures | 2006-02-23 | Paper |
| scientific article; zbMATH DE number 2222238 (Why is no real title available?) | 2005-11-02 | Paper |
| scientific article; zbMATH DE number 2222238 (Why is no real title available?) | 2005-11-02 | Paper |
