Michael Kompatscher

According to our database1, Michael Kompatscher authored at least 13 papers between 2017 and 2020.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems.
CoRR, 2020

Hrushovski's Encoding and ω-Categorical CSP Monsters.
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020

2019
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures.
J. Math. Log., 2019

CC-circuits and the expressive power of nilpotent algebras.
CoRR, 2019

Circuit equivalence in 2-nilpotent algebras.
CoRR, 2019

2018
${2^{{\aleph _0}}}$ Pairwise nonisomorphic Maximal-closed Subgroups of Sym(ℕ) via the Classification of the Reducts of the Henson digraphs.
J. Symb. Log., 2018

The equation solvability problem over supernilpotent algebras with Mal'cev term.
Int. J. Algebra Comput., 2018

A Complexity Dichotomy for Poset Constraint Satisfaction.
FLAP, 2018

Forbidden cycles in metrically homogeneous graphs.
CoRR, 2018

2017
Completing graphs to metric spaces.
Electron. Notes Discret. Math., 2017

Ramsey expansions of metrically homogeneous graphs.
CoRR, 2017

A Complexity Dichotomy for Poset Constraint Satisfaction.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems.
Proceedings of the 32nd Annual ACM/IEEE Symposium on Logic in Computer Science, 2017


  Loading...