default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJakub Oprsal
Person information
- affiliation: University of Birmingham, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Víctor Dalmau
, Andrei A. Krokhin, Jakub Oprsal:
Functors on Relational Structures Which Admit Both Left and Right Adjoints. SIAM J. Discret. Math. 38(3): 2041-2068 (2024)- [c9]Balder ten Cate, Víctor Dalmau, Jakub Oprsal:
Right-Adjoints for Datalog Programs. ICDT 2024: 10:1-10:20 - [c8]Víctor Dalmau, Jakub Oprsal:
Local consistency as a reduction between constraint satisfaction problems. LICS 2024: 29:1-29:15 - [c7]Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner:
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs. STACS 2024: 34:1-34:19 - [i19]Sebastian Meyer, Jakub Oprsal:
A topological proof of the Hell-Nešetřil dichotomy. CoRR abs/2409.12627 (2024) - 2023
- [j6]Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný:
Topology and Adjunction in Promise Constraint Satisfaction. SIAM J. Comput. 52(1): 38-79 (2023) - [i18]Victor Dalmau, Jakub Oprsal:
Local consistency as a reduction between constraint satisfaction problems. CoRR abs/2301.05084 (2023) - [i17]Balder ten Cate, Víctor Dalmau, Jakub Oprsal:
Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes. CoRR abs/2302.06366 (2023) - [i16]Víctor Dalmau, Andrei A. Krokhin, Jakub Oprsal:
Functors on relational structures which admit both left and right adjoints. CoRR abs/2302.13657 (2023) - [i15]Marek Filakovský, Tamio-Vesa Nakajima, Jakub Oprsal, Gianluca Tasinato, Uli Wagner:
Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. CoRR abs/2312.12981 (2023) - 2022
- [j5]Andrei A. Krokhin, Jakub Oprsal:
An invitation to the promise constraint satisfaction problem. ACM SIGLOG News 9(3): 30-59 (2022) - [i14]Andrei A. Krokhin, Jakub Oprsal:
An invitation to the promise constraint satisfaction problem. CoRR abs/2208.13538 (2022) - [i13]Andrei A. Krokhin, Jakub Oprsal:
An Invitation to the Promise Constraint Satisfaction Problem. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j4]Libor Barto, Jakub Bulín, Andrei A. Krokhin, Jakub Oprsal:
Algebraic Approach to Promise Constraint Satisfaction. J. ACM 68(4): 28:1-28:66 (2021) - 2020
- [c6]Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep:
Revisiting Alphabet Reduction in Dinur's PCP. APPROX-RANDOM 2020: 34:1-34:14 - [i12]Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný:
Topology and adjunction in promise constraint satisfaction. CoRR abs/2003.11351 (2020) - [i11]Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
ω-categorical structures avoiding height 1 identities. CoRR abs/2006.12254 (2020) - [i10]Andrei A. Krokhin, Jakub Oprsal, Marcin Wrochna, Stanislav Zivný:
Topology and adjunction in promise constraint satisfaction. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j3]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs. SIAM J. Comput. 48(6): 1763-1795 (2019) - [c5]Andrei A. Krokhin, Jakub Oprsal:
The Complexity of 3-Colouring H-Colourable Graphs. FOCS 2019: 1227-1239 - [c4]Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems). LICS 2019: 1-12 - [c3]Jakub Bulín, Andrei A. Krokhin, Jakub Oprsal:
Algebraic approach to promise constraint satisfaction. STOC 2019: 602-613 - [i9]Alexandr Kazda, Jakub Oprsal, Matt Valeriote, Dmitriy Zhuk:
Deciding the existence of minority terms. CoRR abs/1901.00316 (2019) - [i8]Manuel Bodirsky, Antoine Mottet, Miroslav Olsák, Jakub Oprsal, Michael Pinsker, Ross Willard:
Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems). CoRR abs/1901.04237 (2019) - [i7]Andrei A. Krokhin, Jakub Oprsal:
The complexity of 3-colouring H-colourable graphs. CoRR abs/1904.03214 (2019) - [i6]Venkatesan Guruswami, Jakub Oprsal, Sai Sandeep:
Revisiting Alphabet Reduction in Dinur's PCP. Electron. Colloquium Comput. Complex. TR19 (2019) - [i5]Andrei A. Krokhin, Jakub Oprsal:
The complexity of 3-colouring H-colourable graphs. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [j2]Erhard Aichinger, Nebojsa Mudrinski, Jakub Oprsal:
Complexity of term representations of finitary functions. Int. J. Algebra Comput. 28(6): 1101-1118 (2018) - [j1]Jakub Oprsal:
Taylor's Modularity Conjecture and Related Problems for Idempotent Varieties. Order 35(3): 433-460 (2018) - [i4]Jakub Bulín, Andrei A. Krokhin, Jakub Oprsal:
Algebraic approach to promise constraint satisfaction. CoRR abs/1811.00970 (2018) - 2017
- [c2]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust algorithms with polynomial loss for near-unanimity CSPs. SODA 2017: 340-357 - 2016
- [i3]Víctor Dalmau, Marcin Kozik, Andrei A. Krokhin, Konstantin Makarychev, Yury Makarychev, Jakub Oprsal:
Robust algorithms with polynomial loss for near-unanimity CSPs. CoRR abs/1607.04787 (2016) - 2015
- [i2]Libor Barto, Jakub Oprsal, Michael Pinsker:
The wonderland of reflections. CoRR abs/1510.04521 (2015) - 2014
- [c1]Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino:
Universal Lyndon Words. MFCS (1) 2014: 135-146 - [i1]Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino:
Universal Lyndon Words. CoRR abs/1406.5895 (2014)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-18 20:27 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
