Andrei Bulatov

Andrei Bulatov

Simon Fraser University

H-index: 36

North America-Canada

About Andrei Bulatov

Andrei Bulatov, With an exceptional h-index of 36 and a recent h-index of 17 (since 2020), a distinguished researcher at Simon Fraser University, specializes in the field of Constraint Satisfaction Problem, computational counting, random CSP, universal algebra.

His recent articles reflect a diverse array of research interests and contributions to the field:

Satisfiability of commutative vs. non-commutative CSPs

Complexity Column

The ideal membership problem and abelian groups

Analysis of Pure Literal Elimination Rule for Non-uniform Random (MAX) k-SAT Problem with an Arbitrary Degree Distribution

Complexity classification of counting graph homomorphisms modulo a prime number

On the complexity of csp-based ideal membership problems

Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras

Dismantlability, connectedness, and mixing in relational structures

Andrei Bulatov Information

University

Position

___

Citations(all)

5285

Citations(since 2020)

1315

Cited By

4738

hIndex(all)

36

hIndex(since 2020)

17

i10Index(all)

60

i10Index(since 2020)

29

Email

University Profile Page

Simon Fraser University

Google Scholar

View Google Scholar Profile

Andrei Bulatov Skills & Research Interests

Constraint Satisfaction Problem

computational counting

random CSP

universal algebra

Top articles of Andrei Bulatov

Title

Journal

Author(s)

Publication Date

Satisfiability of commutative vs. non-commutative CSPs

arXiv preprint arXiv:2404.11709

Andrei A Bulatov

Stanislav Živný

2024/4/17

Complexity Column

ACM SIGLOG News

Neil Immerman

2020/11/16

The ideal membership problem and abelian groups

arXiv preprint arXiv:2201.05218

Andrei A Bulatov

Akbar Rafiey

2022/1/13

Analysis of Pure Literal Elimination Rule for Non-uniform Random (MAX) k-SAT Problem with an Arbitrary Degree Distribution

Proceedings of the AAAI Conference on Artificial Intelligence

Oleksii Omelchenko

Andrei A Bulatov

2022/6/28

Complexity classification of counting graph homomorphisms modulo a prime number

Andrei A Bulatov

Amirhossein Kazeminia

2022/6/9

On the complexity of csp-based ideal membership problems

Andrei A Bulatov

Akbar Rafiey

2022/6/9

Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras

arXiv e-prints

Libor Barto

Zarathustra Brady

Andrei Bulatov

Marcin Kozik

Dmitriy Zhuk

2021/4

Dismantlability, connectedness, and mixing in relational structures

Journal of Combinatorial Theory, Series B

Raimundo Briceño

Andrei Bulatov

Víctor Dalmau

Benoît Larose

2021/3/1

Satisfiability threshold for power law random 2-SAT in configuration model

Theoretical Computer Science

Oleksii Omelchenko

Andrei A Bulatov

2021/10/4

Symmetries and Complexity (Invited Talk)

Andrei A Bulatov

2021

Minimal taylor algebras as a common framework for the three algebraic approaches to the CSP

Libor Barto

Zarathustra Brady

Andrei Bulatov

Marcin Kozik

Dmitriy Zhuk

2021/6/29

Preprint: Algebra of Modular Systems: Containment and Equivalence

Andrei Bulatov

Eugenia Ternovska

2021

Algebra of Modular Systems: Containment and Equivalence

Proceedings of the AAAI Conference on Artificial Intelligence

Andrei Bulatov

Eugenia Ternovska

2021/5/18

Satisfiability and Algorithms for Non-uniform Random k-SAT

Proceedings of the AAAI Conference on Artificial Intelligence

Oleksii Omelchenko

Andrei Bulatov

2021/5/18

Separation of congruence intervals and implications

arXiv preprint arXiv:2007.07237

Andrei A Bulatov

2020/7/12

Local structure of idempotent algebras I

arXiv preprint arXiv:2006.09599

Andrei A Bulatov

2020/6/17

Approximate counting CSP seen from the other side

ACM Transactions on Computation Theory (TOCT)

Andrei A Bulatov

Stanislav Živný

2020/5/7

Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin

Journal of Computer and System Sciences

Miriam Backens

Andrei Bulatov

Leslie Ann Goldberg

Colin McQuillan

Stanislav Živný

2020/5/1

Counting homomorphisms in plain exponential time

Andrei A Bulatov

Amineh Dadsetan

2020

A dichotomy theorem for nonuniform CSPs simplified

arXiv preprint arXiv:2007.09099

Andrei A Bulatov

2020/7/16

See List of Professors in Andrei Bulatov University(Simon Fraser University)