Michael Pinsker

According to our database1, Michael Pinsker authored at least 35 papers between 2006 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:

On csauthors.net:


Topology Is Irrelevant (In a Dichotomy Conjecture for Infinite Domain Constraint Satisfaction Problems).
SIAM J. Comput., 2020

Smooth approximations and CSPs over finitely bounded homogeneous structures.
CoRR, 2020

ω-categorical structures avoiding height 1 identities.
CoRR, 2020

Cores over Ramsey structures.
CoRR, 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

Constraint Satisfaction Problems for Reducts of Homogeneous Graphs.
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

The universal homogeneous binary tree.
J. Log. Comput., 2018

Pseudo-loop conditions.
CoRR, 2018

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

Distance constraint satisfaction problems.
Inf. Comput., 2016

Canonical Functions: a proof via topological dynamics.
CoRR, 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

Schaefer's Theorem for Graphs.
J. ACM, 2015

Algebraic and model theoretic methods in constraint satisfaction.
CoRR, 2015

The wonderland of reflections.
CoRR, 2015

Permutations on the Random Permutation.
Electron. J. Comb., 2015

Projective clone homomorphisms.
CoRR, 2014

Decidability of definability.
J. Symb. Log., 2013

A new operation on partially ordered sets.
J. Comb. Theory, Ser. A, 2013

A Closed Algebra with a Non-Borel Clone and an Ideal with a Borel Clone.
Int. J. Algebra Comput., 2013

Reconstructing the topology of clones.
CoRR, 2013

Topological Birkhoff
CoRR, 2012

More Sublattices of the Lattice of Local Clones.
Order, 2010

The reducts of equality up to primitive positive interdefinability.
J. Symb. Log., 2010

Distance Constraint Satisfaction Problems.
Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Clones from Ideals.
Int. J. Algebra Comput., 2009

Reducts of Ramsey Structures.
Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009

Monoidal intervals of clones on infinite sets.
Discret. Math., 2008

Some Polynomials Generating Minimal Clones.
J. Multiple Valued Log. Soft Comput., 2007

Polynomials as Generators of Minimal Clones.
Proceedings of the 37th International Symposium on Multiple-Valued Logic, 2007

Some Observations on Minimal Clones.
Proceedings of the 36th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2006), 2006