معرفی
Michał Wrona is a Professor in the Department of Algorithmics at the Faculty of Mathematics and Computer Science, Jagiellonian University. His research focuses on constraint satisfaction problems (CSPs), computational complexity, universal algebra, and model theory, particularly concerning finite and omega-categorical structures. He holds a habilitation and has held postdoctoral positions at École Polytechnique (France) and Linköping University (Sweden). His current grant (2021–2026) investigates constraint satisfaction problems for infinite homogeneous structures.
- Education: M.Sc. in Computer Science (2004, University of Wrocław), Ph.D. in Mathematics (2009, University of Wrocław).
- Key Roles: Principal Investigator of the National Science Centre grant on infinite-domain CSPs.
His work bridges theoretical computer science and mathematical logic, addressing foundational questions in algorithmic complexity and constraint satisfaction. Notable contributions include advances in quantified CSPs, tractability frontiers, and symmetries in infinite-domain structures.
Research has been published in top venues like SIAM Journal on Computing, IEEE LICS, and ACM Transactions on Computational Logic. He actively contributes to the algorithmics research group and collaborates internationally on topics like universal algebra and computational complexity.
