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.
77 Publications
2016 | Published | Journal Article | IST-REx-ID: 1794 | 
Kolmogorov, V., & Takhanov, R. (2016). Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. Springer. https://doi.org/10.1007/s00453-015-0017-7
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2016 | Research Data | IST-REx-ID: 5557 |
Swoboda, P. (2016). Synthetic discrete tomography problems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:46
[Published Version]
View
| Files available
| DOI
2016 | Published | Conference Paper | IST-REx-ID: 1231 |
Alwen, J. F., Chen, B., Kamath Hosdurg, C., Kolmogorov, V., Pietrzak, K. Z., & Tessaro, S. (2016). On the complexity of scrypt and proofs of space in the parallel random oracle model (Vol. 9666, pp. 358–387). Presented at the EUROCRYPT: Theory and Applications of Cryptographic Techniques, Vienna, Austria: Springer. https://doi.org/10.1007/978-3-662-49896-5_13
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2016 | Published | Journal Article | IST-REx-ID: 1612 |
Kazda, A. (2016). CSP for binary conservative relational structures. Algebra Universalis. Springer. https://doi.org/10.1007/s00012-015-0358-8
[Preprint]
View
| DOI
| Download Preprint (ext.)
2015 | Published | Conference Paper | IST-REx-ID: 1637 |
Kolmogorov, V., Krokhin, A., & Rolinek, M. (2015). The complexity of general-valued CSPs (pp. 1246–1258). Presented at the FOCS: Foundations of Computer Science, Berkeley, CA, United States: IEEE. https://doi.org/10.1109/FOCS.2015.80
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Published | Conference Paper | IST-REx-ID: 1675 |
Dziembowski, S., Faust, S., Kolmogorov, V., & Pietrzak, K. Z. (2015). Proofs of space. In 35th Annual Cryptology Conference (Vol. 9216, pp. 585–605). Santa Barbara, CA, United States: Springer. https://doi.org/10.1007/978-3-662-48000-7_29
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2015 | Published | Journal Article | IST-REx-ID: 2271 |
Kolmogorov, V., Thapper, J., & Živný, S. (2015). The power of linear programming for general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/130945648
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Published | Conference Paper | IST-REx-ID: 1636 |
Kolmogorov, V., Rolinek, M., & Takhanov, R. (2015). Effectiveness of structural restrictions for hybrid CSPs. In 26th International Symposium (Vol. 9472, pp. 566–577). Nagoya, Japan: Springer Nature. https://doi.org/10.1007/978-3-662-48971-0_48
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2015 | Published | Journal Article | IST-REx-ID: 1841 |
Kolmogorov, V. (2015). A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2014.2363465
[Preprint]
View
| DOI
| Download Preprint (ext.)
2015 | Published | Conference Paper | IST-REx-ID: 1859 |
Shah, N., Kolmogorov, V., & Lampert, C. (2015). A multi-plane block-coordinate Frank-Wolfe algorithm for training structural SVMs with a costly max-oracle (pp. 2737–2745). Presented at the CVPR: Computer Vision and Pattern Recognition, Boston, MA, USA: IEEE. https://doi.org/10.1109/CVPR.2015.7298890
[Preprint]
View
| DOI
| Download Preprint (ext.)
2014 | Published | Conference Paper | IST-REx-ID: 2275 |
Olsson, C., Ulen, J., Boykov, Y., & Kolmogorov, V. (2014). Partial enumeration and curvature regularization (pp. 2936–2943). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.365
[Submitted Version]
View
| Files available
| DOI
2014 | Draft | Working Paper | IST-REx-ID: 7038 |
Huszár, K., & Rolinek, M. (n.d.). Playful Math - An introduction to mathematical games. IST Austria.
[Published Version]
View
| Files available
2013 | Published | Conference Paper | IST-REx-ID: 2270 |
Bachrach, Y., Kohli, P., Kolmogorov, V., & Zadimoghaddam, M. (2013). Optimal Coalition Structures in Cooperative Graph Games (pp. 81–87). Presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States: AAAI Press.
View
| Download None (ext.)
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 2272 |
Takhanov, R., & Kolmogorov, V. (2013). Inference algorithms for pattern-based CRFs on sequence data. In ICML’13 Proceedings of the 30th International Conference on International (Vol. 28, pp. 145–153). Atlanta, GA, USA: ML Research Press.
[Submitted Version]
View
| Files available
| Download Submitted Version (ext.)
2013 | Published | Report | IST-REx-ID: 2273 |
Kolmogorov, V. (2013). Reweighted message passing revisited. IST Austria.
View
| Download (ext.)
2013 | Published | Report | IST-REx-ID: 2274 |
Dziembowski, S., Faust, S., Kolmogorov, V., & Pietrzak, K. Z. (2013). Proofs of Space. IST Austria.
[Published Version]
View
| Files available
2013 | Published | Conference Paper | IST-REx-ID: 2276 |
Gridchyn, I., & Kolmogorov, V. (2013). Potts model, parametric maxflow and k-submodular functions (pp. 2320–2327). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. https://doi.org/10.1109/ICCV.2013.288
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 2518 |
Kolmogorov, V. (2013). The power of linear programming for finite-valued CSPs: A constructive characterization (Vol. 7965, pp. 625–636). Presented at the ICALP: Automata, Languages and Programming, Riga, Latvia: Springer. https://doi.org/10.1007/978-3-642-39206-1_53
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Journal Article | IST-REx-ID: 2828 |
Kolmogorov, V., & Živný, S. (2013). The complexity of conservative valued CSPs. Journal of the ACM. ACM. https://doi.org/10.1145/2450142.2450146
[Preprint]
View
| DOI
| Download Preprint (ext.)
| arXiv
2013 | Published | Conference Paper | IST-REx-ID: 2901 |
Chen, C., Kolmogorov, V., Yan, Z., Metaxas, D., & Lampert, C. (2013). Computing the M most probable modes of a graphical model (Vol. 31, pp. 161–169). Presented at the AISTATS: Conference on Uncertainty in Artificial Intelligence, Scottsdale, AZ, United States: JMLR.
View
| Download None (ext.)