default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDmitriy Zhuk
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Libor Barto, Zarathustra Brady, Andrei Bulatov
, Marcin Kozik, Dmitriy Zhuk:
Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras. TheoretiCS 3 (2024)- [i16]Dmitriy Zhuk:
A simplified proof of the CSP Dichotomy Conjecture and XY-symmetric operations. CoRR abs/2404.01080 (2024) - [i15]Dmitriy Zhuk:
Π2P vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem. CoRR abs/2404.03844 (2024) - 2023
- [j9]Manuel Bodirsky, Albert Vucaj, Dmitriy Zhuk:
The lattice of clones of self-dual operations collapsed. Int. J. Algebra Comput. 33(4): 717-749 (2023) - [j8]Catarina Carvalho, Florent R. Madelaine, Barnaby Martin, Dmitriy Zhuk:
The Complexity of Quantified Constraints: Collapsibility, Switchability, and the Algebraic Formulation. ACM Trans. Comput. Log. 24(1): 5:1-5:26 (2023) - [c10]Dmitriy Zhuk, Barnaby Martin, Michal Wrona:
The complete classification for quantified equality constraints. SODA 2023: 2746-2760 - 2022
- [j7]Dmitriy Zhuk, Barnaby Martin:
QCSP Monsters and the Demise of the Chen Conjecture. J. ACM 69(5): 35:1-35:44 (2022) - [j6]Alexandr Kazda, Peter Mayr, Dmitriy Zhuk:
Small Promise CSPs that reduce to large CSPs. Log. Methods Comput. Sci. 18(3) (2022) - 2021
- [j5]Dmitriy Zhuk:
Strong Subalgebras and the Constraint Satisfaction Problem. J. Multiple Valued Log. Soft Comput. 36(4-5): 455-504 (2021) - [c9]Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk:
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP. LICS 2021: 1-13 - [c8]Dmitriy Zhuk:
No-Rainbow Problem and the Surjective Constraint Satisfaction Problem. LICS 2021: 1-7 - [i14]Dmitriy Zhuk, Barnaby Martin:
The complete classification for quantified equality constraints. CoRR abs/2104.00406 (2021) - [i13]Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk:
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP. CoRR abs/2104.11808 (2021) - [i12]Catarina Carvalho, Florent R. Madelaine, Barnaby Martin, Dmitriy Zhuk:
The complexity of quantified constraints: collapsibility, switchability and the algebraic formulation. CoRR abs/2106.13154 (2021) - [i11]Alexandr Kazda, Peter Mayr, Dmitriy Zhuk:
Small PCSPs that reduce to large CSPs. CoRR abs/2109.07924 (2021) - [i10]Dmitriy Zhuk:
The complexity of the Quantified CSP having the polynomially generated powers property. CoRR abs/2110.09504 (2021) - 2020
- [j4]Dmitriy Zhuk:
A Proof of the CSP Dichotomy Conjecture. J. ACM 67(5): 30:1-30:78 (2020) - [c7]Dmitriy Zhuk, Barnaby Martin:
QCSP monsters and the demise of the chen conjecture. STOC 2020: 91-104 - [i9]Dmitriy Zhuk:
No-Rainbow Problem is NP-Hard. CoRR abs/2003.11764 (2020) - [i8]Dmitriy Zhuk:
Strong subalgebras and the Constraint Satisfaction Problem. CoRR abs/2005.00593 (2020)
2010 – 2019
- 2019
- [j3]Dmitriy Zhuk:
The size of generating sets of powers. J. Comb. Theory A 167: 91-103 (2019) - [j2]Mike Behrisch, Edith Vargas-García, Dmitriy Zhuk:
The Number of Clones Determined by Disjunctions of Unary Relations. Theory Comput. Syst. 63(6): 1298-1313 (2019) - [i7]Alexandr Kazda, Jakub Oprsal, Matt Valeriote, Dmitriy Zhuk:
Deciding the existence of minority terms. CoRR abs/1901.00316 (2019) - [i6]Alexandr Kazda, Dmitriy Zhuk:
Existence of cube terms in finite finitely generated clones. CoRR abs/1901.04975 (2019) - [i5]Dmitriy Zhuk, Barnaby Martin:
QCSP monsters and the demise of the Chen Conjecture. CoRR abs/1907.00239 (2019) - 2018
- [i4]Dmitriy Zhuk:
A modifiction of the CSP algorithm for infinite languages. CoRR abs/1803.07465 (2018) - 2017
- [c6]Dmitriy Zhuk:
A Proof of CSP Dichotomy Conjecture. FOCS 2017: 331-342 - [c5]Dmitriy Zhuk:
An Algorithm for Constraint Satisfaction Problem. ISMVL 2017: 1-6 - [c4]Catarina Carvalho, Barnaby Martin, Dmitriy Zhuk:
The Complexity of Quantified Constraints Using the Algebraic Formulation. MFCS 2017: 27:1-27:14 - [i3]Catarina Carvalho, Barnaby Martin, Dmitriy Zhuk:
The complexity of quantified constraints. CoRR abs/1701.04086 (2017) - [i2]Dmitriy Zhuk:
The Proof of CSP Dichotomy Conjecture. CoRR abs/1704.01914 (2017) - 2015
- [j1]Dmitriy Zhuk:
The Lattice of All Clones of Self-Dual Functions in Three-Valued Logic. J. Multiple Valued Log. Soft Comput. 24(1-4): 251-316 (2015) - [i1]Barnaby Martin, Dmitriy Zhuk:
Switchability and collapsibility of Gap Algebras. CoRR abs/1510.06298 (2015) - 2014
- [c3]Dmitriy Zhuk:
On Key Relations Preserved by a Weak Near-Unanimity Function. ISMVL 2014: 61-66 - 2013
- [c2]Dmitriy Zhuk, Stanislav Moiseev:
On the Clones Containing a Near-Unanimity Function. ISMVL 2013: 129-134 - 2011
- [c1]Dmitriy Zhuk:
The Lattice of the Clones of Self-Dual Functions in Three-Valued Logic. ISMVL 2011: 193-197
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-22 00:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
