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.
72 Publications
2019 | Conference Paper | IST-REx-ID: 6725 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V. 2019. Testing the complexity of a valued CSP language. 46th International Colloquium on Automata, Languages and Programming. ICALP 2019: International Colloquim on Automata, Languages and Programming, LIPIcs, vol. 132, 77:1-77:12.
[Published Version]
View
| Files available
| DOI
| arXiv
2019 | Journal Article | IST-REx-ID: 6596 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Shehu Y. 2019. Convergence results of forward-backward algorithms for sum of monotone operators in Banach spaces. Results in Mathematics. 74(4), 138.
[Published Version]
View
| Files available
| DOI
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 7000 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Shehu Y, Iyiola OS, Li X-H, Dong Q-L. 2019. Convergence analysis of projection method for variational inequalities. Computational and Applied Mathematics. 38(4), 161.
[Published Version]
View
| DOI
| Download Published Version (ext.)
| WoS
| arXiv
2019 | Journal Article | IST-REx-ID: 7412 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Achlioptas D, Iliopoulos F, Kolmogorov V. 2019. A local lemma for focused stochastical algorithms. SIAM Journal on Computing. 48(5), 1583–1602.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 7468 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Swoboda P, Kolmogorov V. 2019. Map inference via block-coordinate Frank-Wolfe algorithm. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition vol. 2019–June, 11138–11147.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2019 | Conference Paper | IST-REx-ID: 7639
Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. 2019. Function norms for neural networks. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 748–752.
View
| DOI
| WoS
2018 | Journal Article | IST-REx-ID: 703 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Shekhovtsov A, Swoboda P, Savchynskyy B. 2018. Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(7), 1668–1682.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Book Chapter | IST-REx-ID: 10864 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kazda A, Kozik M, McKenzie R, Moore M. 2018.Absorption and directed Jónsson terms. In: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science. vol. 16, 203–220.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 273 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Mohapatra P, Rolinek M, Jawahar CV, Kolmogorov V, Kumar MP. 2018. Efficient optimization for rank-based loss functions. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 3693–3701.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 193 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alwen JF, Gazi P, Kamath Hosdurg C, Klein K, Osang GF, Pietrzak KZ, Reyzin L, Rolinek M, Rybar M. 2018. On the memory hardness of data independent password hashing functions. Proceedings of the 2018 on Asia Conference on Computer and Communication Security. ASIACCS: Asia Conference on Computer and Communications Security , 51–65.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 | Journal Article | IST-REx-ID: 5975 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V. 2018. Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. 47(6), 2029–2056.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Conference Paper | IST-REx-ID: 5978 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Haller S, Swoboda P, Savchynskyy B. 2018. Exact MAP-inference by confining combinatorial search with LP relaxation. Proceedings of the 32st AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence, 6581–6588.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 18 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V, Rolinek M. 2018. Superconcentrators of density 25.3. Ars Combinatoria. 141(10), 269–304.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2018 | Journal Article | IST-REx-ID: 6032 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kazda A, Kolmogorov V, Rolinek M. 2018. Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. 15(2), 22.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2017 | Journal Article | IST-REx-ID: 644 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V, Krokhin A, Rolinek M. 2017. The complexity of general-valued CSPs. SIAM Journal on Computing. 46(3), 1087–1110.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2017 | Conference Paper | IST-REx-ID: 646 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kuske J, Swoboda P, Petra S. 2017. A novel convex relaxation for non binary discrete tomography. SSVM: Scale Space and Variational Methods in Computer Vision, LNCS, vol. 10302, 235–246.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 | Thesis | IST-REx-ID: 992 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Rolinek M. 2017. Complexity of constraint satisfaction. Institute of Science and Technology Austria.
[Published Version]
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 1192 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kazda A, Kolmogorov V, Rolinek M. 2017. Even delta-matroids and the complexity of planar Boolean CSPs. SODA: Symposium on Discrete Algorithms, 307–326.
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2017 | Conference Paper | IST-REx-ID: 916 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. 2017. A study of lagrangean decompositions and dual ascent solvers for graph matching. CVPR: Computer Vision and Pattern Recognition vol. 2017, 7062–7071.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 915 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Swoboda P, Andres B. 2017. A message passing algorithm for the minimum cost multicut problem. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4990–4999.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 917 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Swoboda P, Kuske J, Savchynskyy B. 2017. A dual ascent framework for Lagrangean decomposition of combinatorial problems. CVPR: Computer Vision and Pattern Recognition vol. 2017, 4950–4960.
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 | Conference Paper | IST-REx-ID: 274 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V. 2017. A faster approximation algorithm for the Gibbs partition function. Proceedings of the 31st Conference On Learning Theory. COLT: Annual Conference on Learning Theory vol. 75, 228–249.
[Published Version]
View
| Files available
| arXiv
2016 | Conference Paper | IST-REx-ID: 1231 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. 2016. On the complexity of scrypt and proofs of space in the parallel random oracle model. EUROCRYPT: Theory and Applications of Cryptographic Techniques, LNCS, vol. 9666, 358–387.
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2016 | Journal Article | IST-REx-ID: 1353 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Barto L, Kazda A. 2016. Deciding absorption. International Journal of Algebra and Computation. 26(5), 1033–1060.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Journal Article | IST-REx-ID: 1377 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V, Pock T, Rolinek M. 2016. Total variation on a tree. SIAM Journal on Imaging Sciences. 9(2), 605–636.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Journal Article | IST-REx-ID: 1612 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kazda A. 2016. CSP for binary conservative relational structures. Algebra Universalis. 75(1), 75–84.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 | Conference Paper | IST-REx-ID: 1193 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V. 2016. Commutativity in the algorithmic Lovasz local lemma. Proceedings - Annual IEEE Symposium on Foundations of Computer Science. FOCS: Foundations of Computer Science vol. 2016–December, 7782993.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Journal Article | IST-REx-ID: 1794 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V, Takhanov R. 2016. Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. 76(1), 17–46.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 1636 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions for hybrid CSPs. 26th International Symposium. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 9472, 566–577.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Journal Article | IST-REx-ID: 1841 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V. 2015. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 37(5), 919–930.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1859 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Shah N, Kolmogorov V, Lampert C. 2015. A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle. CVPR: Computer Vision and Pattern Recognition, 2737–2745.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2015 | Journal Article | IST-REx-ID: 2271 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V, Thapper J, Živný S. 2015. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 44(1), 1–36.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Conference Paper | IST-REx-ID: 1637 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V, Krokhin A, Rolinek M. 2015. The complexity of general-valued CSPs. FOCS: Foundations of Computer Science, 56th Annual Symposium on Foundations of Computer Science, , 1246–1258.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Conference Paper | IST-REx-ID: 1675 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2015. Proofs of space. 35th Annual Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 9216, 585–605.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2014 | Conference Paper | IST-REx-ID: 2275 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Olsson C, Ulen J, Boykov Y, Kolmogorov V. 2014. Partial enumeration and curvature regularization. ICCV: International Conference on Computer Vision, 2936–2943.
[Submitted Version]
View
| Files available
| DOI
2014 | Working Paper | IST-REx-ID: 7038 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Huszár K, Rolinek M. Playful Math - An introduction to mathematical games, IST Austria, 5p.
[Published Version]
View
| Files available
2013 | Conference Paper | IST-REx-ID: 2270 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. 2013. Optimal Coalition Structures in Cooperative Graph Games. AAAI: Conference on Artificial Intelligence, 81–87.
View
| Download None (ext.)
| arXiv
2013 | Report | IST-REx-ID: 2273 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V. 2013. Reweighted message passing revisited, IST Austria,p.
View
| Download (ext.)
2013 | Conference Paper | IST-REx-ID: 2276 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Gridchyn I, Kolmogorov V. 2013. Potts model, parametric maxflow and k-submodular functions. ICCV: International Conference on Computer Vision, 2320–2327.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Conference Paper | IST-REx-ID: 2518 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V. 2013. The power of linear programming for finite-valued CSPs: A constructive characterization. ICALP: Automata, Languages and Programming, LNCS, vol. 7965, 625–636.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Journal Article | IST-REx-ID: 2828 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V, Živný S. 2013. The complexity of conservative valued CSPs. Journal of the ACM. 60(2), 10.
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Conference Paper | IST-REx-ID: 2901 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Chen C, Kolmogorov V, Yan Z, Metaxas D, Lampert C. 2013. Computing the M most probable modes of a graphical model. AISTATS: Conference on Uncertainty in Artificial Intelligence, JMLR: W&CP, vol. 31, 161–169.
View
| Download None (ext.)
2013 | Conference Paper | IST-REx-ID: 2272 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Takhanov R, Kolmogorov V. 2013. Inference algorithms for pattern-based CRFs on sequence data. ICML’13 Proceedings of the 30th International Conference on International. ICML: International Conference on Machine Learning, JMLR, vol. 28, 145–153.
[Submitted Version]
View
| Files available
| Download Submitted Version (ext.)
2013 | Report | IST-REx-ID: 2274 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2013. Proofs of Space, IST Austria,p.
[Published Version]
View
| Files available
2012 | Conference Paper | IST-REx-ID: 2930 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO: International Symposium on Combinatorial Optimization, LNCS, vol. 7422, 451–462.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Preprint | IST-REx-ID: 2928 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V, Schoenemann T. 2012. Generalized sequential tree-reweighted message passing. arXiv, .
[Preprint]
View
| Download Preprint (ext.)
| arXiv
2012 | Journal Article | IST-REx-ID: 3117 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V. 2012. Minimizing a sum of submodular functions. Discrete Applied Mathematics. 160(15), 2246–2258.
[Preprint]
View
| DOI
| Download Preprint (ext.)
2012 | Journal Article | IST-REx-ID: 3257 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Kolmogorov V. 2012. Generalized roof duality and bisubmodular functions. Discrete Applied Mathematics. 160(4–5), 416–426.
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2012 | Conference Paper | IST-REx-ID: 3124 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization. ICML: International Conference on Machine Learning, Inferning 2012, .
[Submitted Version]
View
| Files available
2012 | Technical Report | IST-REx-ID: 5396 |
![Open access file OA](https://research-explorer.ista.ac.at/images/access_open.png)
Korc F, Kolmogorov V, Lampert C. 2012. Approximating marginals using discrete energy minimization, IST Austria, 13p.
[Published Version]
View
| Files available
| DOI