User:Cf189/sandbox

 Andrei A. Bulatov 

Early Life and Education
Andrei A. Bulatov is a Russian mathematician and computer scientist{1}{2}. He received his master’s degree in mathematics in 1995 in Ural State University located in Ekaterinburg, Russia {1}{2}. He then received his PhD in mathematics in 1999, also in Ural State University {1}{2}.

Career
Bulatov first started as an associate professor at the Ural State University where he received his master’s and PhD{2}. He later became a Research Officer at the University of Oxford{2}. He is currently a computer science professor at Simon Fraser University (SFU) in British Columbia, Canada{1}. At SFU, he has taught numerous courses in the undergraduate and graduate level. He is also affiliated to two laboratories at SFU which are: Algorithms & Theory Group and the Computational Logic Laboratory. The Algorithms & Complexity Group focuses on the theoretical aspects of Computer Science and the application of this theory to industrial uses, and the Computational Logic Lab focuses on the study of logics which are useful for expressing or solving computational problems, and the computational properties of those logics.

Bulatov’s research focuses mainly on algebraic, complexity and logic foundations of constraint problems, applications of constraint problems in combinatorics, and counting constraint satisfaction problems and partition functions. He has written various manuscripts, technical reports, books, and articles on his research; much of his work focuses on constraint satisfaction and complexity theory, and algebra and clone theory.

Honors and Awards
Andrei Bulatov received a Best Paper Award at the Annual IEEE (Institute of Electrical and Electronics Engineers) Symposium on Foundations on Computer Science (FOCS) in 2013{2}. In 2014, he was invited to talk at the International Congress of Mathematicians in Seoul about the mathematical aspects of computer science{5}.