معرفی
Andrei Bulatov is a Professor of Computing Science at Simon Fraser University (SFU), affiliated with the School of Computing Science within the Faculty of Applied Sciences. His research focuses on computational complexity, constraint satisfaction problems (CSP), combinatorics, and universal algebra. Bulatov earned his Ph.D. and M.Sc. in Mathematics from Ural State University, Russia, in 1995 and 1991, respectively.
His work bridges theoretical computer science and algebra, with notable contributions to the complexity classification of CSPs. He has received a Best Paper Award at FOCS 2002 for his dichotomy theorem on three-element set constraints. Bulatov’s research also explores counting CSPs, algorithms for satisfiability, and applications of algebraic methods in discrete mathematics.
He is part of the Algorithms & Theory Group and the Computational Logic Laboratory at SFU. Bulatov’s publications span journals like Journal of Computer and System Sciences, Theoretical Computer Science, and SIAM Journal on Computing, addressing topics from graph theory to randomized algorithms.
His academic service includes roles in professional organizations and editorial work. Bulatov’s teaching includes courses such as Discrete Mathematics (MACM 101) and Directed Reading (CMPT 894).
