Testing the complexity of a valued CSP language
V. Kolmogorov, in:, 46th International Colloquium on Automata, Languages and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12.
LibreCat: https://research-explorer.ista.ac.at/record/6725
DOI: 10.4230/LIPICS.ICALP.2019.77
arXiv: 1803.02289

Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces
Y. Shehu, Results in Mathematics 74 (2019).
LibreCat: https://research-explorer.ista.ac.at/record/6596
DOI: 10.1007/s00025-019-1061-4
WoS: 000473237500002
arXiv: 2101.09068

Convergence analysis of projection method for variational inequalities
Y. Shehu, O.S. Iyiola, X.-H. Li, Q.-L. Dong, Computational and Applied Mathematics 38 (2019).
LibreCat: https://research-explorer.ista.ac.at/record/7000
DOI: 10.1007/s40314-019-0955-9
WoS: 000488973100005
arXiv: 2101.09081

A local lemma for focused stochastical algorithms
D. Achlioptas, F. Iliopoulos, V. Kolmogorov, SIAM Journal on Computing 48 (2019) 1583–1602.
LibreCat: https://research-explorer.ista.ac.at/record/7412
DOI: 10.1137/16m109332x
WoS: 000493900200005
arXiv: 1809.01537

Map inference via block-coordinate Frank-Wolfe algorithm
P. Swoboda, V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/7468
DOI: 10.1109/CVPR.2019.01140
WoS: 000542649304076
arXiv: 1806.05049

Function norms for neural networks
A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.
LibreCat: https://research-explorer.ista.ac.at/record/7639
DOI: 10.1109/ICCVW.2019.00097
WoS: 000554591600090

Maximum persistency via iterative relaxed inference with graphical models
A. Shekhovtsov, P. Swoboda, B. Savchynskyy, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1668–1682.
LibreCat: https://research-explorer.ista.ac.at/record/703
DOI: 10.1109/TPAMI.2017.2730884
arXiv: 1508.07902

Absorption and directed Jónsson terms
A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, Springer Nature, Cham, 2018, pp. 203–220.
LibreCat: https://research-explorer.ista.ac.at/record/10864
DOI: 10.1007/978-3-319-74772-9_7
arXiv: 1502.01072

Efficient optimization for rank-based loss functions
P. Mohapatra, M. Rolinek, C.V. Jawahar, V. Kolmogorov, M.P. Kumar, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–3701.
LibreCat: https://research-explorer.ista.ac.at/record/273
DOI: 10.1109/cvpr.2018.00389
WoS: 000457843603087
arXiv: 1604.08269

On the memory hardness of data independent password hashing functions
J.F. Alwen, P. Gazi, C. Kamath Hosdurg, K. Klein, G.F. Osang, K.Z. Pietrzak, L. Reyzin, M. Rolinek, M. Rybar, in:, Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65.
LibreCat: https://research-explorer.ista.ac.at/record/193
DOI: 10.1145/3196494.3196534
WoS: 000516620100005

Commutativity in the algorithmic Lovász local lemma
V. Kolmogorov, SIAM Journal on Computing 47 (2018) 2029–2056.
LibreCat: https://research-explorer.ista.ac.at/record/5975
DOI: 10.1137/16m1093306
WoS: 000453785100001
arXiv: 1506.08547

Exact MAP-inference by confining combinatorial search with LP relaxation
S. Haller, P. Swoboda, B. Savchynskyy, in:, Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–6588.
LibreCat: https://research-explorer.ista.ac.at/record/5978
WoS: 000485488906082
arXiv: 2004.06370

Superconcentrators of density 25.3
V. Kolmogorov, M. Rolinek, Ars Combinatoria 141 (2018) 269–304.
LibreCat: https://research-explorer.ista.ac.at/record/18
WoS: 000446809500022
arXiv: 1405.7828

Even delta-matroids and the complexity of planar boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, ACM Transactions on Algorithms 15 (2018).
LibreCat: https://research-explorer.ista.ac.at/record/6032
DOI: 10.1145/3230649
WoS: 000468036500007
arXiv: 1602.03124

Graphical model parameter learning by inverse linear programming
V. Trajkovska, P. Swoboda, F. Åström, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 323–334.
LibreCat: https://research-explorer.ista.ac.at/record/641
DOI: 10.1007/978-3-319-58771-4_26

The complexity of general-valued CSPs
V. Kolmogorov, A. Krokhin, M. Rolinek, SIAM Journal on Computing 46 (2017) 1087–1110.
LibreCat: https://research-explorer.ista.ac.at/record/644
DOI: 10.1137/16M1091836

A novel convex relaxation for non binary discrete tomography
J. Kuske, P. Swoboda, S. Petra, in:, F. Lauze, Y. Dong, A. Bjorholm Dahl (Eds.), Springer, 2017, pp. 235–246.
LibreCat: https://research-explorer.ista.ac.at/record/646
DOI: 10.1007/978-3-319-58771-4_19

Complexity of constraint satisfaction
M. Rolinek, Complexity of Constraint Satisfaction, Institute of Science and Technology Austria, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/992
DOI: 10.15479/AT:ISTA:th_815

Even delta-matroids and the complexity of planar Boolean CSPs
A. Kazda, V. Kolmogorov, M. Rolinek, in:, SIAM, 2017, pp. 307–326.
LibreCat: https://research-explorer.ista.ac.at/record/1192
DOI: 10.1137/1.9781611974782.20
WoS: 000426965800020

A study of lagrangean decompositions and dual ascent solvers for graph matching
P. Swoboda, C. Rother, C. Abu Alhaija, D. Kainmueller, B. Savchynskyy, in:, IEEE, 2017, pp. 7062–7071.
LibreCat: https://research-explorer.ista.ac.at/record/916
DOI: 10.1109/CVPR.2017.747
WoS: 000418371407018