Jakub Opršal

Cited by

	All	Since 2020
Citations	552	449
h-index	12	10
i10-index	13	12

140

105

201520162017201820192020202120222023202420253 1 13 30 39 59 67 58 102 133 29

Public access

View all

17 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Andrei KrokhinProfessor of Computer Science, Durham University, UKVerified email at durham.ac.uk
Michael PinskerTechnische Universität WienVerified email at tuwien.ac.at
Libor BartoDepartment of Algebra, Charles University, PragueVerified email at mff.cuni.cz
Victor DalmauDepartment of Information and Communication Technologies, Universitat Pompeu FabraVerified email at upf.edu
Jakub BulínCharles University in Prague, CzechiaVerified email at mff.cuni.cz
Ross WillardPure Mathematics, University of WaterlooVerified email at uwaterloo.ca
Antoine MottetTechnische Universität HamburgVerified email at tuhh.de
Manuel BodirskyTU Dresden, Institut für AlgebraVerified email at tu-dresden.de
Stanislav ŽivnýProfessor of Computer Science, University of OxfordVerified email at cs.ox.ac.uk
Marcin WrochnaInstitute of Informatics, University of WarsawVerified email at mimuw.edu.pl
Erhard AichingerAssociate Professor, Institute for Algebra, Johannes Kepler University Linz, Linz, AustriaVerified email at algebra.uni-linz.ac.at
Nebojša MudrinskiFull Professor, University of Novi SadVerified email at dmi.uns.ac.rs
Konstantin MakarychevNorthwestern UniversityVerified email at northwestern.edu
Yury MakarychevProfessor of Computer Science, Toyota Technological Institute at ChicagoVerified email at ttic.edu
Marcin KozikProfessor of Computer Science, Jagiellonian UniversityVerified email at uj.edu.pl
Balder ten CateAssociate ProfessorVerified email at uva.nl
Alexandr KazdaFreelance Data ScientistVerified email at karlin.mff.cuni.cz
Zhuk DmitriyCharles University, Lomonosov Moscow State UniversityVerified email at intsys.msu.ru
Tamio-Vesa NakajimaUniversity of OxfordVerified email at cs.ox.ac.uk
Gianluca TasinatoInstitute of Science and Technology AustriaVerified email at ist.ac.at

Jakub Opršal

University of Birmingham

Verified email at bham.ac.uk - Homepage

computational complexity constraint satisfaction universal algebra homotopy theory logic


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
The wonderland of reflections L Barto, J Opršal, M Pinsker Israel Journal of Mathematics 223 (1), 363-398, 2018	151	2018
Algebraic approach to promise constraint satisfaction L Barto, J Bulín, A Krokhin, J Opršal Journal of the ACM (JACM) 68 (4), 1-66, 2021	149	2021
Topology and adjunction in promise constraint satisfaction A Krokhin, J Opršal, M Wrochna, S Živný SIAM Journal on Computing 52 (1), 38-79, 2023	38	2023
The complexity of 3-colouring H-colourable graphs A Krokhin, J Opršal 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS …, 2019	27	2019
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems) M Bodirsky, A Mottet, M Olšák, J Opršal, M Pinsker, R Willard 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 1-12, 2019	24	2019
Local consistency as a reduction between constraint satisfaction problems V Dalmau, J Opršal 39th Annual ACM/IEEE Symposium on Logic in Computer Science, 29:1–15, 2024	19	2024
𝜔-categorical structures avoiding height 1 identities M Bodirsky, A Mottet, M Olšák, J Opršal, M Pinsker, R Willard Transactions of the American Mathematical Society 374 (1), 327-350, 2021	19	2021
Taylor’s modularity conjecture and related problems for idempotent varieties J Opršal Order 35 (3), 433-460, 2018	18	2018
A relational description of higher commutators in Mal’cev varieties J Opršal Algebra universalis 76 (3), 367-383, 2016	18	2016
An invitation to the promise constraint satisfaction problem A Krokhin, J Opršal ACM SIGLOG News 9 (3), 30-59, 2022	17*	2022
Complexity of term representations of finitary functions E Aichinger, N Mudrinski, J Opršal International Journal of Algebra and Computation 28 (06), 1101-1118, 2018	16	2018
Robust algorithms with polynomial loss for near-unanimity CSPs V Dalmau, M Kozik, A Krokhin, K Makarychev, Y Makarychev, J Opršal SIAM Journal on Computing 48 (6), 1763-1795, 2019	15	2019
Deciding the existence of minority terms A Kazda, J Opršal, M Valeriote, D Zhuk Canadian Mathematical Bulletin 63 (3), 577-591, 2020	12	2020
Distributive and anti-distributive Mendelsohn triple systems DM Donovan, TS Griggs, TA McCourt, J Opršal, D Stanovský Canadian Mathematical Bulletin 59 (1), 36-49, 2016	8	2016
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs M Filakovský, TV Nakajima, J Opršal, G Tasinato, U Wagner 41st International Symposium on Theoretical Aspects of Computer Science …, 2024	7	2024
Universal Lyndon Words A Carpi, G Fici, Š Holub, J Opršal, M Sciortino Mathematical Foundations of Computer Science 2014: 39th International …, 2014	4	2014
Right-Adjoints for Datalog Programs B ten Cate, V Dalmau, J Opršal 27th International Conference on Database Theory (ICDT 2024), 2024	3	2024
Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes B ten Cate, V Dalmau, J Opršal arXiv preprint arXiv:2302.06366, 2023	3	2023
Revisiting alphabet reduction in Dinur’s PCP V Guruswami, J Opršal, S Sandeep Approximation, Randomization, and Combinatorial Optimization. Algorithms and …, 2020	2	2020
A topological proof of the Hell-Nešetřil dichotomy S Meyer, J Opršal Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2025	1	2025

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors