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.




58 Publications

2017 | Conference Paper | IST-REx-ID: 274 | OA
Kolmogorov V. A faster approximation algorithm for the Gibbs partition function. In: Proceedings of the 31st Conference On Learning Theory. Vol 75. PMLR; 2017:228-249.
View | Files available | arXiv
 
2017 | Conference Paper | IST-REx-ID: 641
Trajkovska V, Swoboda P, Åström F, Petra S. Graphical model parameter learning by inverse linear programming. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:323-334. doi:10.1007/978-3-319-58771-4_26
View | DOI
 
2017 | Journal Article | IST-REx-ID: 644 | OA
Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. SIAM Journal on Computing. 2017;46(3):1087-1110. doi:10.1137/16M1091836
View | Files available | DOI | Download Preprint (ext.)
 
2017 | Conference Paper | IST-REx-ID: 646 | OA
Kuske J, Swoboda P, Petra S. A novel convex relaxation for non binary discrete tomography. In: Lauze F, Dong Y, Bjorholm Dahl A, eds. Vol 10302. Springer; 2017:235-246. doi:10.1007/978-3-319-58771-4_19
View | DOI | Download Submitted Version (ext.)
 
2017 | Conference Paper | IST-REx-ID: 915 | OA
Swoboda P, Andres B. A message passing algorithm for the minimum cost multicut problem. In: Vol 2017. IEEE; 2017:4990-4999. doi:10.1109/CVPR.2017.530
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 916 | OA
Swoboda P, Rother C, Abu Alhaija C, Kainmueller D, Savchynskyy B. A study of lagrangean decompositions and dual ascent solvers for graph matching. In: Vol 2017. IEEE; 2017:7062-7071. doi:10.1109/CVPR.2017.747
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 917 | OA
Swoboda P, Kuske J, Savchynskyy B. A dual ascent framework for Lagrangean decomposition of combinatorial problems. In: Vol 2017. IEEE; 2017:4950-4960. doi:10.1109/CVPR.2017.526
View | Files available | DOI
 
2017 | Thesis | IST-REx-ID: 992 | OA
Rolinek M. Complexity of Constraint Satisfaction. IST Austria; 2017. doi:10.15479/AT:ISTA:th_815
View | Files available | DOI
 
2017 | Conference Paper | IST-REx-ID: 1192 | OA
Kazda A, Kolmogorov V, Rolinek M. Even delta-matroids and the complexity of planar Boolean CSPs. In: SIAM; 2017:307-326. doi:10.1137/1.9781611974782.20
View | Files available | DOI | Download Submitted Version (ext.)
 
2016 | Journal Article | IST-REx-ID: 1612 | OA
Kazda A. CSP for binary conservative relational structures. Algebra Universalis. 2016;75(1):75-84. doi:10.1007/s00012-015-0358-8
View | DOI | Download Preprint (ext.)
 
2016 | Journal Article | IST-REx-ID: 1794 | OA
Kolmogorov V, Takhanov R. Inference algorithms for pattern-based CRFs on sequence data. Algorithmica. 2016;76(1):17-46. doi:10.1007/s00453-015-0017-7
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1193 | OA
Kolmogorov V. Commutativity in the algorithmic Lovasz local lemma. In: Proceedings - Annual IEEE Symposium on Foundations of Computer Science. Vol 2016-December. IEEE; 2016:7782993. doi:10.1109/FOCS.2016.88
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2016 | Conference Paper | IST-REx-ID: 1231 | OA
Alwen JF, Chen B, Kamath Hosdurg C, Kolmogorov V, Pietrzak KZ, Tessaro S. On the complexity of scrypt and proofs of space in the parallel random oracle model. In: Vol 9666. Springer; 2016:358-387. doi:10.1007/978-3-662-49896-5_13
View | DOI | Download Submitted Version (ext.)
 
2016 | Journal Article | IST-REx-ID: 1353 | OA
Barto L, Kazda A. Deciding absorption. International Journal of Algebra and Computation. 2016;26(5):1033-1060. doi:10.1142/S0218196716500430
View | DOI | Download Preprint (ext.)
 
2016 | Journal Article | IST-REx-ID: 1377 | OA
Kolmogorov V, Pock T, Rolinek M. Total variation on a tree. SIAM Journal on Imaging Sciences. 2016;9(2):605-636. doi:10.1137/15M1010257
View | DOI | Download Preprint (ext.)
 
2015 | Journal Article | IST-REx-ID: 2271 | OA
Kolmogorov V, Thapper J, Živný S. The power of linear programming for general-valued CSPs. SIAM Journal on Computing. 2015;44(1):1-36. doi:10.1137/130945648
View | Files available | DOI | Download Preprint (ext.) | arXiv
 
2015 | Conference Paper | IST-REx-ID: 1636 | OA
Kolmogorov V, Rolinek M, Takhanov R. Effectiveness of structural restrictions for hybrid CSPs. 2015;9472:566-577. doi:10.1007/978-3-662-48971-0_48
View | DOI | Download Preprint (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1637 | OA
Kolmogorov V, Krokhin A, Rolinek M. The complexity of general-valued CSPs. In: IEEE; 2015:1246-1258. doi:10.1109/FOCS.2015.80
View | Files available | DOI | Download Preprint (ext.)
 
2015 | Conference Paper | IST-REx-ID: 1675
Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. Proofs of space. 2015;9216:585-605. doi:10.1007/978-3-662-48000-7_29
View | Files available | DOI
 
2015 | Journal Article | IST-REx-ID: 1841 | OA
Kolmogorov V. A new look at reweighted message passing. IEEE Transactions on Pattern Analysis and Machine Intelligence. 2015;37(5):919-930. doi:10.1109/TPAMI.2014.2363465
View | DOI | Download Preprint (ext.)
 

Filters and Search Terms

type<>research_data

Search

Display / Sort

Citation Style: AMA

Export / Embed