Andrei A. Bulatov

	2012
49		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Log-supermodular functions, functional clones and counting CSPs. STACS 2012: 302-313
48		Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx: Enumerating homomorphisms. J. Comput. Syst. Sci. 78(2): 638-650 (2012)
47		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby: The complexity of weighted and unweighted #CSP. J. Comput. Syst. Sci. 78(2): 681-688 (2012)
46		Andrei A. Bulatov, Amir Hedayaty: Counting Problems and Clones of Functions. Multiple-Valued Logic and Soft Computing 18(2): 117-138 (2012)
	2011
45		Andrei A. Bulatov: On the CSP Dichotomy Conjecture. CSR 2011: 331-344
44		Andrei A. Bulatov, Dániel Marx: Constraint Satisfaction Parameterized by Solution Size. ICALP (1) 2011: 424-436
43		Andrei A. Bulatov: Complexity of conservative constraint satisfaction problems. ACM Trans. Comput. Log. 12(4): 24 (2011)
42		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Log-supermodular functions, functional clones and counting CSPs CoRR abs/1108.5288: (2011)
	2010
41		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, Mark Jerrum, David Richerby: The complexity of weighted and unweighted #CSP CoRR abs/1005.2678: (2010)
40		Andrei A. Bulatov, Dániel Marx: Constraint satisfaction problems and global cardinality constraints. Commun. ACM 53(9): 99-106 (2010)
39		Andrei A. Bulatov, Dániel Marx: The complexity of global cardinality constraints Logical Methods in Computer Science 6(4): (2010)
	2009
38		Andrei A. Bulatov: Counting Problems and Clones of Functions. ISMVL 2009: 1-6
37		Andrei A. Bulatov, Dániel Marx: The Complexity of Global Cardinality Constraints. LICS 2009: 419-428
36		Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx: Enumerating Homomorphisms. STACS 2009: 231-242
35		Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx: Enumerating Homomorphisms CoRR abs/0902.1256: (2009)
34		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)
33		Albert Atserias, Andrei A. Bulatov, Anuj Dawar: Affine systems of equations and counting infinitary logic. Theor. Comput. Sci. 410(18): 1666-1683 (2009)
32		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The complexity of weighted Boolean #CSP with mixed signs. Theor. Comput. Sci. 410(38-40): 3949-3961 (2009)
	2008
31		Andrei A. Bulatov, Matthew Valeriote: Recent Results on the Algebraic Approach to the CSP. Complexity of Constraints 2008: 68-92
30		Andrei A. Bulatov, Andrei A. Krokhin, Benoit Larose: Dualities for Constraint Satisfaction Problems. Complexity of Constraints 2008: 93-124
29		Andrei A. Bulatov: The Complexity of the Counting Constraint Satisfaction Problem. ICALP (1) 2008: 646-661
28		Andrei A. Bulatov, Evgeny S. Skvortsov: Phase transition for Local Search on planted SAT CoRR abs/0811.2546: (2008)
27		Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Markus Jalsenius, David Richerby: The Complexity of Weighted Boolean #CSP with Mixed Signs CoRR abs/0812.4171: (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-571
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] [33]
2	Ferdinand Börner	[11] [34]
3	Hubie Chen	[15] [22] [34]
4	Víctor Dalmau	[10] [15] [19] [22] [23] [26] [35] [36] [48]
5	Anuj Dawar	[25] [33]
6	Martin E. Dyer	[27] [32] [41] [42] [47] [49]
7	Leslie Ann Goldberg	[27] [32] [41] [42] [47] [49]
8	Martin Grohe	[14] [17] [35] [36] [48]
9	Amir Hedayaty	[46]
10	Pawel M. Idziak	[6]
11	Markus Jalsenius	[27] [32] [41] [47]
12	Peter Jeavons (Peter G. Jeavons)	[1] [2] [8] [11] [12] [18] [34]
13	Mark Jerrum	[41] [42] [47] [49]
14	Andrei A. Krokhin	[1] [2] [8] [11] [18] [30] [34]
15	Benoit Larose	[30]
16	Dániel Marx	[35] [36] [37] [39] [40] [44] [48]
17	David Richerby	[27] [32] [41] [47]
18	Evgeny S. Skvortsov	[9] [21] [28]
19	Matthew Valeriote	[31]

Colors in the list of coauthors

Last update Sun May 27 04:04:01 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page