Jakub Opršal

This page is a record of my research as a postdoc working on an ERC project of Manuel Bodirsky. My main focus was applications of universal algebra to complexity of infinite and promise CSP.

If you are interested in my current research go to https://community.dur.ac.uk/jakub.oprsal/

Preprints

My preprints on arXiv.

  • with Jakub Bulín, Andrei Krokhin, Algebraic approach to promise constraint satisfaction, preprint on arXiv.
  • with Víctor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Robust algorithms with polynomial loss for near-unanimity CSPs, preprint on arXiv.

JOURNAL Papers

Conference papers

  • with Víctor Dalmau, Marcin Kozik, Andrei Krokhin, Konstantin Makarychev, Yury Makarychev, Robust algorithms with polynomial loss for near-unanimity CSPs, Proceeding on 28th ACM-SIAM Symp. on Discrete Algorithms, doi:10.1137/1.9781611974782.22.
  • with A. Carpi, G. Fici Š. Holub, M. Sciortino, Universal Lyndon Words, MFCS 2014, LNCS, Vol. 8634, 2014, pp 135–146.

Conference talks

Zu dieser Seite

Jakub Oprsal
Letzte Änderung: 08.12.2018