Michael Kompatscher
Orcid: 0000-0002-0163-6604Affiliations:
- Charles University, Czech Republic
- TU Wien, Vienna, Austria (former)
According to our database1,
Michael Kompatscher
authored at least 18 papers
between 2017 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on zbmath.org
-
on orcid.org
-
on logic.at
On csauthors.net:
Bibliography
2024
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024
2023
Proceedings of the 48th International Symposium on Mathematical Foundations of Computer Science, 2023
2022
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems.
SIAM J. Comput., 2022
Log. Methods Comput. Sci., 2022
2021
Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures.
J. Math. Log., 2021
2020
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
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
Int. J. Algebra Comput., 2018
2017
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