Please note that ISTA Research Explorer no longer supports Internet Explorer versions 8 or 9 (or earlier).
We recommend upgrading to the latest Internet Explorer, Google Chrome, or Firefox.
76 Publications
2018 |Published| 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
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
| WoS
2018 |Published| 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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| arXiv
2018 |Published| 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.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2018 |Published| Journal Article | IST-REx-ID: 18 |
Kolmogorov, V., & Rolinek, M. (2018). Superconcentrators of density 25.3. Ars Combinatoria. Charles Babbage Research Centre.
[Preprint]
View
| Download Preprint (ext.)
| WoS
| arXiv
2018 |Published| 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
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
| WoS
| 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. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:82
[Published Version]
View
| Files available
| DOI
2017 |Published| Conference Paper | IST-REx-ID: 641
Trajkovska, V., Swoboda, P., Åström, F., & Petra, S. (2017). Graphical model parameter learning by inverse linear programming. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 323–334). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_26
View
| DOI
2017 |Published| Journal Article | IST-REx-ID: 644 |
Kolmogorov, V., Krokhin, A., & Rolinek, M. (2017). The complexity of general-valued CSPs. SIAM Journal on Computing. SIAM. https://doi.org/10.1137/16M1091836
[Preprint]
View
| Files available
| DOI
| Download Preprint (ext.)
2017 |Published| Conference Paper | IST-REx-ID: 646 |
Kuske, J., Swoboda, P., & Petra, S. (2017). A novel convex relaxation for non binary discrete tomography. In F. Lauze, Y. Dong, & A. Bjorholm Dahl (Eds.) (Vol. 10302, pp. 235–246). Presented at the SSVM: Scale Space and Variational Methods in Computer Vision, Kolding, Denmark: Springer. https://doi.org/10.1007/978-3-319-58771-4_19
[Submitted Version]
View
| DOI
| Download Submitted Version (ext.)
2017 |Published| Thesis | IST-REx-ID: 992 |
Rolinek, M. (2017). Complexity of constraint satisfaction. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:th_815
[Published Version]
View
| Files available
| DOI
2017 |Published| 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
[Submitted Version]
View
| Files available
| DOI
| Download Submitted Version (ext.)
| WoS
2017 |Published| Conference Paper | IST-REx-ID: 916 |
Swoboda, P., Rother, C., Abu Alhaija, C., Kainmueller, D., & Savchynskyy, B. (2017). A study of lagrangean decompositions and dual ascent solvers for graph matching (Vol. 2017, pp. 7062–7071). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.747
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 |Published| Conference Paper | IST-REx-ID: 915 |
Swoboda, P., & Andres, B. (2017). A message passing algorithm for the minimum cost multicut problem (Vol. 2017, pp. 4990–4999). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.530
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 |Published| Conference Paper | IST-REx-ID: 917 |
Swoboda, P., Kuske, J., & Savchynskyy, B. (2017). A dual ascent framework for Lagrangean decomposition of combinatorial problems (Vol. 2017, pp. 4950–4960). Presented at the CVPR: Computer Vision and Pattern Recognition, Honolulu, HA, United States: IEEE. https://doi.org/10.1109/CVPR.2017.526
[Submitted Version]
View
| Files available
| DOI
| WoS
2017 |Published| 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). ML Research Press.
[Published Version]
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. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:57
[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: 1353 |
Barto, L., & Kazda, A. (2016). Deciding absorption. International Journal of Algebra and Computation. World Scientific Publishing. https://doi.org/10.1142/S0218196716500430
[Preprint]
View
| DOI
| Download Preprint (ext.)
2016 |Published| Journal Article | IST-REx-ID: 1377 |
Kolmogorov, V., Pock, T., & Rolinek, M. (2016). Total variation on a tree. SIAM Journal on Imaging Sciences. Society for Industrial and Applied Mathematics . https://doi.org/10.1137/15M1010257
[Preprint]
View
| DOI
| Download Preprint (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.)