Andrei Bulatov
photo Andrei A.Bulatov

Constraint Satisfaction and Related Problems

Algebraic and Logic Foundations of Constraint Problems
Complexity of Constraint Problems
Applications of Constraint Problems in Combinatorics
Counting constraint satsisfaction problems and partition functions

Satisfiability and Algorithms for Satisfiability

Random Satisfiability Problem
Analysis of Randomized Algorithms for SAT

Properties of Complex Networks

Prediction in networks
Centrality and related problems


Associate Professor of Computing Science at SFU
email: abulatov@sfu.ca, phone: +1 778 782 6913, fax: +1 778 782 3045
Academic Degrees
Ph.D. 1995, Mathematics, Ural State University, Russia
M.Sc. (Diploma) 1991, Mathematics, Ural State University, Russia
Laboratory Affiliations
Algorithms & Theory Group, Computational Logic Laboratory

* Professional Service

SFU crest * Graduate Students

* Recent Funding

* Selected Publications

* Teaching


Back to Faculty Home Page