Andrei A. Bulatov

	2009
34		Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx: Enumerating Homomorphisms. STACS 2009: 231-242
33		Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx: Enumerating Homomorphisms CoRR abs/0902.1256: (2009)
32		Ferdinand Börner, Andrei A. Bulatov, Hubie Chen, Peter Jeavons, Andrei A. Krokhin: The complexity of constraint satisfaction games and QCSP. Inf. Comput. 207(9): 923-944 (2009)
31		Albert Atserias, Andrei A. Bulatov, Anuj Dawar: Affine systems of equations and counting infinitary logic. Theor. Comput. Sci. 410(18): 1666-1683 (2009)
	2008
30		Andrei A. Bulatov, Matthew Valeriote: Recent Results on the Algebraic Approach to the CSP. Complexity of Constraints 2008: 68-92
29		Andrei A. Bulatov, Andrei A. Krokhin, Benoit Larose: Dualities for Constraint Satisfaction Problems. Complexity of Constraints 2008: 93-124
28		Andrei A. Bulatov: The Complexity of the Counting Constraint Satisfaction Problem. ICALP (1) 2008: 646-661
27		Andrei A. Bulatov, Evgeny S. Skvortsov: Phase transition for Local Search on planted SAT CoRR abs/0811.2546: (2008)
	2007
26		Albert Atserias, Andrei A. Bulatov, Víctor Dalmau: On the Power of k -Consistency. ICALP 2007: 279-290
25		Albert Atserias, Andrei A. Bulatov, Anuj Dawar: Affine Systems of Equations and Counting Infinitary Logic. ICALP 2007: 558-570
24		Andrei A. Bulatov: The complexity of the counting constraint satisfaction problem. Electronic Colloquium on Computational Complexity (ECCC) 14(093): (2007)
23		Andrei A. Bulatov, Víctor Dalmau: Towards a dichotomy theorem for the counting constraint satisfaction problem. Inf. Comput. 205(5): 651-678 (2007)
22		Andrei A. Bulatov, Hubie Chen, Víctor Dalmau: Learning intersection-closed classes with signatures. Theor. Comput. Sci. 382(3): 209-220 (2007)
	2006
21		Andrei A. Bulatov, Evgeny S. Skvortsov: Efficiency of Local Search. SAT 2006: 297-310
20		Andrei A. Bulatov: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM 53(1): 66-120 (2006)
19		Andrei A. Bulatov, Víctor Dalmau: A Simple Algorithm for Mal'tsev Constraints. SIAM J. Comput. 36(1): 16-27 (2006)
	2005
18		Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin: Classifying the Complexity of Constraints Using Finite Algebras. SIAM J. Comput. 34(3): 720-742 (2005)
17		Andrei A. Bulatov, Martin Grohe: The complexity of partition functions. Theor. Comput. Sci. 348(2-3): 148-186 (2005)
16		Andrei A. Bulatov: H-Coloring dichotomy revisited. Theor. Comput. Sci. 349(1): 31-39 (2005)
	2004
15		Andrei A. Bulatov, Hubie Chen, Víctor Dalmau: Learnability of Relatively Quantified Generalized Formulas. ALT 2004: 365-379
14		Andrei A. Bulatov, Martin Grohe: The Complexity of Partition Functions. ICALP 2004: 294-306
13		Andrei A. Bulatov: A Graph of a Relational Structure and Constraint Satisfaction Problems. LICS 2004: 448-457
	2003
12		Andrei A. Bulatov, Peter Jeavons: An Algebraic Approach to Multi-sorted Constraints. CP 2003: 183-198
11		Ferdinand Börner, Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin: Quantified Constraints: Algorithms and Complexity. CSL 2003: 58-70
10		Andrei A. Bulatov, Víctor Dalmau: Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. FOCS 2003: 562-
9		Andrei A. Bulatov, Evgeny S. Skvortsov: Amalgams of Constraint Satisfaction Problems. IJCAI 2003: 197-202
8		Andrei A. Krokhin, Andrei A. Bulatov, Peter Jeavons: Functions of multiple-valued logic and the complexity of constraint satisfaction: A short survey. ISMVL 2003: 343-
7		Andrei A. Bulatov: Tractable conservative Constraint Satisfaction Problems. LICS 2003: 321-
6		Andrei A. Bulatov, Pawel M. Idziak: Counting Mal'tsev clones on small sets. Discrete Mathematics 268(1-3): 59-80 (2003)
	2002
5		Andrei A. Bulatov: A Dichotomy Theorem for Constraints on a Three-Element Set. FOCS 2002: 649-658
4		Andrei A. Bulatov: Tractable Constraint Satisfaction Problems on a 3-element set Electronic Colloquium on Computational Complexity (ECCC)(032): (2002)
3		Andrei A. Bulatov: Mal'tsev constraints are tractable Electronic Colloquium on Computational Complexity (ECCC)(034): (2002)
	2001
2		Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons: The complexity of maximal constraint languages. STOC 2001: 667-674
	2000
1		Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons: Constraint Satisfaction Problems and Finite Algebras. ICALP 2000: 272-282

Coauthor Index

1	Albert Atserias	[25] [26] [31]
2	Ferdinand Börner	[11] [32]
3	Hubie Chen	[15] [22] [32]
4	Víctor Dalmau	[10] [15] [19] [22] [23] [26] [33] [34]
5	Anuj Dawar	[25] [31]
6	Martin Grohe	[14] [17] [33] [34]
7	Pawel M. Idziak	[6]
8	Peter Jeavons (Peter G. Jeavons)	[1] [2] [8] [11] [12] [18] [32]
9	Andrei A. Krokhin	[1] [2] [8] [11] [18] [29] [32]
10	Benoit Larose	[29]
11	Dániel Marx	[33] [34]
12	Evgeny S. Skvortsov	[9] [21] [27]
13	Matthew Valeriote	[30]

Colors in the list of coauthors