Jakub Oprsal

Affiliations:
  • University of Birmingham, UK


According to our database1, Jakub Oprsal authored at least 21 papers between 2014 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform Hypergraphs.
Proceedings of the 41st International Symposium on Theoretical Aspects of Computer Science, 2024

Right-Adjoints for Datalog Programs.
Proceedings of the 27th International Conference on Database Theory, 2024

2023
Functors on relational structures which admit both left and right adjoints.
CoRR, 2023

Right-Adjoints for Datalog Programs, and Homomorphism Dualities over Restricted Classes.
CoRR, 2023

Local consistency as a reduction between constraint satisfaction problems.
CoRR, 2023

2022
An invitation to the promise constraint satisfaction problem.
ACM SIGLOG News, 2022

2021
Algebraic Approach to Promise Constraint Satisfaction.
J. ACM, 2021

2020
Topology and adjunction in promise constraint satisfaction.
Electron. Colloquium Comput. Complex., 2020

ω-categorical structures avoiding height 1 identities.
CoRR, 2020

2019
Robust Algorithms with Polynomial Loss for Near-Unanimity CSPs.
SIAM J. Comput., 2019

The complexity of 3-colouring <i>H</i>-colourable graphs.
Electron. Colloquium Comput. Complex., 2019

Revisiting Alphabet Reduction in Dinur's PCP.
Electron. Colloquium Comput. Complex., 2019

Topology is relevant (in the infinite-domain dichotomy conjecture for constraint satisfaction problems).
CoRR, 2019

Deciding the existence of minority terms.
CoRR, 2019

Algebraic approach to promise constraint satisfaction.
Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, 2019

Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems).
Proceedings of the 34th Annual ACM/IEEE Symposium on Logic in Computer Science, 2019

The Complexity of 3-Colouring H-Colourable Graphs.
Proceedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, 2019

2018
Taylor's Modularity Conjecture and Related Problems for Idempotent Varieties.
Order, 2018

Complexity of term representations of finitary functions.
Int. J. Algebra Comput., 2018

2015
The wonderland of reflections.
CoRR, 2015

2014
Universal Lyndon Words.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014


  Loading...