Michael Pinsker
Orcid: 0000-0002-4727-918XAffiliations:
- TU Wien, Vienna, Austria
According to our database1,
Michael Pinsker
authored at least 46 papers
between 2006 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
2006
2008
2010
2012
2014
2016
2018
2020
2022
2024
0
1
2
3
4
5
6
4
2
1
4
2
3
2
1
4
4
1
2
1
1
1
1
1
2
1
1
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures.
J. ACM, October, 2024
Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough.
SIAM J. Comput., 2024
An algebraic proof of the graph orientation problem dichotomy for forbidden tournaments.
CoRR, 2024
Strict width for Constraint Satisfaction Problems over homogeneous strucures of finite duality.
CoRR, 2024
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming, 2024
2023
Proceedings of the 38th Annual ACM/IEEE Symposium on Logic in Computer Science, 2023
2022
When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems.
SIAM J. Comput., 2022
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022
Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep.
Proceedings of the 52nd IEEE International Symposium on Multiple-Valued Logic, 2022
2021
Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures.
J. Math. Log., 2021
Contributions Discret. Math., 2021
Proceedings of the 48th International Colloquium on Automata, Languages, and Programming, 2021
2020
Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems).
SIAM J. Comput., 2020
Proceedings of the 47th International Colloquium on Automata, Languages, and Programming, 2020
2019
SIAM J. Comput., 2019
Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures.
J. Math. Log., 2019
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems).
CoRR, 2019
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems).
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019
2018
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
2016
The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems.
Proceedings of the 31st Annual ACM/IEEE Symposium on Logic in Computer Science, 2016
2015
2013
Int. J. Algebra Comput., 2013
2012
2010
J. Symb. Log., 2010
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010
2009
Reducts of Ramsey Structures.
Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009
2008
2007
J. Multiple Valued Log. Soft Comput., 2007
Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007
2006
Proceedings of the 36th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2006), 2006