J. F. Alwen, B. Chen, C. Kamath Hosdurg, V. Kolmogorov, K. Z. Pietrzak, and S. Tessaro, “On the complexity of scrypt and proofs of space in the parallel random oracle model,” presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria, 2016, vol. 9666, pp. 358–387.
LibreCat: https://research-explorer.ista.ac.at/record/1231
DOI: 10.1007/978-3-662-49896-5_13

L. Barto and A. Kazda, “Deciding absorption,” International Journal of Algebra and Computation, vol. 26, no. 5. World Scientific Publishing, pp. 1033–1060, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1353
DOI: 10.1142/S0218196716500430

V. Kolmogorov, T. Pock, and M. Rolinek, “Total variation on a tree,” SIAM Journal on Imaging Sciences, vol. 9, no. 2. Society for Industrial and Applied Mathematics , pp. 605–636, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1377
DOI: 10.1137/15M1010257

A. Kazda, “CSP for binary conservative relational structures,” Algebra Universalis, vol. 75, no. 1. Springer, pp. 75–84, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1612
DOI: 10.1007/s00012-015-0358-8

V. Kolmogorov, “Commutativity in the algorithmic Lovasz local lemma,” in Proceedings - Annual IEEE Symposium on Foundations of Computer Science, New Brunswick, NJ, USA , 2016, vol. 2016–December.
LibreCat: https://research-explorer.ista.ac.at/record/1193
DOI: 10.1109/FOCS.2016.88
arXiv: 1506.08547

V. Kolmogorov and R. Takhanov, “Inference algorithms for pattern-based CRFs on sequence data,” Algorithmica, vol. 76, no. 1. Springer, pp. 17–46, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/1794
DOI: 10.1007/s00453-015-0017-7
arXiv: 1210.0508

P. Swoboda, “Synthetic discrete tomography problems.” Institute of Science and Technology Austria, 2016.
LibreCat: https://research-explorer.ista.ac.at/record/5557
DOI: 10.15479/AT:ISTA:46

V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions for hybrid CSPs,” in 26th International Symposium, Nagoya, Japan, 2015, vol. 9472, pp. 566–577.
LibreCat: https://research-explorer.ista.ac.at/record/1636
DOI: 10.1007/978-3-662-48971-0_48
arXiv: 1504.07067

V. Kolmogorov, “A new look at reweighted message passing,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5. IEEE, pp. 919–930, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/1841
DOI: 10.1109/TPAMI.2014.2363465

N. Shah, V. Kolmogorov, and C. Lampert, “A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle,” presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA, 2015, pp. 2737–2745.
LibreCat: https://research-explorer.ista.ac.at/record/1859
DOI: 10.1109/CVPR.2015.7298890

V. Kolmogorov, J. Thapper, and S. divný, “The power of linear programming for general-valued CSPs,” SIAM Journal on Computing, vol. 44, no. 1. SIAM, pp. 1–36, 2015.
LibreCat: https://research-explorer.ista.ac.at/record/2271
DOI: 10.1137/130945648
arXiv: 1311.4219

V. Kolmogorov, A. Krokhin, and M. Rolinek, “The complexity of general-valued CSPs,” presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States, 2015, pp. 1246–1258.
LibreCat: https://research-explorer.ista.ac.at/record/1637
DOI: 10.1109/FOCS.2015.80

S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, “Proofs of space,” in 35th Annual Cryptology Conference, Santa Barbara, CA, United States, 2015, vol. 9216, pp. 585–605.
LibreCat: https://research-explorer.ista.ac.at/record/1675
DOI: 10.1007/978-3-662-48000-7_29

C. Olsson, J. Ulen, Y. Boykov, and V. Kolmogorov, “Partial enumeration and curvature regularization,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2014, pp. 2936–2943.
LibreCat: https://research-explorer.ista.ac.at/record/2275
DOI: 10.1109/ICCV.2013.365

K. Huszár and M. Rolinek, Playful Math - An introduction to mathematical games. IST Austria.
LibreCat: https://research-explorer.ista.ac.at/record/7038

Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.
LibreCat: https://research-explorer.ista.ac.at/record/2270
arXiv: 1108.5248

V. Kolmogorov, Reweighted message passing revisited. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2273

I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.
LibreCat: https://research-explorer.ista.ac.at/record/2276
DOI: 10.1109/ICCV.2013.288
arXiv: 1310.1771

V. Kolmogorov, “The power of linear programming for finite-valued CSPs: A constructive characterization,” presented at the ICALP: Automata, Languages and Programming, Riga, Latvia, 2013, vol. 7965, no. 1, pp. 625–636.
LibreCat: https://research-explorer.ista.ac.at/record/2518
DOI: 10.1007/978-3-642-39206-1_53
arXiv: 1207.7213

V. Kolmogorov and S. divný, “The complexity of conservative valued CSPs,” Journal of the ACM, vol. 60, no. 2. ACM, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2828
DOI: 10.1145/2450142.2450146
arXiv: 1110.2809

C. Chen, V. Kolmogorov, Z. Yan, D. Metaxas, and C. Lampert, “Computing the M most probable modes of a graphical model,” presented at the  AISTATS: Conference on Uncertainty in Artificial Intelligence, Scottsdale, AZ, United States, 2013, vol. 31, pp. 161–169.
LibreCat: https://research-explorer.ista.ac.at/record/2901

R. Takhanov and V. Kolmogorov, “Inference algorithms for pattern-based CRFs on sequence data,” in ICML’13 Proceedings of the 30th International Conference on International, Atlanta, GA, USA, 2013, vol. 28, no. 3, pp. 145–153.
LibreCat: https://research-explorer.ista.ac.at/record/2272

S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, Proofs of Space. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2274

A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.
LibreCat: https://research-explorer.ista.ac.at/record/2930
DOI: 10.1007/978-3-642-32147-4_40

V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” arXiv. ArXiv, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2928
arXiv: 1205.6352

L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach to feature correspondence,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2. IEEE, pp. 259–271, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2931
DOI: 10.1109/TPAMI.2012.105

V. Kolmogorov, “Minimizing a sum of submodular functions,” Discrete Applied Mathematics, vol. 160, no. 15. Elsevier, pp. 2246–2258, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3117
DOI: 10.1016/j.dam.2012.05.025

V. Kolmogorov, “Generalized roof duality and bisubmodular functions,” Discrete Applied Mathematics, vol. 160, no. 4–5. Elsevier, pp. 416–426, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3257
DOI: 10.1016/j.dam.2011.10.026
arXiv: 1005.2305

F. Korc, V. Kolmogorov, and C. Lampert, “Approximating marginals using discrete energy minimization,” presented at the ICML: International Conference on Machine Learning, Edinburgh, Scotland, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3124

F. Korc, V. Kolmogorov, and C. Lampert, Approximating marginals using discrete energy minimization. IST Austria, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/5396
DOI: 10.15479/AT:IST-2012-0003