default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Andrei A. Bulatov
aka: Andrei Bulatov 0001
Simon Fraser University, School of Computing Science, Burnaby, Canada
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 126 matches
- 2024
- Andrei Bulatov:
Complexity Column. ACM SIGLOG News 11(2): 34 (2024) - Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk:
Unifying the Three Algebraic Approaches to the CSP via Minimal Taylor Algebras. TheoretiCS 3 (2024) - Andrei A. Bulatov, Stanislav Zivný:
Satisfiability of commutative vs. non-commutative CSPs. CoRR abs/2404.11709 (2024) - 2023
- Andrei Bulatov:
Complexity Column. ACM SIGLOG News 10(4): 2 (2023) - 2022
- Andrei Bulatov:
Complexity column. ACM SIGLOG News 9(3): 29 (2022) - Oleksii Omelchenko, Andrei A. Bulatov:
Analysis of Pure Literal Elimination Rule for Non-uniform Random (MAX) k-SAT Problem with an Arbitrary Degree Distribution. AAAI 2022: 3804-3812 - Andrei A. Bulatov, Akbar Rafiey:
The Ideal Membership Problem and Abelian Groups. STACS 2022: 18:1-18:16 - Andrei A. Bulatov, Amirhossein Kazeminia:
Complexity classification of counting graph homomorphisms modulo a prime number. STOC 2022: 1024-1037 - Andrei A. Bulatov, Akbar Rafiey:
On the complexity of CSP-based ideal membership problems. STOC 2022: 436-449 - Andrei A. Bulatov, Akbar Rafiey:
The Ideal Membership Problem and Abelian Groups. CoRR abs/2201.05218 (2022) - 2021
- Raimundo Briceño, Andrei Bulatov, Víctor Dalmau, Benoît Larose:
Dismantlability, connectedness, and mixing in relational structures. J. Comb. Theory B 147: 37-70 (2021) - Oleksii Omelchenko, Andrei A. Bulatov:
Satisfiability threshold for power law random 2-SAT in configuration model. Theor. Comput. Sci. 888: 70-94 (2021) - Andrei Bulatov, Eugenia Ternovska:
Algebra of Modular Systems: Containment and Equivalence. AAAI 2021: 6235-6243 - Oleksii Omelchenko, Andrei Bulatov:
Satisfiability and Algorithms for Non-uniform Random k-SAT. AAAI 2021: 3886-3894 - Andrei A. Bulatov:
Symmetries and Complexity (Invited Talk). ICALP 2021: 2:1-2:17 - Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk:
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP. LICS 2021: 1-13 - Libor Barto, Zarathustra Brady, Andrei Bulatov, Marcin Kozik, Dmitriy Zhuk:
Minimal Taylor Algebras as a Common Framework for the Three Algebraic Approaches to the CSP. CoRR abs/2104.11808 (2021) - Andrei A. Bulatov, Amirhossein Kazeminia:
Complexity classification of counting graph homomorphisms modulo a prime number. CoRR abs/2106.04086 (2021) - 2020
- Miriam Backens, Andrei Bulatov, Leslie Ann Goldberg, Colin McQuillan, Stanislav Zivný:
Boolean approximate counting CSPs with weak conservativity, and implications for ferromagnetic two-spin. J. Comput. Syst. Sci. 109: 95-125 (2020) - Andrei A. Bulatov, Stanislav Zivný:
Approximate Counting CSP Seen from the Other Side. ACM Trans. Comput. Theory 12(2): 11:1-11:19 (2020) - Andrei A. Bulatov, Amineh Dadsetan:
Counting Homomorphisms in Plain Exponential Time. ICALP 2020: 21:1-21:18 - Andrei A. Bulatov:
Local structure of idempotent algebras I. CoRR abs/2006.09599 (2020) - Andrei A. Bulatov:
Local structure of idempotent algebras II. CoRR abs/2006.10239 (2020) - Andrei A. Bulatov:
Graphs of relational structures: restricted types. CoRR abs/2006.11713 (2020) - Andrei A. Bulatov:
A dichotomy theorem for nonuniform CSPs simplified. CoRR abs/2007.09099 (2020) - Andrei A. Bulatov, Akbar Rafiey:
On the Complexity of CSP-based Ideal Membership Problems. CoRR abs/2011.03700 (2020) - 2019
- Andrei A. Bulatov:
Constraint Satisfaction Problems over semilattice block Mal'tsev algebras. Inf. Comput. 268 (2019) - Andrei Bulatov, Peter Mayr, Ágnes Szendrei:
The Subpower Membership Problem for Finite Algebras with Cube Terms. Log. Methods Comput. Sci. 15(1) (2019) - Raimundo Briceño, Andrei A. Bulatov, Víctor Dalmau, Benoît Larose:
Dismantlability, Connectedness, and Mixing in Relational Structures. ICALP 2019: 29:1-29:15 - Andrei A. Bulatov:
A short story of the CSP dichotomy conjecture. LICS 2019: 1
skipping 96 more matches
loading more results
failed to load more results, please try again later
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2025-01-21 09:41 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint