Shehu, Yekini, Qiao-Li Dong, Lu-Lu Liu, and Jen-Chih Yao. “New Strong Convergence Method for the Sum of Two Maximal Monotone Operators.”https://doi.org/10.1007/s11081-020-09544-5__Optimization and Engineering. Springer Nature, 2021.https://doi.org/10.1007/s11081-020-09544-5 .

Shehu, Yekini, and Aviv Gibali. “New Inertial Relaxed Method for Solving Split Feasibilities.”https://doi.org/10.1007/s11590-020-01603-1__Optimization Letters. Springer Nature, 2021.https://doi.org/10.1007/s11590-020-01603-1 .

Shehu, Yekini, Xiao-Huan Li, and Qiao-Li Dong. “An Efficient Projection-Type Method for Monotone Variational Inequalities in Hilbert Spaces.”https://doi.org/10.1007/s11075-019-00758-y__Numerical Algorithms. Springer Nature, 2020.https://doi.org/10.1007/s11075-019-00758-y .

Shehu, Yekini, and Olaniyi S. Iyiola. “Projection Methods with Alternating Inertial Steps for Variational Inequalities: Weak and Linear Convergence.”https://doi.org/10.1016/j.apnum.2020.06.009__Applied Numerical Mathematics. Elsevier, 2020.https://doi.org/10.1016/j.apnum.2020.06.009 .

Shehu, Yekini, Aviv Gibali, and Simone Sagratella. “Inertial Projection-Type Methods for Solving Quasi-Variational Inequalities in Real Hilbert Spaces.”https://doi.org/10.1007/s10957-019-01616-6__Journal of Optimization Theory and Applications. Springer Nature, 2020.https://doi.org/10.1007/s10957-019-01616-6 .

Kolmogorov, Vladimir. “Testing the Complexity of a Valued CSP Language.”https://doi.org/10.4230/LIPICS.ICALP.2019.77__In 46th International Colloquium on Automata, Languages and Programming, 132:77:1-77:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2019.https://doi.org/10.4230/LIPICS.ICALP.2019.77 .

Shehu, Yekini. “Convergence Results of Forward-Backward Algorithms for Sum of Monotone Operators in Banach Spaces.”https://doi.org/10.1007/s00025-019-1061-4__Results in Mathematics. Springer, 2019.https://doi.org/10.1007/s00025-019-1061-4 .

Shehu, Yekini, Olaniyi S. Iyiola, Xiao-Huan Li, and Qiao-Li Dong. “Convergence Analysis of Projection Method for Variational Inequalities.”https://doi.org/10.1007/s40314-019-0955-9__Computational and Applied Mathematics. Springer Nature, 2019.https://doi.org/10.1007/s40314-019-0955-9 .

Achlioptas, Dimitris, Fotis Iliopoulos, and Vladimir Kolmogorov. “A Local Lemma for Focused Stochastical Algorithms.”https://doi.org/10.1137/16m109332x__SIAM Journal on Computing. SIAM, 2019.https://doi.org/10.1137/16m109332x .

Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.”https://doi.org/10.1109/CVPR.2019.01140__In Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Vol. 2019–June. IEEE, 2019.https://doi.org/10.1109/CVPR.2019.01140 .

Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko. “Function Norms for Neural Networks.”https://doi.org/10.1109/ICCVW.2019.00097__In Proceedings of the 2019 International Conference on Computer Vision Workshop. IEEE, 2019.https://doi.org/10.1109/ICCVW.2019.00097 .

Shekhovtsov, Alexander, Paul Swoboda, and Bogdan Savchynskyy. “Maximum Persistency via Iterative Relaxed Inference with Graphical Models.”https://doi.org/10.1109/TPAMI.2017.2730884__IEEE Transactions on Pattern Analysis and Machine Intelligence. IEEE, 2018.https://doi.org/10.1109/TPAMI.2017.2730884 .

Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption and Directed Jónsson Terms.”https://doi.org/10.1007/978-3-319-74772-9_7__In Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, edited by J Czelakowski, 16:203–20. OCTR. Cham: Springer Nature, 2018.https://doi.org/10.1007/978-3-319-74772-9_7 .

Mohapatra, Pritish, Michal Rolinek, C V Jawahar, Vladimir Kolmogorov, and M Pawan Kumar. “Efficient Optimization for Rank-Based Loss Functions.”https://doi.org/10.1109/cvpr.2018.00389__In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, 3693–3701. IEEE, 2018.https://doi.org/10.1109/cvpr.2018.00389 .

Alwen, Joel F, Peter Gazi, Chethan Kamath Hosdurg, Karen Klein, Georg F Osang, Krzysztof Z Pietrzak, Lenoid Reyzin, Michal Rolinek, and Michal Rybar. “On the Memory Hardness of Data Independent Password Hashing Functions.”https://doi.org/10.1145/3196494.3196534__In Proceedings of the 2018 on Asia Conference on Computer and Communication Security, 51–65. ACM, 2018.https://doi.org/10.1145/3196494.3196534 .

Kolmogorov, Vladimir. “Commutativity in the Algorithmic Lovász Local Lemma.”https://doi.org/10.1137/16m1093306__SIAM Journal on Computing. Society for Industrial &; Applied Mathematics (SIAM), 2018.https://doi.org/10.1137/16m1093306 .

Haller, Stefan, Paul Swoboda, and Bogdan Savchynskyy. “Exact MAP-Inference by Confining Combinatorial Search with LP Relaxation.” In Proceedings of the 32st AAAI Conference on Artificial Intelligence, 6581–88. AAAI Press, 2018.

Kolmogorov, Vladimir, and Michal Rolinek. “Superconcentrators of Density 25.3.” Ars Combinatoria. Charles Babbage Research Centre, 2018.

Kazda, Alexandr, Vladimir Kolmogorov, and Michal Rolinek. “Even Delta-Matroids and the Complexity of Planar Boolean CSPs.”https://doi.org/10.1145/3230649__ACM Transactions on Algorithms. ACM, 2018.https://doi.org/10.1145/3230649 .

Trajkovska, Vera, Paul Swoboda, Freddie Åström, and Stefanie Petra. “Graphical Model Parameter Learning by Inverse Linear Programming.”https://doi.org/10.1007/978-3-319-58771-4_26__edited by François Lauze, Yiqiu Dong, and Anders Bjorholm Dahl, 10302:323–34. Springer, 2017.https://doi.org/10.1007/978-3-319-58771-4_26 .