Andrei Bulatov
Professor, School of Computing Science
Contact:
| Tel: |
778.782.6913 |
| Email: |
abulatov@cs.sfu.ca |
| Fax: |
778.782.3045 |
| Office: |
SFU Burnaby, TASC 8013 |
| Personal webpage: www.cs.sfu.ca/~abulatov/ |
|
Education
Ph.D., Mathematics, Ural State University, Russia, 1995
M.Sc., Mathematics, Ural State University, Russia, 1991
Research interests
- Constraint problems
- Computational complexity
- Combinatorics
- Clone theory and universal algebra
Teaching interests
- Algorithms and complexity
- Discrete mathematics
Recently taught courses
- CMPT 307 Data Structures and Algorithms
- CMPT 405 Design and Analysis of Computing Algorithms
- CMPT 705 Design and Analysis of Algorithms
- MACM 101 Discrete Mathematics
Selected recent publications
- (with D.Marx) Constraint satisfaction parameterized by solution size, In ICALP 2011, 424-436
- Complexity of Conservative Constraint Satisfaction Problems, ACM Trans. on Compitational Logic, 12(4), 2011
- (with D. Marx) Constraint satisfaction problems and global cardinality constraints. Commun. ACM 53(9): 99-106 (2010)
- (with Albert Atserias and Anuj Dawar) Affine systems of equations and counting infinitary logic, Theor. Comput. Sci. 410(18), 2009, pp. 1666-1683
- The Complexity of the Counting Constraint Satisfaction Problem. ICALP (1) 2008: 646-661
For more information visit www.cs.sfu.ca/~abulatov/publications.html.
Listing on the DBLP CS Bibliography Server.