Rate My Professor Andrei Krokhin

Among his major awards and honors, Krokhin received the EPSRC Advanced Research Fellowship from 2005 to 2010, enabling full-time research for five years. In 2003, he was an invited plenary speaker at the 33rd International Symposium on Multiple-Valued Logic in Tokyo, Japan, and delivered a series of four invited lectures at a NATO Advanced Study Institute Summer School on Automata, Semigroups and Universal Algebra at the University of Montreal, Canada. Key publications include the edited volume The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Follow-Ups, vol. 7, 2017, with S. Živný), which features surveys such as "Polymorphisms, and how to use them" (with L. Barto and R. Willard) and "The complexity of valued CSPs" (with S. Živný). Other significant works are "Algebraic approach to promise constraint satisfaction" (Journal of the ACM, 2021, with L. Barto, J. Bulín, and J. Opršal), "The complexity of general-valued CSPs" (SIAM Journal on Computing, 2017, with V. Kolmogorov and M. Rolinek), "Classifying the complexity of constraints using finite algebras" (SIAM Journal on Computing, 2005, with A. Bulatov and P. Jeavons), "Dualities for constraint satisfaction problems" (Complexity of Constraints, LNCS 5250, 2008, with A. Bulatov and B. Larose), and "The complexity of constraint satisfaction: an algebraic approach" (NATO Science Series II, vol. 207, 2005, with A. Bulatov and P. Jeavons). His contributions appear in leading venues including STOC, FOCS, ICALP, and SIAM journals.