Alexander Alexandrovich Razborov
Alexander Alexandrovich Razborov publishes mostly in Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics, on topics such as Complexity and Algorithms in Graphs, Advanced Graph Theory Research and Limits and Structures in Graph Theory.
- World rank
- #175,168 of 7,710,434 ranked researchers
- Rank in Russia
- #364 of 179,717
- Works
- 166
- Citations
- 6k
- Citations per work
- 36.4
What does Alexander Alexandrovich Razborov research?
Alexander Alexandrovich Razborov's work is mostly in Computer Science (62%), Mathematics (15%), Engineering (4%).
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 Sciences13480.5%
- Computer Science10362.0%
- Mathematics2414.7%
- Engineering63.8%
- Everything else3219.5%
- 1Computational Theory and Mathematics39% of their works
- 2Artificial Intelligence19% of their works
- 3Discrete Mathematics and Combinatorics8% of their works
- 4Geometry and Topology6% of their works
- 5Electrical and Electronic Engineering4% of their works
- 6Computer Networks and Communications4% of their works
Research topics
Which keywords describe Alexander Alexandrovich Razborov's research?
The keywords of their largest research topics: Algorithmic Applications, Approximation Algorithms, Combinatorial Optimization, Complexity Theory, Graph Theory, Parameterized Complexity, Model Checking and Graph Limits.
- Answer Set Programming
- Formal Verification
- Graph Spectra
- Automata
- Algorithmic Information Theory
- Graph Limits
- Parameterized Complexity
- Complexity Theory
- Approximation Algorithms
- Algorithmic Applications
- Combinatorial Optimization
- Graph Theory
- Model Checking
- Szemerédi's Theorem
- Computability
- Formal Languages
- Topological Indices
- Static Analysis
- Modal Logic
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. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 19 words, with their numbers
- Algorithmic Applications992 topics
- Approximation Algorithms992 topics
- Combinatorial Optimization571 topic
- Complexity Theory571 topic
- Graph Theory421 topic
- Parameterized Complexity421 topic
- Model Checking312 topics
- Graph Limits301 topic
- Szemerédi's Theorem301 topic
- Algorithmic Information Theory281 topic
- Computability281 topic
- Automata231 topic
- Formal Languages231 topic
- Graph Spectra191 topic
- Topological Indices191 topic
- Formal Verification171 topic
- Static Analysis171 topic
- Answer Set Programming141 topic
- Modal Logic141 topic
Where does Alexander Alexandrovich Razborov work?
Alexander Alexandrovich Razborov's main affiliation in the publication record is Steklov Mathematical Institute, Russia.
How many publications and citations does Alexander Alexandrovich Razborov have?
OpenAlex counts 166 works and 6,044 citations for Alexander Alexandrovich Razborov, an h-index of 38, ranking #175,168 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation 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.
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 Alexander Alexandrovich Razborov. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.