Staff Profile
Dr Jakub Opršal
Post Doctoral Research Assistant in the Department of Computer Science
(email at jakub.oprsal@durham.ac.uk)
Selected Publications
Journal Article
- Bodirsky, Manuel, Mottet, Antoine, Olšák, Miroslav, Opršal, Jakub, Pinsker, Michael & Willard, Ross (2020). ω-categorical structures avoiding height 1 identities. Transactions of the American Mathematical Society 1.
- Kazda, Alexandr, Opršal, Jakub, Valeriote, Matt & Zhuk, Dmitriy (2020). Deciding the Existence of Minority Terms. Canadian Mathematical Bulletin 63(3): 577-591.
Conference Paper
- Guruswami, Venkatesan, Opršal, Jakub & Sandeep, Sai (2020), Revisiting Alphabet Reduction in Dinur’s PCP, in Byrka, Jarosław & Meka, Raghu eds, Leibniz International Proceedings in Informatics (LIPIcs) 176: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020). Schloss Dagstuhl – Leibniz-Zentrum fuer Informatik, 34:1–34:14.
- Krokhin, A. & Oprsal, J. (2020), The complexity of 3-colouring H-colourable graphs, in Zuckerman, D. eds, Foundations of Computer Science (FOCS). Baltimore, USA, IEEE, Piscataway, NJ, 1227-1239.
- Bulin, J., Krokhin, A. & Oprsal, J. (2019), Algebraic approach to promise constraint satisfaction, ACM Symposium on Theory of Computing (STOC). Phoenix, USA, ACM, New York, 602-613.
- Bodirsky, Manuel, Mottet, Antoine, Olsak, Miroslav, Oprsal, Jakub, Pinsker, Michael & Willard, Ross (2019), Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems), 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). Vancouver, Canada, 1.