| Publication | Date of Publication | Type |
|---|
| Algebraic approach to approximation | 2025-06-18 | Paper |
Small Promise CSPs that reduce to large CSPs
Logical Methods in Computer Science | 2022-10-06 | Paper |
Local–global property for G-invariant terms
International Journal of Algebra and Computation | 2022-08-31 | Paper |
Deciding the existence of quasiweak near unanimity terms in finite algebras
(available as arXiv preprint) | 2022-06-03 | Paper |
| Deciding the existence of quasiweak near unanimity terms in finite algebras | 2022-06-03 | Paper |
The local-global property for G-invariant terms
(available as arXiv preprint) | 2021-09-05 | Paper |
Existence of cube terms in finite algebras
Algebra Universalis | 2021-02-09 | Paper |
DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS
Journal of Symbolic Logic | 2021-01-29 | Paper |
Deciding the existence of minority terms
Canadian Mathematical Bulletin | 2020-09-08 | Paper |
Deciding the existence of quasi weak near unanimity terms in finite algebras
(available as arXiv preprint) | 2020-02-14 | Paper |
Even delta-matroids and the complexity of planar Boolean CSPs
ACM Transactions on Algorithms | 2019-03-28 | Paper |
Taylor term does not imply any nontrivial linear one-equality Maltsev condition
Algebra Universalis | 2019-02-08 | Paper |
Representing real numbers in Möbius number systems
Actes des rencontres du CIRM | 2018-09-18 | Paper |
Even delta-matroids and the complexity of planar Boolean CSPs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
\(n\)-permutability and linear Datalog implies symmetric Datalog
(available as arXiv preprint) | 2018-05-30 | Paper |
Deciding absorption
International Journal of Algebra and Computation | 2016-09-23 | Paper |
CSP for binary conservative relational structures
Algebra Universalis | 2016-02-18 | Paper |
The word problem for free adequate semigroups.
International Journal of Algebra and Computation | 2014-12-12 | Paper |
Complexity of the homomorphism extension problem in the random case
Chicago Journal of Theoretical Computer Science | 2014-05-07 | Paper |
Möbius number systems
(available as arXiv preprint) | 2012-12-07 | Paper |
On continuous weighted finite automata
Linear Algebra and its Applications | 2012-04-19 | Paper |
Maltsev digraphs have a majority polymorphism
European Journal of Combinatorics | 2011-03-04 | Paper |
Möbius number systems based on interval covers
Nonlinearity | 2010-05-27 | Paper |
Convergence in Möbius Number Systems
INTEG | 2009-10-16 | Paper |
The chain relation in sofic subshifts
(available as arXiv preprint) | 2008-11-17 | Paper |
