| Publication | Date of Publication | Type |
|---|
Graphs of finite algebras: maximality, rectangularity, and decomposition
Algebra Universalis | 2024-11-01 | Paper |
Graphs of finite algebras: edges, and connectivity
Algebra Universalis | 2024-11-01 | Paper |
Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
TheoretiCS | 2024-07-03 | Paper |
Complexity classification of counting graph homomorphisms modulo a prime number
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
On the complexity of CSP-based ideal membership problems
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
Approximate Counting CSP Seen from the Other Side
ACM Transactions on Computation Theory | 2022-12-05 | Paper |
Counting homomorphisms modulo a prime number
(available as arXiv preprint) | 2022-07-21 | Paper |
scientific article; zbMATH DE number 7561704 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
| Dismantlability, Connectedness, and Mixing in Relational Structures | 2022-07-21 | Paper |
| The Ideal Membership Problem and Abelian Groups | 2022-01-13 | Paper |
Satisfiability threshold for power law random 2-SAT in configuration model
Theoretical Computer Science | 2021-09-27 | Paper |
Dismantlability, connectedness, and mixing in relational structures
Journal of Combinatorial Theory. Series B | 2021-02-03 | Paper |
Dismantlability, connectedness, and mixing in relational structures
Journal of Combinatorial Theory. Series B | 2021-02-03 | Paper |
| Constraint satisfaction problems over semilattice block Mal'tsev algebras | 2021-01-19 | Paper |
| Separation of congruence intervals and implications | 2020-07-11 | Paper |
| Local structure of idempotent algebras II | 2020-06-17 | Paper |
| Local structure of idempotent algebras I | 2020-06-16 | Paper |
Satisfiability threshold for power law random 2-SAT in configuration model
Lecture Notes in Computer Science | 2020-05-20 | Paper |
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin
Journal of Computer and System Sciences | 2020-02-24 | Paper |
Constraint satisfaction problems over semilattice block Mal'tsev algebras
Information and Computation | 2019-09-17 | Paper |
| Concentration inequalities for sums of random variables, each having power bounded tails | 2019-03-06 | Paper |
The subpower membership problem for finite algebras with cube terms
(available as arXiv preprint) | 2019-02-25 | Paper |
| Counting homomorphisms in plain exponential time | 2018-10-07 | Paper |
| scientific article; zbMATH DE number 6930501 (Why is no real title available?) | 2018-09-03 | Paper |
scientific article; zbMATH DE number 6930501 (Why is no real title available?)
(available as arXiv preprint) | 2018-09-03 | Paper |
| Constraint satisfaction problems: complexity and algorithms | 2018-06-26 | Paper |
Graphs of relational structures: restricted types
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science | 2018-04-23 | Paper |
| Counting constraint satisfaction problems | 2017-11-06 | Paper |
Lower bounds on words separation: are there short identities in transformation semigroups?
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Lower bounds on words separation: are there short identities in transformation semigroups?
The Electronic Journal of Combinatorics | 2017-09-08 | Paper |
Functional clones and expressibility of partition functions
Theoretical Computer Science | 2017-06-13 | Paper |
| Descriptive Complexity of approximate counting CSPs | 2017-02-02 | Paper |
The subpower membership problem for semigroups
International Journal of Algebra and Computation | 2016-12-14 | Paper |
Conservative constraint satisfaction re-revisited
Journal of Computer and System Sciences | 2015-12-11 | Paper |
Complexity of conservative constraint satisfaction problems
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Phase transition for local search on planted SAT
Mathematical Foundations of Computer Science 2015 | 2015-09-16 | Paper |
Boolean max-co-clones
Algebra Universalis | 2015-09-01 | Paper |
The complexity of maximal constraint languages
Proceedings of the thirty-third annual ACM symposium on Theory of computing | 2015-02-27 | Paper |
Approximating highly satisfiable random 2-SAT
Lecture Notes in Computer Science | 2014-09-26 | Paper |
Constraint satisfaction parameterized by solution size
SIAM Journal on Computing | 2014-07-30 | Paper |
The complexity of the counting constraint satisfaction problem
Journal of the ACM | 2014-02-17 | Paper |
The expressibility of functions on the Boolean domain, with applications to counting CSPs
Journal of the ACM | 2014-02-17 | Paper |
| Log-supermodular functions, functional clones and counting CSPs | 2012-08-23 | Paper |
Enumerating homomorphisms
Journal of Computer and System Sciences | 2012-05-11 | Paper |
The complexity of weighted and unweighted \(\#\)CSP
Journal of Computer and System Sciences | 2012-05-11 | Paper |
| scientific article; zbMATH DE number 6028114 (Why is no real title available?) | 2012-04-26 | Paper |
| Enumerating homomorphisms | 2012-04-24 | Paper |
Constraint Satisfaction Parameterized by Solution Size
Automata, Languages and Programming | 2011-07-06 | Paper |
On the CSP Dichotomy Conjecture
Computer Science – Theory and Applications | 2011-06-17 | Paper |
The complexity of global cardinality constraints
Logical Methods in Computer Science | 2010-12-20 | Paper |
| Complexity of the counting constraint satisfaction problem | 2010-05-27 | Paper |
An algebraic approach to multi-sorted constraints
Lecture Notes in Computer Science | 2010-03-02 | Paper |
The complexity of constraint satisfaction games and QCSP
Information and Computation | 2009-09-14 | Paper |
The complexity of weighted Boolean \#CSP with mixed signs
Theoretical Computer Science | 2009-09-10 | Paper |
Affine systems of equations and counting infinitary logic
Theoretical Computer Science | 2009-04-29 | Paper |
Recent Results on the Algebraic Approach to the CSP
Complexity of Constraints | 2009-01-22 | Paper |
Dualities for Constraint Satisfaction Problems
Complexity of Constraints | 2009-01-22 | Paper |
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM | 2008-12-21 | Paper |
The property of being polynomial for Mal’tsev constraint satisfaction problems
Algebra and Logic | 2008-12-18 | Paper |
The Complexity of the Counting Constraint Satisfaction Problem
Automata, Languages and Programming | 2008-08-28 | Paper |
On the Power of k-Consistency
Automata, Languages and Programming | 2007-11-28 | Paper |
Affine Systems of Equations and Counting Infinitary Logic
Automata, Languages and Programming | 2007-11-28 | Paper |
Learning intersection-closed classes with signatures
Theoretical Computer Science | 2007-09-18 | Paper |
Efficiency of Local Search
Lecture Notes in Computer Science | 2007-09-04 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2007-06-21 | Paper |
Towards a dichotomy theorem for the counting constraint satisfaction problem
Information and Computation | 2007-05-14 | Paper |
| Three-element Mal'tsev algebras | 2007-01-02 | Paper |
Combinatorial problems raised from 2-semilattices
Journal of Algebra | 2006-07-12 | Paper |
A Simple Algorithm for Mal'tsev Constraints
SIAM Journal on Computing | 2006-06-01 | Paper |
\(H\)-coloring dichotomy revisited
Theoretical Computer Science | 2006-03-20 | Paper |
| The complexity of constraint satisfaction: an algebraic approach | 2006-02-13 | Paper |
The complexity of partition functions
Theoretical Computer Science | 2006-01-09 | Paper |
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing | 2005-09-16 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Algorithmic Learning Theory
Lecture Notes in Computer Science | 2005-08-18 | Paper |
Conditions satisfied by clone lattices.
Algebra Universalis | 2005-04-19 | Paper |
| scientific article; zbMATH DE number 1944123 (Why is no real title available?) | 2004-01-04 | Paper |
Polynomial Clones Containing the Mal'tsev Operation of the Groups {\open Z}_{p^{2}} and {\open Z}_p \times {\open Z}_p
Multiple-Valued Logic | 2003-11-02 | Paper |
Counting Mal'tsev clones on small sets
Discrete Mathematics | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1775540 (Why is no real title available?) | 2002-08-04 | Paper |
| On the number of finite Mal'tsev algebras | 2001-12-18 | Paper |
| scientific article; zbMATH DE number 1670830 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1512756 (Why is no real title available?) | 2001-10-30 | Paper |
Abstract properties of the class of intervals in the lattices of closed classes
Discrete Mathematics and Applications | 2001-04-17 | Paper |
| scientific article; zbMATH DE number 1356220 (Why is no real title available?) | 2000-01-25 | Paper |
| scientific article; zbMATH DE number 1354016 (Why is no real title available?) | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1234626 (Why is no real title available?) | 1999-04-11 | Paper |
| scientific article; zbMATH DE number 1176119 (Why is no real title available?) | 1998-07-19 | Paper |
Polynomial reducts of modules
Russian Mathematics | 1998-04-01 | Paper |
| scientific article; zbMATH DE number 742846 (Why is no real title available?) | 1995-04-11 | Paper |
Identities in the lattices of closed classes
Discrete Mathematics and Applications | 1994-09-08 | Paper |
