Please note that LibreCat no longer supports Internet Explorer versions 8 or 9 (or earlier).

We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.




60 Publications

2019 | Conference Paper | IST-REx-ID: 6725 | OA
Kolmogorov, V. (2019). Testing the complexity of a valued CSP language. In 46th International Colloquium on Automata, Languages and Programming (Vol. 132, p. 77:1-77:12). Patras, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPICS.ICALP.2019.77
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 7000 | OA
Shehu, Y., Iyiola, O. S., Li, X.-H., & Dong, Q.-L. (2019). Convergence analysis of projection method for variational inequalities. Computational and Applied Mathematics, 38(4). https://doi.org/10.1007/s40314-019-0955-9
View | DOI | Download Published Version (ext.)
 
2018 | Research Data | IST-REx-ID: 5573 | OA
Alhaija, H., Sellent, A., Kondermann, D., & Rother, C. (2018). Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. IST Austria. https://doi.org/10.15479/AT:ISTA:82
View | Files available | DOI
 
2018 | Journal Article | IST-REx-ID: 5975 | OA
Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing, 47(6), 2029–2056. https://doi.org/10.1137/16m1093306
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 6032 | OA
Kazda, A., Kolmogorov, V., & Rolinek, M. (2018). Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms, 15(2). https://doi.org/10.1145/3230649
View | Files available | DOI | Download Preprint (ext.) | arXiv
 

Search

Display / Sort

Citation Style: APA

Export / Embed