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.




47 Publications

2019 | Journal Article | IST-REx-ID: 6596   OA
Shehu, Yekini. “Convergence Results of Forward-Backward Algorithms for Sum of Monotone Operators in Banach Spaces.” Results in Mathematics 74, no. 4 (2019): 138. https://doi.org/10.1007/s00025-019-1061-4.
View | Files available | DOI
 
2019 | Conference Paper | IST-REx-ID: 6725   OA
Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.” 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.
View | Files available | DOI | arXiv
 
2019 | Journal Article | IST-REx-ID: 6593   OA
Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.” Numerical Algorithms, 2019, 1–24. https://doi.org/10.1007/s11075-019-00758-y.
View | Files available | DOI
 
2019 | Journal Article | IST-REx-ID: 6032   OA
Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.” ACM Transactions on Algorithms 15, no. 2 (2019). https://doi.org/10.1145/3230649.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 193   OA
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.” In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018. https://doi.org/10.1145/3196494.3196534.
View | DOI | Download (ext.)
 
2018 | Conference Paper | IST-REx-ID: 5978
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, 2018.
View
 
2018 | Journal Article | IST-REx-ID: 18   OA
Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria 141, no. 10 (2018): 269–304.
View | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 5975   OA
Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.” SIAM Journal on Computing 47, no. 6 (2018): 2029–56. https://doi.org/10.1137/16m1093306.
View | Files available | DOI | Download (ext.) | arXiv
 
2018 | Journal Article | IST-REx-ID: 703   OA
Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.” IEEE Transactions on Pattern Analysis and Machine Intelligence 40, no. 7 (2018): 1668–82. https://doi.org/10.1109/TPAMI.2017.2730884.
View | DOI | Download (ext.) | arXiv
 
2018 | Conference Paper | IST-REx-ID: 273   OA
Mohapatra, Pritish, Michal Rolinek, C V Jawahar, Vladimir Kolmogorov, and M Pawan Kumar. “Efficient Optimization for Rank-Based Loss Functions.” In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 3693–3701. IEEE, 2018. https://doi.org/10.1109/cvpr.2018.00389.
View | DOI | Download (ext.) | arXiv
 
2017 | Conference Paper | IST-REx-ID: 1192   OA
Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs,” 307–26. SIAM, 2017. https://doi.org/10.1137/1.9781611974782.20.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 915   OA
Swoboda, Paul, and Bjoern Andres. “A Message Passing Algorithm for the Minimum Cost Multicut Problem,” 2017:4990–99. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.530.
View | Files available | DOI
 
2017 | Journal Article | IST-REx-ID: 644   OA
Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs.” SIAM Journal on Computing 46, no. 3 (2017): 1087–1110. https://doi.org/10.1137/16M1091836.
View | Files available | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 916   OA
Swoboda, Paul, Carsten Rother, Carsten Abu Alhaija, Dagmar Kainmueller, and Bogdan Savchynskyy. “A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching,” 2017:7062–71. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.747.
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 992   OA
Rolinek, Michal. Complexity of Constraint Satisfaction. IST Austria, 2017. https://doi.org/10.15479/AT:ISTA:th_815.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 917   OA
Swoboda, Paul, Jan Kuske, and Bogdan Savchynskyy. “ A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems,” 2017:4950–60. IEEE, 2017. https://doi.org/10.1109/CVPR.2017.526.
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 641
Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.” 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.
View | DOI
 
2017 | Conference Paper | IST-REx-ID: 646   OA
Kuske, Jan, Paul Swoboda, and Stefanie Petra. “A Novel Convex Relaxation for Non Binary Discrete Tomography.” 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.
View | DOI | Download (ext.)
 
2017 | Conference Paper | IST-REx-ID: 274   OA
Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function,” 1–17. Unknown, 2017.
View | Download (ext.)
 
2016 | Conference Paper | IST-REx-ID: 1231   OA
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,” 9666:358–87. Springer, 2016. https://doi.org/10.1007/978-3-662-49896-5_13.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1612   OA
Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.” Algebra Universalis 75, no. 1 (2016): 75–84. https://doi.org/10.1007/s00012-015-0358-8.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1794
Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” Algorithmica 76, no. 1 (2016): 17–46. https://doi.org/10.1007/s00453-015-0017-7.
View | Files available | DOI | Download (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1193
Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.” In Proceedings - Annual IEEE Symposium on Foundations of Computer Science, Vol. 2016–December. IEEE, 2016. https://doi.org/10.1109/FOCS.2016.88.
View | Files available | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1377   OA
Kolmogorov, Vladimir, Thomas Pock, and Michal Rolinek. “Total Variation on a Tree.” SIAM Journal on Imaging Sciences 9, no. 2 (2016): 605–36. https://doi.org/10.1137/15M1010257.
View | DOI | Download (ext.)
 
2016 | Journal Article | IST-REx-ID: 1353   OA
Barto, Libor, and Alexandr Kazda. “Deciding Absorption.” International Journal of Algebra and Computation 26, no. 5 (2016): 1033–60. https://doi.org/10.1142/S0218196716500430.
View | DOI | Download (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1636   OA
Kolmogorov, Vladimir, Michal Rolinek, and Rustem Takhanov. “Effectiveness of Structural Restrictions for Hybrid CSPs.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-48971-0_48.
View | DOI | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 1841   OA
Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.” IEEE Transactions on Pattern Analysis and Machine Intelligence 37, no. 5 (2015): 919–30. https://doi.org/10.1109/TPAMI.2014.2363465.
View | DOI | Download (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1637
Kolmogorov, Vladimir, Andrei Krokhin, and Michal Rolinek. “The Complexity of General-Valued CSPs,” 1246–58. IEEE, 2015. https://doi.org/10.1109/FOCS.2015.80.
View | Files available | DOI | Download (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1675
Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. “Proofs of Space.” Lecture Notes in Computer Science. Springer, 2015. https://doi.org/10.1007/978-3-662-48000-7_29.
View | Files available | DOI
 
2015 | Conference Paper | IST-REx-ID: 1859   OA
Shah, Neel, Vladimir Kolmogorov, and Christoph Lampert. “A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle,” 2737–45. IEEE, 2015. https://doi.org/10.1109/CVPR.2015.7298890.
View | DOI | Download (ext.)
 
2015 | Journal Article | IST-REx-ID: 2271
Kolmogorov, Vladimir, Johan Thapper, and Stanislav Živný. “The Power of Linear Programming for General-Valued CSPs.” SIAM Journal on Computing 44, no. 1 (2015): 1–36. https://doi.org/10.1137/130945648.
View | Files available | DOI | Download (ext.) | arXiv
 
2014 | Conference Paper | IST-REx-ID: 2275   OA
Olsson, Carl, Johannes Ulen, Yuri Boykov, and Vladimir Kolmogorov. “Partial Enumeration and Curvature Regularization,” 2936–43. IEEE, 2014. https://doi.org/10.1109/ICCV.2013.365.
View | Files available | DOI
 
2013 | Conference Paper | IST-REx-ID: 2272   OA
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. International Machine Learning Society, 2013.
View | Files available | Download (ext.)
 
2013 | Conference Paper | IST-REx-ID: 2518   OA
Kolmogorov, Vladimir. “The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization,” 7965:625–36. Springer, 2013. https://doi.org/10.1007/978-3-642-39206-1_53.
View | Files available | DOI | Download (ext.) | arXiv
 
2013 | Journal Article | IST-REx-ID: 2828   OA
Kolmogorov, Vladimir, and Stanislav Živný. “The Complexity of Conservative Valued CSPs.” Journal of the ACM 60, no. 2 (2013). https://doi.org/10.1145/2450142.2450146.
View | DOI | Download (ext.) | arXiv
 
2013 | Report | IST-REx-ID: 2273   OA
Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.
View | Download (ext.)
 
2013 | Conference Paper | IST-REx-ID: 2901   OA
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.
View | Download (ext.)
 
2013 | Report | IST-REx-ID: 2274   OA
Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. Proofs of Space. IST Austria, 2013.
View | Files available
 
2013 | Conference Paper | IST-REx-ID: 2270   OA
Bachrach, Yoram, Pushmeet Kohli, Vladimir Kolmogorov, and Morteza Zadimoghaddam. “Optimal Coalition Structures in Cooperative Graph Games,” 81–87. AAAI Press, 2013.
View | Download (ext.) | arXiv
 
2013 | Conference Paper | IST-REx-ID: 2276   OA
Gridchyn, Igor, and Vladimir Kolmogorov. “Potts Model, Parametric Maxflow and k-Submodular Functions,” 2320–27. IEEE, 2013. https://doi.org/10.1109/ICCV.2013.288.
View | DOI | Download (ext.) | arXiv
 
2012 | Journal Article | IST-REx-ID: 2931
Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “A Dual Decomposition Approach to Feature Correspondence.” IEEE Transactions on Pattern Analysis and Machine Intelligence 35, no. 2 (2012): 259–71. https://doi.org/10.1109/TPAMI.2012.105.
View | DOI
 
2012 | Journal Article | IST-REx-ID: 3117   OA
Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.” Discrete Applied Mathematics 160, no. 15 (2012): 2246–58. https://doi.org/10.1016/j.dam.2012.05.025.
View | DOI | Download (ext.)
 
2012 | Conference Paper | IST-REx-ID: 3124
Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. “Approximating Marginals Using Discrete Energy Minimization.” ICML, 2012.
View | Files available
 
2012 | Technical Report | IST-REx-ID: 5396   OA
Korc, Filip, Vladimir Kolmogorov, and Christoph Lampert. Approximating Marginals Using Discrete Energy Minimization. IST Austria, 2012. https://doi.org/10.15479/AT:IST-2012-0003.
View | Files available | DOI
 
2012 | Journal Article | IST-REx-ID: 3257   OA
Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.” Discrete Applied Mathematics 160, no. 4–5 (2012): 416–26. https://doi.org/10.1016/j.dam.2011.10.026.
View | Files available | DOI | Download (ext.) | arXiv
 
2012 | Conference Paper | IST-REx-ID: 2930   OA
Huber, Anna, and Vladimir Kolmogorov. “Towards Minimizing K-Submodular Functions,” 7422:451–62. Springer, 2012. https://doi.org/10.1007/978-3-642-32147-4_40.
View | DOI | Download (ext.)
 
2012 | Preprint | IST-REx-ID: 2928   OA
Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” ArXiv. ArXiv, 2012.
View | Download (ext.) | arXiv
 

Filters and Search Terms

type<>research_data

Search

Filter Publications

Display / Sort

Citation Style: Chicago

Export / Embed