Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Kompatscher
Person information
- affiliation: Charles University, Czech Republic
- affiliation (former): TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c6]Piotr Kawalek, Michael Kompatscher, Jacek Krzaczkowski:
Circuit Equivalence in 2-Nilpotent Algebras. STACS 2024: 45:1-45:17- [c5]Michael Kompatscher:
The Subpower Membership Problem of 2-Nilpotent Algebras. STACS 2024: 46:1-46:17 - 2023
- [c4]Jakub Bulín, Michael Kompatscher:
Short Definitions in Constraint Languages. MFCS 2023: 28:1-28:15 - [i12]Jakub Bulín, Michael Kompatscher:
Short definitions in constraint languages. CoRR abs/2305.01984 (2023) - [i11]Michael Kompatscher:
The subpower membership problem of 2-nilpotent algebras. CoRR abs/2309.16549 (2023) - 2022
- [j10]Alexandr Kazda
, Michael Kompatscher:
Local-global property for G-invariant terms. Int. J. Algebra Comput. 32(6): 1209-1231 (2022) - [j9]Michael Kompatscher:
CC-circuits and the expressive power of nilpotent algebras. Log. Methods Comput. Sci. 18(2) (2022) - [j8]Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker:
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems. SIAM J. Comput. 51(2): 175-213 (2022) - 2021
- [j7]Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk:
Completing graphs to metric spaces. Contributions Discret. Math. 16(2): 71-89 (2021) - [j6]Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker:
Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. J. Math. Log. 21(2): 2192001:1 (2021) - [i10]Michael Kompatscher:
CSAT and CEQV for nilpotent Maltsev algebras of Fitting length > 2. CoRR abs/2105.00689 (2021) - [i9]Alexandr Kazda, Michael Kompatscher:
The local-global property for G-invariant terms. CoRR abs/2109.02065 (2021) - 2020
- [c3]Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker:
Hrushovski's Encoding and ω-Categorical CSP Monsters. ICALP 2020: 131:1-131:17 - [i8]Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker:
When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems. CoRR abs/2002.07054 (2020)
2010 – 2019
- 2019
- [j5]Libor Barto, Michael Kompatscher, Miroslav Olsák, Van Trung Pham, Michael Pinsker:
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. J. Math. Log. 19(2): 1950010:1-1950010:31 (2019) - [i7]Piotr Kawalek, Michael Kompatscher, Jacek Krzaczkowski:
Circuit equivalence in 2-nilpotent algebras. CoRR abs/1909.12256 (2019) - [i6]Michael Kompatscher:
CC-circuits and the expressive power of nilpotent algebras. CoRR abs/1911.01479 (2019) - 2018
- [j4]Michael Kompatscher, Trung Van Pham:
A Complexity Dichotomy for Poset Constraint Satisfaction. FLAP 5(8): 1663-1696 (2018) - [j3]Michael Kompatscher:
The equation solvability problem over supernilpotent algebras with Mal'cev term. Int. J. Algebra Comput. 28(6): 1005-1015 (2018) - [j2]Lovkush Agarwal, Michael Kompatscher:
${2^{{\aleph _0}}}$ Pairwise nonisomorphic Maximal-closed Subgroups of Sym(ℕ) via the Classification of the Reducts of the Henson digraphs. J. Symb. Log. 83(2): 395-415 (2018) - [i5]Jan Hubicka, Michael Kompatscher, Matej Konecný:
Forbidden cycles in metrically homogeneous graphs. CoRR abs/1808.05177 (2018) - 2017
- [j1]Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk:
Completing graphs to metric spaces. Electron. Notes Discret. Math. 61: 53-60 (2017) - [c2]Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker:
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems. LICS 2017: 1-12 - [c1]Michael Kompatscher, Van Trung Pham:
A Complexity Dichotomy for Poset Constraint Satisfaction. STACS 2017: 47:1-47:12 - [i4]Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk:
Completing graphs to metric spaces. CoRR abs/1706.00295 (2017) - [i3]Andrés Aranda, David Bradley-Williams, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk:
Ramsey expansions of metrically homogeneous graphs. CoRR abs/1707.02612 (2017) - 2016
- [i2]Michael Kompatscher, Van Trung Pham:
A complexity dichotomy for poset constraint satisfaction. CoRR abs/1603.00082 (2016) - [i1]Libor Barto, Michael Kompatscher, Miroslav Olsák, Michael Pinsker, Van Trung Pham:
Equations in oligomorphic clones and the Constraint Satisfaction Problem for $ω$-categorical structures. CoRR abs/1612.07551 (2016)
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-03-13 00:24 CET 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:
