Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
77 Publications
2020 | Published | Journal Article | IST-REx-ID: 6593 | 
Shehu Y, Li X-H, Dong Q-L. An efficient projection-type method for monotone variational inequalities in Hilbert spaces. Numerical Algorithms. 2020;84:365-388. doi:10.1007/s11075-019-00758-y
[Submitted Version]
View
| Files available
| DOI
| WoS
2020 | Published | Journal Article | IST-REx-ID: 7161 |
Shehu Y, Gibali A, Sagratella S. Inertial projection-type methods for solving quasi-variational inequalities in real Hilbert spaces. Journal of Optimization Theory and Applications. 2020;184:877–894. doi:10.1007/s10957-019-01616-6
[Submitted Version]
View
| Files available
| DOI
| WoS
2019 | Published | Journal Article | IST-REx-ID: 7412 |
Achlioptas D, Iliopoulos F, Kolmogorov V. A local lemma for focused stochastical algorithms. SIAM Journal on Computing. 2019;48(5):1583-1602. doi:10.1137/16m109332x
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 7468 |
Swoboda P, Kolmogorov V. Map inference via block-coordinate Frank-Wolfe algorithm. In: Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. Vol 2019-June. IEEE; 2019. doi:10.1109/CVPR.2019.01140
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 7639
Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. Function norms for neural networks. In: Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE; 2019. doi:10.1109/ICCVW.2019.00097
View
| DOI
| WoS
2019 | Published | Journal Article | IST-REx-ID: 6596 |
Shehu Y. Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces. Results in Mathematics. 2019;74(4). doi:10.1007/s00025-019-1061-4
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Published | Conference Paper | IST-REx-ID: 6725 |
Kolmogorov V. Testing the complexity of a valued CSP language. In: 46th International Colloquium on Automata, Languages and Programming. Vol 132. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2019:77:1-77:12. doi:10.4230/LIPICS.ICALP.2019.77
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Published | Journal Article | IST-REx-ID: 7000 |
Shehu Y, Iyiola OS, Li X-H, Dong Q-L. Convergence analysis of projection method for variational inequalities. Computational and Applied Mathematics. 2019;38(4). doi:10.1007/s40314-019-0955-9
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2018 | Published | Book Chapter | IST-REx-ID: 10864 |
Kazda A, Kozik M, McKenzie R, Moore M. Absorption and directed Jónsson terms. In: Czelakowski J, ed. Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science. Vol 16. OCTR. Cham: Springer Nature; 2018:203-220. doi:10.1007/978-3-319-74772-9_7
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 18 |
Kolmogorov V, Rolinek M. Superconcentrators of density 25.3. Ars Combinatoria. 2018;141(10):269-304.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 273 |
Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. Efficient optimization for rank-based loss functions. In: 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. IEEE; 2018:3693-3701. doi:10.1109/cvpr.2018.00389
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Research Data | IST-REx-ID: 5573 |
Alhaija H, Sellent A, Kondermann D, Rother C. Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. 2018. doi:10.15479/AT:ISTA:82
[Published Version]
View
| Files available
| DOI
2018 | Published | Journal Article | IST-REx-ID: 5975 |
Kolmogorov V. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 2018;47(6):2029-2056. doi:10.1137/16m1093306
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 5978 |
Haller S, Swoboda P, Savchynskyy B. Exact MAP-inference by confining combinatorial search with LP relaxation. In: Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI Press; 2018:6581-6588.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Journal Article | IST-REx-ID: 6032 |
Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 2018;15(2). doi:10.1145/3230649
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Published | Conference Paper | IST-REx-ID: 193 |
Alwen JF, Gazi P, Kamath Hosdurg C, et al. On the memory hardness of data independent password hashing functions. In: Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ACM; 2018:51-65. doi:10.1145/3196494.3196534
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 | Published | Journal Article | IST-REx-ID: 703 |
Shekhovtsov A, Swoboda P, Savchynskyy B. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2018;40(7):1668-1682. doi:10.1109/TPAMI.2017.2730884
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Published | Thesis | IST-REx-ID: 992 |
Rolinek M. Complexity of constraint satisfaction. 2017. doi:10.15479/AT:ISTA:th_815
[Published Version]
View
| Files available
| DOI
2017 | Published | Conference Paper | IST-REx-ID: 915 |
Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:10.1109/CVPR.2017.530
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Published | Conference Paper | IST-REx-ID: 916 |
Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol 2017. IEEE; 2017:7062-7071. doi:10.1109/CVPR.2017.747
[Submitted Version]
View
| Files available
| DOI
| WoS