Andrei A. Bulatov

SIAM journal on computing (Print) · 2005–2017

A researcher in the Science corpus: 4 papers; trusts 9 researchers and is trusted by 1 researcher here, as inferred from the citation graph.

Whom Andrei A. Bulatov trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Peter G. Jeavons
2. Omer Reingold
3. David S. Johnson
4. Andrei A. Krokhin
5. Sanjeev Khanna
6. H. Nader
7. Ralph McKenzie
8. Petar Markovic
9. Madhu Sudan

Who trusts Andrei A. Bulatov overall

1. Dmitriy Zhuk
2. Tomáš Werner
3. Sebastian Nowozin

Papers from Andrei A. Bulatov's perspective

Ordered by how strongly the researchers Andrei A. Bulatov trusts endorse each paper. Same corpus, a different order for every researcher.

1. I Computational Complexity
2. Constraints
3. The NP-Completeness Column: An Ongoing Guide
4. Varieties with few subalgebras of powers
5. Algebraic structures in combinatorial problems
6. Undirected connectivity in log-space (JACM)
7. Complexity classifications of Boolean constraint satisfaction problems (SIAM monographs on discrete mathematics and applications)
8. Calibrating Noise to Sensitivity in Private Data Analysis
9. Differential Privacy: A Survey of Results
10. Classifying the Complexity of Constraints Using Finite Algebras (SIAM journal on computing (Print))

Their papers

• A dichotomy theorem for constraint satisfaction problems on a 3-element set (2006) — 337 citations
• A Dichotomy Theorem for Nonuniform CSPs (2017) — 506 citations
• Combinatorial problems raised from 2-semilattices (2006) — 59 citations
• Classifying the Complexity of Constraints Using Finite Algebras (2005) — 604 citations