Michal is a CUGS post-doctoral researcher at the Theoretical Computer Science Laboratory,
He graduated from and defended his Ph.D. thesis at the University of Wroclaw, Poland. Then, prior to coming to Linköping he worked at the Wroclaw University of Technology and spent four months as a visiting researcher at Ecole Polytechnique in Paris, France.
His research focuses on theoretical aspects of constraint satisfaction problems, that is, an area of theoretical computer science, which uses the methods of abstract algebra and model theory to study the complexity of computational problems. His work has been presented at theoretical computer science conferences such as Computer Science Logic and Mathematical Foundations of Computer Science.