The Lattice of the Clones of Self-Dual Functions in Three-Valued Logic. - Dmitriy Zhuk (ISMVL, 2011)

On the Clones Containing a Near-Unanimity Function. - Dmitriy Zhuk; Stanislav Moiseev (ISMVL, 2013)

On Key Relations Preserved by a Weak Near-Unanimity Function. - Dmitriy Zhuk (ISMVL, 2014)

Switchability and collapsibility of Gap Algebras. - Barnaby Martin; Dmitriy Zhuk (CoRR, 2015)

The Lattice of All Clones of Self-Dual Functions in Three-Valued Logic. - Dmitriy Zhuk (J. Multiple Valued Log. Soft Comput., 2015)

An Algorithm for Constraint Satisfaction Problem. - Dmitriy Zhuk (ISMVL, 2017)

The Complexity of Quantified Constraints Using the Algebraic Formulation. - Catarina Carvalho; Barnaby Martin; Dmitriy Zhuk (MFCS, 2017)

The complexity of quantified constraints. - Catarina Carvalho; Barnaby Martin; Dmitriy Zhuk (CoRR, 2017)

A modifiction of the CSP algorithm for infinite languages. - Dmitriy Zhuk (CoRR, 2018)

Deciding the existence of minority terms. - Alexandr Kazda; Jakub Oprsal; Matt Valeriote; Dmitriy Zhuk (CoRR, 2019)

Existence of cube terms in finite finitely generated clones. - Alexandr Kazda; Dmitriy Zhuk (CoRR, 2019)

The size of generating sets of powers. - Dmitriy Zhuk (J. Comb. Theory A, 2019)

The Number of Clones Determined by Disjunctions of Unary Relations. - Mike Behrisch; Edith Vargas-García; Dmitriy Zhuk (Theory Comput. Syst., 2019)

No-Rainbow Problem is NP-Hard. - Dmitriy Zhuk (CoRR, 2020)

A Proof of the CSP Dichotomy Conjecture. - Dmitriy Zhuk (J. ACM, 2020)

Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP. - Libor Barto; Zarathustra Brady; Andrei Bulatov 001; Marcin Kozik; Dmitriy Zhuk (LICS, 2021)

No-Rainbow Problem and the Surjective Constraint Satisfaction Problem. - Dmitriy Zhuk (LICS, 2021)

The complete classification for quantified equality constraints. - Dmitriy Zhuk; Barnaby Martin (CoRR, 2021)

Small PCSPs that reduce to large CSPs. - Alexandr Kazda; Peter Mayr 001; Dmitriy Zhuk (CoRR, 2021)

The complexity of the Quantified CSP having the polynomially generated powers property. - Dmitriy Zhuk (CoRR, 2021)

Strong Subalgebras and the Constraint Satisfaction Problem. - Dmitriy Zhuk (J. Multiple Valued Log. Soft Comput., 2021)

QCSP Monsters and the Demise of the Chen Conjecture. - Dmitriy Zhuk; Barnaby Martin (J. ACM, 2022)

Small Promise CSPs that reduce to large CSPs. - Alexandr Kazda; Peter Mayr 001; Dmitriy Zhuk (Log. Methods Comput. Sci., 2022)

The complete classification for quantified equality constraints. - Dmitriy Zhuk; Barnaby Martin; Michal Wrona (SODA, 2023)

The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation. - Catarina Carvalho; Florent R. Madelaine; Barnaby Martin; Dmitriy Zhuk (ACM Trans. Comput. Log., 2023)

The lattice of clones of self-dual operations collapsed. - Manuel Bodirsky; Albert Vucaj; Dmitriy Zhuk (Int. J. Algebra Comput., 2023)

∏2P vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem. - Dmitriy Zhuk (FOCS, 2024)

A simplified proof of the CSP Dichotomy Conjecture and XY-symmetric operations. - Dmitriy Zhuk (CoRR, 2024)

Π2P vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem. - Dmitriy Zhuk (CoRR, 2024)

Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras. - Libor Barto; Zarathustra Brady; Andrei Bulatov 001; Marcin Kozik; Dmitriy Zhuk (TheoretiCS, 2024)