Michael Pinsker

76 papers A* 14B 2Journal 56Unranked 4

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	An Algebraic Proof of the Dichotomy for Graph Orientation Problems with Forbidden Tournaments. SIAM J. Discret. Math. Roman Feller, Michael Pinsker
2026	J	`jnl`	Decidability of Interpretability. CoRR Roman Feller, Michael Pinsker
2026	J	`jnl`	On the Zariski Topology on endomorphism Monoids of omega-Categorical Structures. J. Symb. Log. Michael Pinsker, Clemens Schindler
2025	A*	`conf`	Binary symmetries of tractable non-rigid structures. LICS Paolo Marimon, Michael Pinsker
2025	A*	`conf`	Containment for Guarded Monotone Strict NP. ICALP Alexey Barsukov, Michael Pinsker, Jakub Rydval
2025	J	`jnl`	Janus-faces of temporal constraint languages: a dichotomy of expressivity. CoRR Johanna Brunar, Michael Pinsker, Moritz Schöbi
2025	J	`jnl`	New Sufficient Algebraic Conditions for Local Consistency over Homogeneous Structures of Finite Duality. CoRR Tomás Nagy, Michael Pinsker, Michal Wrona
2025	A*	`conf`	The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems. LICS Johanna Brunar, Marcin Kozik, Tomás Nagy, Michael Pinsker
2025	J	`jnl`	The sorrows of a smooth digraph: the first hardness criterion for infinite directed graph-colouring problems. CoRR Johanna Brunar, Marcin Kozik, Tomás Nagy, Michael Pinsker
2025	B	`conf`	Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction. MFCS Michael Pinsker, Jakub Rydval, Moritz Schöbi, Christoph Spiess
2025	J	`jnl`	Three meta-questions on infinite-domain Constraint Satisfaction Problems. CoRR Michael Pinsker, Jakub Rydval, Moritz Schöbi, Christoph Spiess
2024	A*	`conf`	An Order out of Nowhere: A New Algorithm for Infinite-Domain {CSP}s. ICALP Antoine Mottet, Tomás Nagy, Michael Pinsker
2024	J	`jnl`	An algebraic proof of the graph orientation problem dichotomy for forbidden tournaments. CoRR Roman Feller, Michael Pinsker
2024	J	`jnl`	Collapsing the Bounded Width Hierarchy for Infinite-Domain Constraint Satisfaction Problems: When Symmetries Are Enough. SIAM J. Comput. Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona
2024	J	`jnl`	Smooth approximations: An algebraic approach to CSPs over finitely bounded homogeneous structures. J. ACM Antoine Mottet, Michael Pinsker
2024	J	`jnl`	Strict width for Constraint Satisfaction Problems over homogeneous strucures of finite duality. CoRR Tomás Nagy, Michael Pinsker
2023	J	`jnl`	An order out of nowhere: a new algorithm for infinite-domain CSPs. CoRR Antoine Mottet, Michael Pinsker, Tomás Nagy
2023	A*	`conf`	Symmetries of Graphs and Structures that Fail to Interpret a Finite Thing. LICS Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker
2023	J	`jnl`	Symmetries of structures that fail to interpret something finite. CoRR Libor Barto, Bertalan Bodor, Marcin Kozik, Antoine Mottet, Michael Pinsker
2022	—	`conf`	Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep. ISMVL Michael Pinsker
2022	J	`jnl`	Current Challenges in Infinite-Domain Constraint Satisfaction: Dilemmas of the Infinite Sheep. CoRR Michael Pinsker
2022	A*	`conf`	Smooth approximations and CSPs over finitely bounded homogeneous structures. LICS Antoine Mottet, Michael Pinsker
2022	J	`jnl`	When Symmetries Are Not Enough: A Hierarchy of Hard Constraint Satisfaction Problems. SIAM J. Comput. Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker
2021	J	`jnl`	Canonical functions: a proof via topological dynamics. Contributions Discret. Math. Michael Pinsker, Manuel Bodirsky
2021	J	`jnl`	Cores over Ramsey Structures. J. Symb. Log. Antoine Mottet, Michael Pinsker
2021	J	`jnl`	Erratum: Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. J. Math. Log. Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker
2021	J	`jnl`	Projective clone Homomorphisms. J. Symb. Log. Manuel Bodirsky, Michael Pinsker, András Pongrácz
2021	A*	`conf`	Smooth Approximations and Relational Width Collapses. ICALP Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona
2021	J	`jnl`	Smooth Approximations and Relational Width Collapses. CoRR Antoine Mottet, Tomás Nagy, Michael Pinsker, Michal Wrona
2020	J	`jnl`	Cores over Ramsey structures. CoRR Antoine Mottet, Michael Pinsker
2020	A*	`conf`	Hrushovski's Encoding and ω-Categorical CSP Monsters. ICALP Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker
2020	J	`jnl`	Smooth approximations and CSPs over finitely bounded homogeneous structures. CoRR Antoine Mottet, Michael Pinsker
2020	J	`jnl`	Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems). SIAM J. Comput. Libor Barto, Michael Pinsker
2020	J	`jnl`	When symmetries are not enough: a hierarchy of hard Constraint Satisfaction Problems. CoRR Pierre Gillibert, Julius Jonusas, Michael Kompatscher, Antoine Mottet, Michael Pinsker
2020	J	`jnl`	ω-categorical structures avoiding height 1 identities. CoRR Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
2019	J	`jnl`	Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. SIAM J. Comput. Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz
2019	J	`jnl`	Equations in oligomorphic clones and the constraint satisfaction problem for ω-categorical structures. J. Math. Log. Libor Barto, Michael Kompatscher, Miroslav Olsák, Van Trung Pham, Michael Pinsker
2019	J	`jnl`	Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems). CoRR Libor Barto, Michael Pinsker
2019	A*	`conf`	Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). LICS Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
2019	J	`jnl`	Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). CoRR Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard
2018	J	`jnl`	Pseudo-loop conditions. CoRR Pierre Gillibert, Julius Jonusas, Michael Pinsker
2018	J	`jnl`	The universal homogeneous binary tree. J. Log. Comput. Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz
2017	A*	`conf`	The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems. LICS Libor Barto, Michael Kompatscher, Miroslav Olsák, Trung Van Pham, Michael Pinsker
2016	J	`jnl`	Canonical Functions: a proof via topological dynamics. CoRR Manuel Bodirsky, Michael Pinsker
2016	A*	`conf`	Constraint Satisfaction Problems for Reducts of Homogeneous Graphs. ICALP Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz
2016	J	`jnl`	Constraint satisfaction problems for reducts of homogeneous graphs. CoRR Manuel Bodirsky, Barnaby Martin, Michael Pinsker, András Pongrácz
2016	J	`jnl`	Distance constraint satisfaction problems. Inf. Comput. Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Antoine Mottet, Michael Pinsker
2016	J	`jnl`	Equations in oligomorphic clones and the Constraint Satisfaction Problem for $ω$-categorical structures. CoRR Libor Barto, Michael Kompatscher, Miroslav Olsák, Michael Pinsker, Van Trung Pham
2016	A*	`conf`	The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems. LICS Libor Barto, Michael Pinsker
2016	J	`jnl`	The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems. CoRR Libor Barto, Michael Pinsker
2015	J	`jnl`	Algebraic and model theoretic methods in constraint satisfaction. CoRR Michael Pinsker
2015	J	`jnl`	Permutations on the Random Permutation. Electron. J. Comb. Julie Linman, Michael Pinsker
2015	J	`jnl`	Schaefer's Theorem for Graphs. J. ACM Manuel Bodirsky, Michael Pinsker
2015	J	`jnl`	The wonderland of reflections. CoRR Libor Barto, Jakub Oprsal, Michael Pinsker
2014	J	`jnl`	Projective clone homomorphisms. CoRR Manuel Bodirsky, Michael Pinsker, András Pongrácz
2014	J	`jnl`	The universal homogeneous binary tree. CoRR Manuel Bodirsky, David Bradley-Williams, Michael Pinsker, András Pongrácz
2013	J	`jnl`	A Closed Algebra with a Non-Borel Clone and an Ideal with a Borel Clone. Int. J. Algebra Comput. Martin Goldstern, Michael Pinsker, Saharon Shelah
2013	J	`jnl`	A new operation on partially ordered sets. J. Comb. Theory A Péter Pál Pach, Michael Pinsker, András Pongrácz, Csaba A. Szabó
2013	J	`jnl`	Decidability of definability. J. Symb. Log. Manuel Bodirsky, Michael Pinsker, Todor Tsankov
2013	J	`jnl`	Reconstructing the topology of clones. CoRR Manuel Bodirsky, Michael Pinsker, András Pongrácz
2012	J	`jnl`	Topological Birkhoff CoRR Manuel Bodirsky, Michael Pinsker
2011	A*	`conf`	Decidability of Definability. LICS Manuel Bodirsky, Michael Pinsker, Todor Tsankov
2011	J	`jnl`	Reducts of Ramsey structures CoRR Manuel Bodirsky, Michael Pinsker
2011	A*	`conf`	Schaefer's theorem for graphs. STOC Manuel Bodirsky, Michael Pinsker
2010	J	`jnl`	Decidability of definability CoRR Manuel Bodirsky, Michael Pinsker, Todor Tsankov
2010	J	`jnl`	Distance Constraint Satisfaction Problems CoRR Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker
2010	B	`conf`	Distance Constraint Satisfaction Problems. MFCS Manuel Bodirsky, Víctor Dalmau, Barnaby Martin, Michael Pinsker
2010	J	`jnl`	More Sublattices of the Lattice of Local Clones. Order Michael Pinsker
2010	J	`jnl`	Schaefer's theorem for graphs CoRR Manuel Bodirsky, Michael Pinsker
2010	J	`jnl`	The reducts of equality up to primitive positive interdefinability. J. Symb. Log. Manuel Bodirsky, Hubie Chen, Michael Pinsker
2009	J	`jnl`	Clones from Ideals. Int. J. Algebra Comput. Mathias Beiglböck, Martin Goldstern, Lutz Heindorf, Michael Pinsker
2009	—	`conf`	Reducts of Ramsey Structures. AMS-ASL Joint Special Session Manuel Bodirsky, Michael Pinsker
2008	J	`jnl`	Monoidal intervals of clones on infinite sets. Discret. Math. Michael Pinsker
2007	—	`conf`	Polynomials as Generators of Minimal Clones. ISMVL Hajime Machida, Michael Pinsker
2007	J	`jnl`	Some Polynomials Generating Minimal Clones. J. Multiple Valued Log. Soft Comput. Hajime Machida, Michael Pinsker
2006	—	`conf`	Some Observations on Minimal Clones. ISMVL Hajime Machida, Michael Pinsker