معرفی
Andrei Krokhin is a Professor in the Department of Computer Science at Durham University, UK. His academic roles include being a member of the Algorithms and Complexity Research Group. He holds a PhD in Mathematics from Ural State University (Russia) and has held positions at Warwick University and Oxford University. His research focuses on computational complexity, constraint satisfaction problems (CSP), universal algebra, and combinatorics.
Education:
- PhD in Mathematics, Ural State University, 1990s
Research Interests:
Professor Krokhin investigates the mathematical and algorithmic foundations of CSP, emphasizing complexity classification and approximation. His work bridges universal algebra, logic, combinatorics, and graph theory. Key themes include algebraic approaches to CSP, constraint optimization, and the interplay between computational complexity and structural mathematics.
Awards:
- EPSRC Advanced Research Fellowship (2006)
- Principal organizer of the 2006 Oxford Workshop on Mathematics of Constraint Satisfaction
- Invited plenary speaker at ISMVL 2003 (Tokyo)
- Invited lectures at NATO ASI Summer School (2003)
Advising & Grants:
Supervises PhD students (e.g., Yiming Qiu) and leads EPSRC-funded projects like 'Promise Constraint Satisfaction Problems: Structure and Complexity.' He recruits students for research on CSP complexity and approximation.
Labs/Teams:
Member of the Algorithms and Complexity Research Group at Durham University, collaborating internationally on CSP theory and applications.
