Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.”10.1007/s10107-024-02064-5__Mathematical Programming, Springer Nature, 2024, doi:10.1007/s10107-024-02064-5.
LibreCat: https://research-explorer.ista.ac.at/record/10045
DOI: 10.1007/s10107-024-02064-5
arXiv: 2109.10203

Harris, David G., and Vladimir Kolmogorov. “Parameter Estimation for Gibbs Distributions.”10.4230/LIPIcs.ICALP.2023.72__50th International Colloquium on Automata, Languages, and Programming, vol. 261, 72, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.ICALP.2023.72.
LibreCat: https://research-explorer.ista.ac.at/record/14084
DOI: 10.4230/LIPIcs.ICALP.2023.72
arXiv: 2007.10824

Kolmogorov, Vladimir. “Solving Relaxations of MAP-MRF Problems: Combinatorial in-Face Frank-Wolfe Directions.”10.1109/CVPR52729.2023.01153__Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2023, IEEE, 2023, pp. 11980–89, doi:10.1109/CVPR52729.2023.01153.
LibreCat: https://research-explorer.ista.ac.at/record/14448
DOI: 10.1109/CVPR52729.2023.01153
arXiv: 2010.09567

Takhanov, Rustem, and Vladimir Kolmogorov. “Combining Pattern-Based CRFs and Weighted Context-Free Grammars.”10.3233/IDA-205623__Intelligent Data Analysis, vol. 26, no. 1, IOS Press, 2022, pp. 257–72, doi:10.3233/IDA-205623.
LibreCat: https://research-explorer.ista.ac.at/record/10737
DOI: 10.3233/IDA-205623
WoS: 000749997700015
arXiv: 1404.5475

Harris, David G., et al. “A New Notion of Commutativity for the Algorithmic Lovász Local Lemma.”10.4230/LIPIcs.APPROX/RANDOM.2021.31__Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, vol. 207, 31, Schloss Dagstuhl - Leibniz Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.APPROX/RANDOM.2021.31.
LibreCat: https://research-explorer.ista.ac.at/record/10072
DOI: 10.4230/LIPIcs.APPROX/RANDOM.2021.31
arXiv: 2008.05569

Kolmogorov, Vladimir, and Thomas Pock. “One-Sided Frank-Wolfe Algorithms for Saddle Problems.” 38th International Conference on Machine Learning, 2021.
LibreCat: https://research-explorer.ista.ac.at/record/10552
arXiv: 2101.12617

Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.”10.4230/LIPICS.ICALP.2019.77__46th International Colloquium on Automata, Languages and Programming, vol. 132, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019, p. 77:1-77:12, doi: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

Achlioptas, Dimitris, et al. “A Local Lemma for Focused Stochastical Algorithms.”10.1137/16m109332x__SIAM Journal on Computing, vol. 48, no. 5, SIAM, 2019, pp. 1583–602, doi: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.”10.1109/CVPR.2019.01140__Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2019–June, 11138–11147, IEEE, 2019, doi: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, et al. “Function Norms for Neural Networks.”10.1109/ICCVW.2019.00097__Proceedings of the 2019 International Conference on Computer Vision Workshop, 748–752, IEEE, 2019, doi:10.1109/ICCVW.2019.00097.
LibreCat: https://research-explorer.ista.ac.at/record/7639
DOI: 10.1109/ICCVW.2019.00097
WoS: 000554591600090

Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.”10.1109/cvpr.2018.00389__2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–701, doi: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

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

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

Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.”10.1145/3230649__ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649.
LibreCat: https://research-explorer.ista.ac.at/record/6032
DOI: 10.1145/3230649
WoS: 000468036500007
arXiv: 1602.03124

Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.”10.1137/16M1091836__SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
LibreCat: https://research-explorer.ista.ac.at/record/644
DOI: 10.1137/16M1091836

Kazda, Alexandr, et al. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SIAM, 2017, pp. 307–26, doi:10.1137/1.9781611974782.20.
LibreCat: https://research-explorer.ista.ac.at/record/1192
DOI: 10.1137/1.9781611974782.20
WoS: 000426965800020

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

Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi: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

Kolmogorov, Vladimir, et al. “Total Variation on a Tree.”10.1137/15M1010257__SIAM Journal on Imaging Sciences, vol. 9, no. 2, Society for Industrial and Applied Mathematics , 2016, pp. 605–36, doi:10.1137/15M1010257.
LibreCat: https://research-explorer.ista.ac.at/record/1377
DOI: 10.1137/15M1010257

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