Rate My Professor Andrei Krokhin

Andrei Krokhin is Professor in the Department of Computer Science at the University of Durham, holding the Chair in Computer Science since 2011. He joined Durham in September 2004 initially as Reader. His previous appointments include Lecturer in Computer Science at the University of Warwick from 2002 to 2004 and Research Associate at the Oxford University Computing Laboratory from 2000 to 2002. From 1994 to 2000, he was Assistant Professor in the Department of Mathematics and Mechanics at Ural State University, Ekaterinburg, Russia, where he obtained his PhD in Mathematics. Krokhin's research focuses on combinatorics of graphs and ordered sets, computational complexity, homomorphism problems, mathematics of constraint satisfaction, universal algebra, and logic in computer science. He is a member of the Algorithms and Complexity Research Group.

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.