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
2018 | Conference Paper | IST-REx-ID: 193 | 
Alwen, J. F., Gazi, P., Kamath Hosdurg, C., Klein, K., Osang, G. F., Pietrzak, K. Z., … Rybar, M. (2018). On the memory hardness of data independent password hashing functions. In Proceedings of the 2018 on Asia Conference on Computer and Communication Security (pp. 51–65). Incheon, Republic of Korea: ACM. https://doi.org/10.1145/3196494.3196534
View
| DOI
| Download Submitted Version (ext.)
2018 | Conference Paper | IST-REx-ID: 273 |
Mohapatra, P., Rolinek, M., Jawahar, C. V., Kolmogorov, V., & Kumar, M. P. (2018). Efficient optimization for rank-based loss functions. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition (pp. 3693–3701). Salt Lake City, UT, USA: IEEE. https://doi.org/10.1109/cvpr.2018.00389
View
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Research Data | IST-REx-ID: 5573 |
Alhaija, H., Sellent, A., Kondermann, D., & Rother, C. (2018). Graph matching problems for GraphFlow – 6D Large Displacement Scene Flow. IST Austria. https://doi.org/10.15479/AT:ISTA:82
View
| Files available
| DOI
2018 | Journal Article | IST-REx-ID: 5975 |
Kolmogorov, V. (2018). Commutativity in the algorithmic Lovász local lemma. SIAM Journal on Computing. Society for Industrial & Applied Mathematics (SIAM). https://doi.org/10.1137/16m1093306
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Conference Paper | IST-REx-ID: 5978 |
Haller, S., Swoboda, P., & Savchynskyy, B. (2018). Exact MAP-inference by confining combinatorial search with LP relaxation. In Proceedings of the 32st AAAI Conference on Artificial Intelligence (pp. 6581–6588). New Orleans, LU, United States: AAAI Press.
View
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 6032 |
Kazda, A., Kolmogorov, V., & Rolinek, M. (2018). Even delta-matroids and the complexity of planar boolean CSPs. ACM Transactions on Algorithms. ACM. https://doi.org/10.1145/3230649
View
| Files available
| DOI
| Download Preprint (ext.)
| arXiv
2018 | Journal Article | IST-REx-ID: 703 |
Shekhovtsov, A., Swoboda, P., & Savchynskyy, B. (2018). Maximum persistency via iterative relaxed inference with graphical models. IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE. https://doi.org/10.1109/TPAMI.2017.2730884
View
| DOI
| Download Preprint (ext.)
| arXiv
2017 | Conference Paper | IST-REx-ID: 274 |
Kolmogorov, V. (2017). A faster approximation algorithm for the Gibbs partition function. In Proceedings of the 31st Conference On Learning Theory (Vol. 75, pp. 228–249). PMLR.
View
| Files available
| arXiv
2017 | Research Data | IST-REx-ID: 5561 |
Kainmueller, D., Jug, F., Rother, C., & Meyers, G. (2017). Graph matching problems for annotating C. Elegans. IST Austria. https://doi.org/10.15479/AT:ISTA:57
View
| Files available
| DOI
2017 | Conference Paper | IST-REx-ID: 1192 |
Kazda, A., Kolmogorov, V., & Rolinek, M. (2017). Even delta-matroids and the complexity of planar Boolean CSPs (pp. 307–326). Presented at the SODA: Symposium on Discrete Algorithms, Barcelona, Spain: SIAM. https://doi.org/10.1137/1.9781611974782.20
View
| Files available
| DOI
| Download Submitted Version (ext.)