Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.”https://doi.org/10.4230/LIPICS.ICALP.2019.77__In 46th International Colloquium on Automata, Languages and Programming, 132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.ICALP.2019.77 .
LibreCat: https://research-explorer.ista.ac.at/record/6725
DOI: 10.4230/LIPICS.ICALP.2019.77
arXiv: 1803.02289

Shehu, Yekini. “Convergence Results of Forward-Backward Algorithms for Sum of Monotone Operators in Banach Spaces.”https://doi.org/10.1007/s00025-019-1061-4__Results in Mathematics. Springer, 2019.https://doi.org/10.1007/s00025-019-1061-4 .
LibreCat: https://research-explorer.ista.ac.at/record/6596
DOI: 10.1007/s00025-019-1061-4
WoS: 000473237500002
arXiv: 2101.09068

Shehu, Yekini, Olaniyi S. Iyiola, Xiao-Huan Li, and Qiao-Li Dong. “Convergence Analysis of Projection Method for Variational Inequalities.”https://doi.org/10.1007/s40314-019-0955-9__Computational and Applied Mathematics. Springer Nature, 2019.https://doi.org/10.1007/s40314-019-0955-9 .
LibreCat: https://research-explorer.ista.ac.at/record/7000
DOI: 10.1007/s40314-019-0955-9
WoS: 000488973100005
arXiv: 2101.09081

Achlioptas, Dimitris, Fotis Iliopoulos, and Vladimir Kolmogorov. “A Local Lemma for Focused Stochastical Algorithms.”https://doi.org/10.1137/16m109332x__SIAM Journal on Computing. SIAM, 2019.https://doi.org/10.1137/16m109332x .
LibreCat: https://research-explorer.ista.ac.at/record/7412
DOI: 10.1137/16m109332x
WoS: 000493900200005
arXiv: 1809.01537

Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.”https://doi.org/10.1109/CVPR.2019.01140__In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Vol. 2019–June. IEEE, 2019.https://doi.org/10.1109/CVPR.2019.01140 .
LibreCat: https://research-explorer.ista.ac.at/record/7468
DOI: 10.1109/CVPR.2019.01140
WoS: 000542649304076
arXiv: 1806.05049

Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko. “Function Norms for Neural Networks.”https://doi.org/10.1109/ICCVW.2019.00097__In Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE, 2019.https://doi.org/10.1109/ICCVW.2019.00097 .
LibreCat: https://research-explorer.ista.ac.at/record/7639
DOI: 10.1109/ICCVW.2019.00097
WoS: 000554591600090

Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.”https://doi.org/10.1109/TPAMI.2017.2730884__IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018.https://doi.org/10.1109/TPAMI.2017.2730884 .
LibreCat: https://research-explorer.ista.ac.at/record/703
DOI: 10.1109/TPAMI.2017.2730884
arXiv: 1508.07902

Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption and Directed Jónsson Terms.”https://doi.org/10.1007/978-3-319-74772-9_7__In Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited by J Czelakowski, 16:203–20. OCTR. Cham: Springer Nature, 2018.https://doi.org/10.1007/978-3-319-74772-9_7 .
LibreCat: https://research-explorer.ista.ac.at/record/10864
DOI: 10.1007/978-3-319-74772-9_7
arXiv: 1502.01072

Mohapatra, Pritish, Michal Rolinek, C V Jawahar, Vladimir Kolmogorov, and M Pawan Kumar. “Efficient Optimization for Rank-Based Loss Functions.”https://doi.org/10.1109/cvpr.2018.00389__In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 3693–3701. IEEE, 2018.https://doi.org/10.1109/cvpr.2018.00389 .
LibreCat: https://research-explorer.ista.ac.at/record/273
DOI: 10.1109/cvpr.2018.00389
WoS: 000457843603087
arXiv: 1604.08269

Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar. “On the Memory Hardness of Data Independent Password Hashing Functions.”https://doi.org/10.1145/3196494.3196534__In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018.https://doi.org/10.1145/3196494.3196534 .
LibreCat: https://research-explorer.ista.ac.at/record/193
DOI: 10.1145/3196494.3196534
WoS: 000516620100005

Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”https://doi.org/10.1137/16m1093306__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics (SIAM), 2018.https://doi.org/10.1137/16m1093306 .
LibreCat: https://research-explorer.ista.ac.at/record/5975
DOI: 10.1137/16m1093306
WoS: 000453785100001
arXiv: 1506.08547

Haller, Stefan, Paul Swoboda, and Bogdan Savchynskyy. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” In Proceedings of the 32st AAAI Conference on Artificial Intelligence, 6581–88. AAAI Press, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/5978
WoS: 000485488906082
arXiv: 2004.06370

Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria. Charles Babbage Research Centre, 2018.
LibreCat: https://research-explorer.ista.ac.at/record/18
WoS: 000446809500022
arXiv: 1405.7828

Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.”https://doi.org/10.1145/3230649__ACM Transactions on Algorithms. ACM, 2018.https://doi.org/10.1145/3230649 .
LibreCat: https://research-explorer.ista.ac.at/record/6032
DOI: 10.1145/3230649
WoS: 000468036500007
arXiv: 1602.03124

Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.”https://doi.org/10.1007/978-3-319-58771-4_26__edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017.https://doi.org/10.1007/978-3-319-58771-4_26 .
LibreCat: https://research-explorer.ista.ac.at/record/641
DOI: 10.1007/978-3-319-58771-4_26

Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.”https://doi.org/10.1137/16M1091836__SIAM Journal on Computing. SIAM, 2017.https://doi.org/10.1137/16M1091836 .
LibreCat: https://research-explorer.ista.ac.at/record/644
DOI: 10.1137/16M1091836

Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.”https://doi.org/10.1007/978-3-319-58771-4_19__edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:235–46. Springer, 2017.https://doi.org/10.1007/978-3-319-58771-4_19 .
LibreCat: https://research-explorer.ista.ac.at/record/646
DOI: 10.1007/978-3-319-58771-4_19

Rolinek, Michal. “Complexity of Constraint Satisfaction.”https://doi.org/10.15479/AT:ISTA:th_815__Institute of Science and Technology Austria, 2017.https://doi.org/10.15479/AT:ISTA:th_815 .
LibreCat: https://research-explorer.ista.ac.at/record/992
DOI: 10.15479/AT:ISTA:th_815

Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,”https://doi.org/10.1137/1.9781611974782.20__307–26. SIAM, 2017.https://doi.org/10.1137/1.9781611974782.20 .
LibreCat: https://research-explorer.ista.ac.at/record/1192
DOI: 10.1137/1.9781611974782.20
WoS: 000426965800020

Swoboda, Paul, Carsten Rother, Carsten Abu Alhaija, Dagmar Kainmueller, and Bogdan Savchynskyy. “A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching,”https://doi.org/10.1109/CVPR.2017.747__2017:7062–71. IEEE, 2017.https://doi.org/10.1109/CVPR.2017.747 .
LibreCat: https://research-explorer.ista.ac.at/record/916
DOI: 10.1109/CVPR.2017.747
WoS: 000418371407018

Swoboda, Paul, and Bjoern Andres. “A Message Passing Algorithm for the Minimum Cost Multicut Problem,”https://doi.org/10.1109/CVPR.2017.530__2017:4990–99. IEEE, 2017.https://doi.org/10.1109/CVPR.2017.530 .
LibreCat: https://research-explorer.ista.ac.at/record/915
DOI: 10.1109/CVPR.2017.530
WoS: 000418371405009

Swoboda, Paul, Jan Kuske, and Bogdan Savchynskyy. “A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems,”https://doi.org/10.1109/CVPR.2017.526__2017:4950–60. IEEE, 2017.https://doi.org/10.1109/CVPR.2017.526 .
LibreCat: https://research-explorer.ista.ac.at/record/917
DOI: 10.1109/CVPR.2017.526
WoS: 000418371405005

Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function.” In Proceedings of the 31st Conference On Learning Theory, 75:228–49. ML Research Press, 2017.
LibreCat: https://research-explorer.ista.ac.at/record/274
arXiv: 1608.04223

Alwen, Joel F, Binyi Chen, Chethan Kamath Hosdurg, Vladimir Kolmogorov, Krzysztof Z Pietrzak, and Stefano Tessaro. “On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model,”https://doi.org/10.1007/978-3-662-49896-5_13__9666:358–87. Springer, 2016.https://doi.org/10.1007/978-3-662-49896-5_13 .
LibreCat: https://research-explorer.ista.ac.at/record/1231
DOI: 10.1007/978-3-662-49896-5_13

Barto, Libor, and Alexandr Kazda. “Deciding Absorption.”https://doi.org/10.1142/S0218196716500430__International Journal of Algebra and Computation. World Scientific Publishing, 2016.https://doi.org/10.1142/S0218196716500430 .
LibreCat: https://research-explorer.ista.ac.at/record/1353
DOI: 10.1142/S0218196716500430

Kolmogorov, Vladimir, Thomas Pock, and Michal Rolinek. “Total Variation on a Tree.”https://doi.org/10.1137/15M1010257__SIAM Journal on Imaging Sciences. Society for Industrial and Applied Mathematics , 2016.https://doi.org/10.1137/15M1010257 .
LibreCat: https://research-explorer.ista.ac.at/record/1377
DOI: 10.1137/15M1010257

Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.”https://doi.org/10.1007/s00012-015-0358-8__Algebra Universalis. Springer, 2016.https://doi.org/10.1007/s00012-015-0358-8 .
LibreCat: https://research-explorer.ista.ac.at/record/1612
DOI: 10.1007/s00012-015-0358-8

Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.”https://doi.org/10.1109/FOCS.2016.88__In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, Vol. 2016–December. IEEE, 2016.https://doi.org/10.1109/FOCS.2016.88 .
LibreCat: https://research-explorer.ista.ac.at/record/1193
DOI: 10.1109/FOCS.2016.88
arXiv: 1506.08547

Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.”https://doi.org/10.1007/s00453-015-0017-7__Algorithmica. Springer, 2016.https://doi.org/10.1007/s00453-015-0017-7 .
LibreCat: https://research-explorer.ista.ac.at/record/1794
DOI: 10.1007/s00453-015-0017-7
arXiv: 1210.0508

Kolmogorov, Vladimir, Michal Rolinek, and Rustem Takhanov. “Effectiveness of Structural Restrictions for Hybrid CSPs.”https://doi.org/10.1007/978-3-662-48971-0_48__In 26th International Symposium, 9472:566–77. Springer Nature, 2015.https://doi.org/10.1007/978-3-662-48971-0_48 .
LibreCat: https://research-explorer.ista.ac.at/record/1636
DOI: 10.1007/978-3-662-48971-0_48
arXiv: 1504.07067

Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.”https://doi.org/10.1109/TPAMI.2014.2363465__IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2015.https://doi.org/10.1109/TPAMI.2014.2363465 .
LibreCat: https://research-explorer.ista.ac.at/record/1841
DOI: 10.1109/TPAMI.2014.2363465

Shah, Neel, Vladimir Kolmogorov, and Christoph Lampert. “A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle,”https://doi.org/10.1109/CVPR.2015.7298890__2737–45. IEEE, 2015.https://doi.org/10.1109/CVPR.2015.7298890 .
LibreCat: https://research-explorer.ista.ac.at/record/1859
DOI: 10.1109/CVPR.2015.7298890

Kolmogorov, Vladimir, Johan Thapper, and Stanislav divný. “The Power of Linear Programming for General-Valued CSPs.”https://doi.org/10.1137/130945648__SIAM Journal on Computing. SIAM, 2015.https://doi.org/10.1137/130945648 .
LibreCat: https://research-explorer.ista.ac.at/record/2271
DOI: 10.1137/130945648
arXiv: 1311.4219

Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs,”https://doi.org/10.1109/FOCS.2015.80__1246–58. IEEE, 2015.https://doi.org/10.1109/FOCS.2015.80 .
LibreCat: https://research-explorer.ista.ac.at/record/1637
DOI: 10.1109/FOCS.2015.80

Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. “Proofs of Space.”https://doi.org/10.1007/978-3-662-48000-7_29__In 35th Annual Cryptology Conference, 9216:585–605. Springer, 2015.https://doi.org/10.1007/978-3-662-48000-7_29 .
LibreCat: https://research-explorer.ista.ac.at/record/1675
DOI: 10.1007/978-3-662-48000-7_29

Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial Enumeration and Curvature Regularization,”https://doi.org/10.1109/ICCV.2013.365__2936–43. IEEE, 2014.https://doi.org/10.1109/ICCV.2013.365 .
LibreCat: https://research-explorer.ista.ac.at/record/2275
DOI: 10.1109/ICCV.2013.365

Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction to Mathematical Games. IST Austria, n.d.
LibreCat: https://research-explorer.ista.ac.at/record/7038

Bachrach, Yoram, Pushmeet Kohli, Vladimir Kolmogorov, and Morteza Zadimoghaddam. “Optimal Coalition Structures in Cooperative Graph Games,” 81–87. AAAI Press, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2270
arXiv: 1108.5248

Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2273

Gridchyn, Igor, and Vladimir Kolmogorov. “Potts Model, Parametric Maxflow and k-Submodular Functions,”https://doi.org/10.1109/ICCV.2013.288__2320–27. IEEE, 2013.https://doi.org/10.1109/ICCV.2013.288 .
LibreCat: https://research-explorer.ista.ac.at/record/2276
DOI: 10.1109/ICCV.2013.288
arXiv: 1310.1771

Kolmogorov, Vladimir. “The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization,”https://doi.org/10.1007/978-3-642-39206-1_53__7965:625–36. Springer, 2013.https://doi.org/10.1007/978-3-642-39206-1_53 .
LibreCat: https://research-explorer.ista.ac.at/record/2518
DOI: 10.1007/978-3-642-39206-1_53
arXiv: 1207.7213

Kolmogorov, Vladimir, and Stanislav divný. “The Complexity of Conservative Valued CSPs.”https://doi.org/10.1145/2450142.2450146__Journal of the ACM. ACM, 2013.https://doi.org/10.1145/2450142.2450146 .
LibreCat: https://research-explorer.ista.ac.at/record/2828
DOI: 10.1145/2450142.2450146
arXiv: 1110.2809

Chen, Chao, Vladimir Kolmogorov, Zhu Yan, Dimitris Metaxas, and Christoph Lampert. “Computing the M Most Probable Modes of a Graphical Model,” 31:161–69. JMLR, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2901

Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” In ICML’13 Proceedings of the 30th International Conference on International, 28:145–53. ML Research Press, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2272

Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. Proofs of Space. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2274

Huber, Anna, and Vladimir Kolmogorov. “Towards Minimizing K-Submodular Functions,”https://doi.org/10.1007/978-3-642-32147-4_40__7422:451–62. Springer, 2012.https://doi.org/10.1007/978-3-642-32147-4_40 .
LibreCat: https://research-explorer.ista.ac.at/record/2930
DOI: 10.1007/978-3-642-32147-4_40

Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” ArXiv. ArXiv, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2928
arXiv: 1205.6352

Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “A Dual Decomposition Approach to Feature Correspondence.”https://doi.org/10.1109/TPAMI.2012.105__IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2012.https://doi.org/10.1109/TPAMI.2012.105 .
LibreCat: https://research-explorer.ista.ac.at/record/2931
DOI: 10.1109/TPAMI.2012.105

Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.”https://doi.org/10.1016/j.dam.2012.05.025__Discrete Applied Mathematics. Elsevier, 2012.https://doi.org/10.1016/j.dam.2012.05.025 .
LibreCat: https://research-explorer.ista.ac.at/record/3117
DOI: 10.1016/j.dam.2012.05.025

Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.”https://doi.org/10.1016/j.dam.2011.10.026__Discrete Applied Mathematics. Elsevier, 2012.https://doi.org/10.1016/j.dam.2011.10.026 .
LibreCat: https://research-explorer.ista.ac.at/record/3257
DOI: 10.1016/j.dam.2011.10.026
arXiv: 1005.2305