Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.”10.1109/ICCVW.2019.00097__Proceedings of the 2019 International Conference on Computer Vision Workshop, 748–752, IEEE, 2019, doi:10.1109/ICCVW.2019.00097.
LibreCat: https://research-explorer.ista.ac.at/record/7639
DOI: 10.1109/ICCVW.2019.00097
WoS: 000554591600090

Shekhovtsov, Alexander, et al. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.”10.1109/TPAMI.2017.2730884__IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 7, IEEE, 2018, pp. 1668–82, doi:10.1109/TPAMI.2017.2730884.
LibreCat: https://research-explorer.ista.ac.at/record/703
DOI: 10.1109/TPAMI.2017.2730884
arXiv: 1508.07902

Kazda, Alexandr, et al. “Absorption and Directed Jónsson Terms.”10.1007/978-3-319-74772-9_7__Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited by J Czelakowski, vol. 16, Springer Nature, 2018, pp. 203–20, doi:10.1007/978-3-319-74772-9_7.
LibreCat: https://research-explorer.ista.ac.at/record/10864
DOI: 10.1007/978-3-319-74772-9_7
arXiv: 1502.01072

Mohapatra, Pritish, et al. “Efficient Optimization for Rank-Based Loss Functions.”10.1109/cvpr.2018.00389__2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 3693–701, doi:10.1109/cvpr.2018.00389.
LibreCat: https://research-explorer.ista.ac.at/record/273
DOI: 10.1109/cvpr.2018.00389
WoS: 000457843603087
arXiv: 1604.08269

Alwen, Joel F., et al. “On the Memory Hardness of Data Independent Password Hashing Functions.”10.1145/3196494.3196534__Proceedings of the 2018 on Asia Conference on Computer and Communication Security, ACM, 2018, pp. 51–65, doi:10.1145/3196494.3196534.
LibreCat: https://research-explorer.ista.ac.at/record/193
DOI: 10.1145/3196494.3196534
WoS: 000516620100005

Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”10.1137/16m1093306__SIAM Journal on Computing, vol. 47, no. 6, Society for Industrial &; Applied Mathematics (SIAM), 2018, pp. 2029–56, doi:10.1137/16m1093306.
LibreCat: https://research-explorer.ista.ac.at/record/5975
DOI: 10.1137/16m1093306
WoS: 000453785100001
arXiv: 1506.08547

Haller, Stefan, et al. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” Proceedings of the 32st AAAI Conference on Artificial Intelligence, AAAI Press, 2018, pp. 6581–88.
LibreCat: https://research-explorer.ista.ac.at/record/5978
WoS: 000485488906082
arXiv: 2004.06370

Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria, vol. 141, no. 10, Charles Babbage Research Centre, 2018, pp. 269–304.
LibreCat: https://research-explorer.ista.ac.at/record/18
WoS: 000446809500022
arXiv: 1405.7828

Kazda, Alexandr, et al. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.”10.1145/3230649__ACM Transactions on Algorithms, vol. 15, no. 2, 22, ACM, 2018, doi:10.1145/3230649.
LibreCat: https://research-explorer.ista.ac.at/record/6032
DOI: 10.1145/3230649
WoS: 000468036500007
arXiv: 1602.03124

Alhaija, Hassan, et al. Graph Matching Problems for GraphFlow – 6D Large Displacement Scene Flow. Institute of Science and Technology Austria, 2018, doi:10.15479/AT:ISTA:82.
LibreCat: https://research-explorer.ista.ac.at/record/5573
DOI: 10.15479/AT:ISTA:82

Trajkovska, Vera, et al. Graphical Model Parameter Learning by Inverse Linear Programming. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 323–34, doi:10.1007/978-3-319-58771-4_26.
LibreCat: https://research-explorer.ista.ac.at/record/641
DOI: 10.1007/978-3-319-58771-4_26

Kolmogorov, Vladimir, et al. “The Complexity of General-Valued CSPs.”10.1137/16M1091836__SIAM Journal on Computing, vol. 46, no. 3, SIAM, 2017, pp. 1087–110, doi:10.1137/16M1091836.
LibreCat: https://research-explorer.ista.ac.at/record/644
DOI: 10.1137/16M1091836

Kuske, Jan, et al. A Novel Convex Relaxation for Non Binary Discrete Tomography. Edited by François Lauze et al., vol. 10302, Springer, 2017, pp. 235–46, doi:10.1007/978-3-319-58771-4_19.
LibreCat: https://research-explorer.ista.ac.at/record/646
DOI: 10.1007/978-3-319-58771-4_19

Rolinek, Michal. Complexity of Constraint Satisfaction. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:th_815.
LibreCat: https://research-explorer.ista.ac.at/record/992
DOI: 10.15479/AT:ISTA:th_815

Kazda, Alexandr, et al. Even Delta-Matroids and the Complexity of Planar Boolean CSPs. SIAM, 2017, pp. 307–26, doi:10.1137/1.9781611974782.20.
LibreCat: https://research-explorer.ista.ac.at/record/1192
DOI: 10.1137/1.9781611974782.20
WoS: 000426965800020

Swoboda, Paul, et al. A Study of Lagrangean Decompositions and Dual Ascent Solvers for Graph Matching. Vol. 2017, IEEE, 2017, pp. 7062–71, doi:10.1109/CVPR.2017.747.
LibreCat: https://research-explorer.ista.ac.at/record/916
DOI: 10.1109/CVPR.2017.747
WoS: 000418371407018

Swoboda, Paul, and Bjoern Andres. A Message Passing Algorithm for the Minimum Cost Multicut Problem. Vol. 2017, IEEE, 2017, pp. 4990–99, doi:10.1109/CVPR.2017.530.
LibreCat: https://research-explorer.ista.ac.at/record/915
DOI: 10.1109/CVPR.2017.530
WoS: 000418371405009

Swoboda, Paul, et al. A Dual Ascent Framework for Lagrangean Decomposition of Combinatorial Problems. Vol. 2017, IEEE, 2017, pp. 4950–60, doi:10.1109/CVPR.2017.526.
LibreCat: https://research-explorer.ista.ac.at/record/917
DOI: 10.1109/CVPR.2017.526
WoS: 000418371405005

Kolmogorov, Vladimir. “A Faster Approximation Algorithm for the Gibbs Partition Function.” Proceedings of the 31st Conference On Learning Theory, vol. 75, ML Research Press, 2017, pp. 228–49.
LibreCat: https://research-explorer.ista.ac.at/record/274
arXiv: 1608.04223

Kainmueller, Dagmar, et al. Graph Matching Problems for Annotating C. Elegans. Institute of Science and Technology Austria, 2017, doi:10.15479/AT:ISTA:57.
LibreCat: https://research-explorer.ista.ac.at/record/5561
DOI: 10.15479/AT:ISTA:57

Alwen, Joel F., et al. On the Complexity of Scrypt and Proofs of Space in the Parallel Random Oracle Model. Vol. 9666, Springer, 2016, pp. 358–87, doi:10.1007/978-3-662-49896-5_13.
LibreCat: https://research-explorer.ista.ac.at/record/1231
DOI: 10.1007/978-3-662-49896-5_13

Barto, Libor, and Alexandr Kazda. “Deciding Absorption.”10.1142/S0218196716500430__International Journal of Algebra and Computation, vol. 26, no. 5, World Scientific Publishing, 2016, pp. 1033–60, doi:10.1142/S0218196716500430.
LibreCat: https://research-explorer.ista.ac.at/record/1353
DOI: 10.1142/S0218196716500430

Kolmogorov, Vladimir, et al. “Total Variation on a Tree.”10.1137/15M1010257__SIAM Journal on Imaging Sciences, vol. 9, no. 2, Society for Industrial and Applied Mathematics , 2016, pp. 605–36, doi:10.1137/15M1010257.
LibreCat: https://research-explorer.ista.ac.at/record/1377
DOI: 10.1137/15M1010257

Kazda, Alexandr. “CSP for Binary Conservative Relational Structures.”10.1007/s00012-015-0358-8__Algebra Universalis, vol. 75, no. 1, Springer, 2016, pp. 75–84, doi:10.1007/s00012-015-0358-8.
LibreCat: https://research-explorer.ista.ac.at/record/1612
DOI: 10.1007/s00012-015-0358-8

Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovasz Local Lemma.”10.1109/FOCS.2016.88__Proceedings - Annual IEEE Symposium on Foundations of Computer Science, vol. 2016–December, 7782993, IEEE, 2016, doi:10.1109/FOCS.2016.88.
LibreCat: https://research-explorer.ista.ac.at/record/1193
DOI: 10.1109/FOCS.2016.88
arXiv: 1506.08547

Kolmogorov, Vladimir, and Rustem Takhanov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.”10.1007/s00453-015-0017-7__Algorithmica, vol. 76, no. 1, Springer, 2016, pp. 17–46, doi:10.1007/s00453-015-0017-7.
LibreCat: https://research-explorer.ista.ac.at/record/1794
DOI: 10.1007/s00453-015-0017-7
arXiv: 1210.0508

Swoboda, Paul. Synthetic Discrete Tomography Problems. Institute of Science and Technology Austria, 2016, doi:10.15479/AT:ISTA:46.
LibreCat: https://research-explorer.ista.ac.at/record/5557
DOI: 10.15479/AT:ISTA:46

Kolmogorov, Vladimir, et al. “Effectiveness of Structural Restrictions for Hybrid CSPs.”10.1007/978-3-662-48971-0_48__26th International Symposium, vol. 9472, Springer Nature, 2015, pp. 566–77, doi:10.1007/978-3-662-48971-0_48.
LibreCat: https://research-explorer.ista.ac.at/record/1636
DOI: 10.1007/978-3-662-48971-0_48
arXiv: 1504.07067

Kolmogorov, Vladimir. “A New Look at Reweighted Message Passing.”10.1109/TPAMI.2014.2363465__IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 37, no. 5, IEEE, 2015, pp. 919–30, doi:10.1109/TPAMI.2014.2363465.
LibreCat: https://research-explorer.ista.ac.at/record/1841
DOI: 10.1109/TPAMI.2014.2363465

Shah, Neel, et al. A Multi-Plane Block-Coordinate Frank-Wolfe Algorithm for Training Structural SVMs with a Costly Max-Oracle. IEEE, 2015, pp. 2737–45, doi:10.1109/CVPR.2015.7298890.
LibreCat: https://research-explorer.ista.ac.at/record/1859
DOI: 10.1109/CVPR.2015.7298890

Kolmogorov, Vladimir, et al. “The Power of Linear Programming for General-Valued CSPs.”10.1137/130945648__SIAM Journal on Computing, vol. 44, no. 1, SIAM, 2015, pp. 1–36, doi:10.1137/130945648.
LibreCat: https://research-explorer.ista.ac.at/record/2271
DOI: 10.1137/130945648
arXiv: 1311.4219

Kolmogorov, Vladimir, et al. The Complexity of General-Valued CSPs. IEEE, 2015, pp. 1246–58, doi:10.1109/FOCS.2015.80.
LibreCat: https://research-explorer.ista.ac.at/record/1637
DOI: 10.1109/FOCS.2015.80

Dziembowski, Stefan, et al. “Proofs of Space.”10.1007/978-3-662-48000-7_29__35th Annual Cryptology Conference, vol. 9216, Springer, 2015, pp. 585–605, doi:10.1007/978-3-662-48000-7_29.
LibreCat: https://research-explorer.ista.ac.at/record/1675
DOI: 10.1007/978-3-662-48000-7_29

Olsson, Carl, et al. Partial Enumeration and Curvature Regularization. IEEE, 2014, pp. 2936–43, doi:10.1109/ICCV.2013.365.
LibreCat: https://research-explorer.ista.ac.at/record/2275
DOI: 10.1109/ICCV.2013.365

Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction to Mathematical Games. IST Austria.
LibreCat: https://research-explorer.ista.ac.at/record/7038

Bachrach, Yoram, et al. Optimal Coalition Structures in Cooperative Graph Games. AAAI Press, 2013, pp. 81–87.
LibreCat: https://research-explorer.ista.ac.at/record/2270
arXiv: 1108.5248

Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2273

Gridchyn, Igor, and Vladimir Kolmogorov. Potts Model, Parametric Maxflow and k-Submodular Functions. IEEE, 2013, pp. 2320–27, doi:10.1109/ICCV.2013.288.
LibreCat: https://research-explorer.ista.ac.at/record/2276
DOI: 10.1109/ICCV.2013.288
arXiv: 1310.1771

Kolmogorov, Vladimir. The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization. Vol. 7965, no. 1, Springer, 2013, pp. 625–36, doi:10.1007/978-3-642-39206-1_53.
LibreCat: https://research-explorer.ista.ac.at/record/2518
DOI: 10.1007/978-3-642-39206-1_53
arXiv: 1207.7213

Kolmogorov, Vladimir, and Stanislav divný. “The Complexity of Conservative Valued CSPs.”10.1145/2450142.2450146__Journal of the ACM, vol. 60, no. 2, 10, ACM, 2013, doi:10.1145/2450142.2450146.
LibreCat: https://research-explorer.ista.ac.at/record/2828
DOI: 10.1145/2450142.2450146
arXiv: 1110.2809

Chen, Chao, et al. Computing the M Most Probable Modes of a Graphical Model. Vol. 31, JMLR, 2013, pp. 161–69.
LibreCat: https://research-explorer.ista.ac.at/record/2901

Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” ICML’13 Proceedings of the 30th International Conference on International, vol. 28, no. 3, ML Research Press, 2013, pp. 145–53.
LibreCat: https://research-explorer.ista.ac.at/record/2272

Dziembowski, Stefan, et al. Proofs of Space. IST Austria, 2013.
LibreCat: https://research-explorer.ista.ac.at/record/2274

Huber, Anna, and Vladimir Kolmogorov. Towards Minimizing K-Submodular Functions. Vol. 7422, Springer, 2012, pp. 451–62, doi:10.1007/978-3-642-32147-4_40.
LibreCat: https://research-explorer.ista.ac.at/record/2930
DOI: 10.1007/978-3-642-32147-4_40

Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” ArXiv, ArXiv, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/2928
arXiv: 1205.6352

Torresani, Lorenzo, et al. “A Dual Decomposition Approach to Feature Correspondence.”10.1109/TPAMI.2012.105__IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 35, no. 2, IEEE, 2012, pp. 259–71, doi:10.1109/TPAMI.2012.105.
LibreCat: https://research-explorer.ista.ac.at/record/2931
DOI: 10.1109/TPAMI.2012.105

Kolmogorov, Vladimir. “Minimizing a Sum of Submodular Functions.”10.1016/j.dam.2012.05.025__Discrete Applied Mathematics, vol. 160, no. 15, Elsevier, 2012, pp. 2246–58, doi:10.1016/j.dam.2012.05.025.
LibreCat: https://research-explorer.ista.ac.at/record/3117
DOI: 10.1016/j.dam.2012.05.025

Kolmogorov, Vladimir. “Generalized Roof Duality and Bisubmodular Functions.”10.1016/j.dam.2011.10.026__Discrete Applied Mathematics, vol. 160, no. 4–5, Elsevier, 2012, pp. 416–26, doi:10.1016/j.dam.2011.10.026.
LibreCat: https://research-explorer.ista.ac.at/record/3257
DOI: 10.1016/j.dam.2011.10.026
arXiv: 1005.2305

Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. ICML, 2012.
LibreCat: https://research-explorer.ista.ac.at/record/3124

Korc, Filip, et al. Approximating Marginals Using Discrete Energy Minimization. IST Austria, 2012, doi:10.15479/AT:IST-2012-0003.
LibreCat: https://research-explorer.ista.ac.at/record/5396
DOI: 10.15479/AT:IST-2012-0003