Andrei A. Bulatov

Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx: Enumerating homomorphisms. J. Comput. Syst. Sci. 78(2): 638-650 (2012)

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)

Andrei A. Bulatov, Amir Hedayaty: Counting Problems and Clones of Functions. Multiple-Valued Logic and Soft Computing 18(2): 117-138 (2012)

Cong Wang, Andrei A. Bulatov: Greedy Algorithms, Ordering of Variables, and d-degenerate Instances. ISMVL 2012: 31-36

Andrei A. Bulatov, Amir Hedayaty: Counting Predicates, Subset Surjective Functions, and Counting CSPs. ISMVL 2012: 331-336

Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Log-supermodular functions, functional clones and counting CSPs. STACS 2012: 302-313

Andrei A. Bulatov, Dániel Marx: Constraint satisfaction parameterized by solution size. CoRR abs/1206.4854 (2012)

Andrei A. Bulatov, Amir Hedayaty: Galois correspondence for counting quantifiers. CoRR abs/1210.3344 (2012)

Cong Wang, Andrei A. Bulatov: Inferring Attitude in Online Social Networks Based On Quadratic Correlation. CoRR abs/1212.1633 (2012)

Andrei A. Bulatov: Complexity of conservative constraint satisfaction problems. ACM Trans. Comput. Log. 12(4): 24 (2011)

Andrei A. Bulatov: On the CSP Dichotomy Conjecture. CSR 2011: 331-344

Andrei A. Bulatov, Dániel Marx: Constraint Satisfaction Parameterized by Solution Size. ICALP (1) 2011: 424-436

Andrei A. Bulatov, Martin E. Dyer, Leslie Ann Goldberg, Mark Jerrum: Log-supermodular functions, functional clones and counting CSPs. CoRR abs/1108.5288 (2011)

Andrei A. Bulatov, Dániel Marx: Constraint satisfaction problems and global cardinality constraints. Commun. ACM 53(9): 99-106 (2010)

Andrei A. Bulatov, Dániel Marx: The complexity of global cardinality constraints. Logical Methods in Computer Science 6(4) (2010)

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)

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)

Albert Atserias, Andrei A. Bulatov, Anuj Dawar: Affine systems of equations and counting infinitary logic. Theor. Comput. Sci. 410(18): 1666-1683 (2009)

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)

Andrei A. Bulatov: Counting Problems and Clones of Functions. ISMVL 2009: 1-6

Andrei A. Bulatov, Dániel Marx: The Complexity of Global Cardinality Constraints. LICS 2009: 419-428

Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx: Enumerating Homomorphisms. STACS 2009: 231-242

Andrei A. Bulatov, Víctor Dalmau, Martin Grohe, Dániel Marx: Enumerating Homomorphisms. CoRR abs/0902.1256 (2009)

Andrei A. Bulatov, Matthew Valeriote: Recent Results on the Algebraic Approach to the CSP. Complexity of Constraints 2008: 68-92

Andrei A. Bulatov, Andrei A. Krokhin, Benoit Larose: Dualities for Constraint Satisfaction Problems. Complexity of Constraints 2008: 93-124

Andrei A. Bulatov: The Complexity of the Counting Constraint Satisfaction Problem. ICALP (1) 2008: 646-661

Andrei A. Bulatov, Evgeny S. Skvortsov: Phase transition for Local Search on planted SAT. CoRR abs/0811.2546 (2008)

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)

Andrei A. Bulatov, Víctor Dalmau: Towards a dichotomy theorem for the counting constraint satisfaction problem. Inf. Comput. 205(5): 651-678 (2007)

Andrei A. Bulatov, Hubie Chen, Víctor Dalmau: Learning intersection-closed classes with signatures. Theor. Comput. Sci. 382(3): 209-220 (2007)

Albert Atserias, Andrei A. Bulatov, Víctor Dalmau: On the Power of k -Consistency. ICALP 2007: 279-290

Albert Atserias, Andrei A. Bulatov, Anuj Dawar: Affine Systems of Equations and Counting Infinitary Logic. ICALP 2007: 558-570

Andrei A. Bulatov: The complexity of the counting constraint satisfaction problem. Electronic Colloquium on Computational Complexity (ECCC) 14(093) (2007)

Andrei A. Bulatov: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM 53(1): 66-120 (2006)

Andrei A. Bulatov, Víctor Dalmau: A Simple Algorithm for Mal'tsev Constraints. SIAM J. Comput. 36(1): 16-27 (2006)

Andrei A. Bulatov, Evgeny S. Skvortsov: Efficiency of Local Search. SAT 2006: 297-310

Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin: Classifying the Complexity of Constraints Using Finite Algebras. SIAM J. Comput. 34(3): 720-742 (2005)

Andrei A. Bulatov, Martin Grohe: The complexity of partition functions. Theor. Comput. Sci. 348(2-3): 148-186 (2005)

Andrei A. Bulatov: H-Coloring dichotomy revisited. Theor. Comput. Sci. 349(1): 31-39 (2005)

Andrei A. Bulatov, Hubie Chen, Víctor Dalmau: Learnability of Relatively Quantified Generalized Formulas. ALT 2004: 365-379

Andrei A. Bulatov, Martin Grohe: The Complexity of Partition Functions. ICALP 2004: 294-306

Andrei A. Bulatov: A Graph of a Relational Structure and Constraint Satisfaction Problems. LICS 2004: 448-457

Andrei A. Bulatov, Pawel M. Idziak: Counting Mal'tsev clones on small sets. Discrete Mathematics 268(1-3): 59-80 (2003)

Andrei A. Bulatov, Peter Jeavons: An Algebraic Approach to Multi-sorted Constraints. CP 2003: 183-198

Ferdinand Börner, Andrei A. Bulatov, Peter Jeavons, Andrei A. Krokhin: Quantified Constraints: Algorithms and Complexity. CSL 2003: 58-70

Andrei A. Bulatov, Víctor Dalmau: Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem. FOCS 2003: 562-571

Andrei A. Bulatov, Evgeny S. Skvortsov: Amalgams of Constraint Satisfaction Problems. IJCAI 2003: 197-202

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-

Andrei A. Bulatov: Tractable conservative Constraint Satisfaction Problems. LICS 2003: 321-

Andrei A. Bulatov: A Dichotomy Theorem for Constraints on a Three-Element Set. FOCS 2002: 649-658

Andrei A. Bulatov: Tractable Constraint Satisfaction Problems on a 3-element set. Electronic Colloquium on Computational Complexity (ECCC)(032) (2002)

Andrei A. Bulatov: Mal'tsev constraints are tractable. Electronic Colloquium on Computational Complexity (ECCC)(034) (2002)

Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons: The complexity of maximal constraint languages. STOC 2001: 667-674

Andrei A. Bulatov, Andrei A. Krokhin, Peter Jeavons: Constraint Satisfaction Problems and Finite Algebras. ICALP 2000: 272-282