Andreǐ A. Bulatov
Andreǐ A. Bulatov publishes mostly in Computational Theory and Mathematics, Computer Networks and Communications and Artificial Intelligence, on topics such as Constraint Satisfaction and Optimization, Advanced Graph Theory Research and Advanced Algebra and Logic.
- World rank
- #1,288,453 of 7,710,434 ranked researchers
- Rank in Canada
- #43,628 of 183,316
- Works
- 68
- Citations
- 1.3k
- Citations per work
- 19.8
What does Andreǐ A. Bulatov research?
Andreǐ A. Bulatov's work is mostly in Computer Science (78%), Mathematics (5%), Engineering (2%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences5885.9%
- Computer Science5378.5%
- Mathematics35.1%
- Engineering22.3%
- Everything else1014.1%
- 1Computational Theory and Mathematics46% of their works
- 2Computer Networks and Communications22% of their works
- 3Artificial Intelligence11% of their works
- 4Discrete Mathematics and Combinatorics3% of their works
- 5Geometry and Topology2% of their works
- 6Industrial and Manufacturing Engineering2% of their works
Research topics
Which keywords describe Andreǐ A. Bulatov's research?
The keywords of their largest research topics: Algorithmic Applications, Approximation Algorithms, Constraint Optimization, Distributed Algorithms, Graph Theory, Parameterized Complexity, Automata and Combinatorial Optimization.
- Graph Limits
- Satisfiability Modulo Theories
- Answer Set Programming
- Formal Languages
- Model Checking
- Fuzzy Logic
- Combinatorial Optimization
- Parameterized Complexity
- Distributed Algorithms
- Approximation Algorithms
- Algorithmic Applications
- Constraint Optimization
- Graph Theory
- Automata
- Complexity Theory
- Residuated Lattices
- Temporal Logic
- Regular Expressions
- Modal Logic
- Symbolic Model Checker
- Szemerédi's Theorem
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most.
All 21 words, with their numbers
- Algorithmic Applications472 topics
- Approximation Algorithms472 topics
- Constraint Optimization381 topic
- Distributed Algorithms381 topic
- Graph Theory331 topic
- Parameterized Complexity331 topic
- Automata142 topics
- Combinatorial Optimization141 topic
- Complexity Theory141 topic
- Fuzzy Logic141 topic
- Residuated Lattices141 topic
- Model Checking132 topics
- Temporal Logic132 topics
- Formal Languages81 topic
- Regular Expressions81 topic
- Answer Set Programming71 topic
- Modal Logic71 topic
- Satisfiability Modulo Theories61 topic
- Symbolic Model Checker61 topic
- Graph Limits41 topic
- Szemerédi's Theorem41 topic
Where does Andreǐ A. Bulatov work?
Andreǐ A. Bulatov's main affiliation in the publication record is Simon Fraser University, Canada.
How many publications and citations does Andreǐ A. Bulatov have?
OpenAlex counts 68 works and 1,348 citations for Andreǐ A. Bulatov, an h-index of 16, ranking #1,288,453 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Other researchers named Andreǐ A. Bulatov
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Andreǐ A. Bulatov. Posts are plain text and can be reported.