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.

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.

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.

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.

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.

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.

Swoboda, Paul. Synthetic Discrete Tomography Problems. Institute of Science and Technology Austria, 2016, 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.

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.

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.

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.

Kolmogorov, Vladimir, et al. The Complexity of General-Valued CSPs. IEEE, 2015, pp. 1246–58, 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.

Olsson, Carl, et al. Partial Enumeration and Curvature Regularization. IEEE, 2014, pp. 2936–43, doi:10.1109/ICCV.2013.365.

Huszár, Kristóf, and Michal Rolinek. Playful Math - An Introduction to Mathematical Games. IST Austria.

Bachrach, Yoram, et al. Optimal Coalition Structures in Cooperative Graph Games. AAAI Press, 2013, pp. 81–87.

Kolmogorov, Vladimir. Reweighted Message Passing Revisited. IST Austria, 2013.

Gridchyn, Igor, and Vladimir Kolmogorov. Potts Model, Parametric Maxflow and k-Submodular Functions. IEEE, 2013, pp. 2320–27, doi:10.1109/ICCV.2013.288.

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.

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.