Assistant Professor @ University of Birmingham
My work lies at the interface of mathematics and computer science. I study the computational complexity of constraint satisfaction problems and their approximation and promise variants using universal algebra, homotopy theory, category theory, and logic.
I was a post-doc at ISTA (2022–23) in Austria, Oxford (2021–2022) and Durham University (2018–2021) in the UK, at TU Dresden (2016–2018) in Germany, and at Jagiellonian University (2016) in Poland. I had a chance to work on two ERC grants: Standa Živný’s Starting Grant ‘PowAlgDO’ and Manuel Bodirsky’s Consolidator Grant ‘CSP-Infinity’.
I received my PhD at Charles University in Prague on 29 Feb 2016. My advisor was Libor Barto.
Meyer, S., & Opršal, J. (2024).
Accepted to SODA 2025!
Dalmau, V., & Opršal, J. (2024).
LICS 2024, 29:1–15.
doi:10.1145/3661814.3662068, arXiv:2301.05084v3.
Krokhin, A., Opršal, J., Wrochna, M., & Živný, S. (2023).
SIAM Journal on Computing, 52(1), 38–79.
doi:10.1137/20M1378223, arXiv:2003.11351,
Barto, L., Bulín, J., Krokhin, A., & Opršal, J. (2021).
J. ACM, 68(4), 28:1–66.