Alexander Razborov
- Computational Theory and Mathematics top 0.1%
- Artificial Intelligence top 0.5%
- Discrete Mathematics and Combinatorics top 1%
- Geometry and Topology top 2%
- Electrical and Electronic Engineering
- Co-authors
- Steven RudichAvi WigdersonM. AlekhnovichMikael GoldmannVladimir LifschitzAlexander A. SherstovMichael AlekhnovichD. Grigoriev
- Topics
- Complexity and Algorithms in Graphs (37 papers)Advanced Graph Theory Research (27 papers)Limits and Structures in Graph Theory (18 papers)
- Cited by
- Discrete Mathematics and CombinatoricsComputational Theory and MathematicsArtificial Intelligence
- Partner nations
- RussiaUnited StatesIsrael
In The Last Decade
Alexander Razborov
89 papers receiving 2.3k citations
Peers
Comparison fields: 5 of 65
- Computational Theory and Mathematics 2.2k
- Artificial Intelligence 1.5k
- Discrete Mathematics and Combinatorics 504
- Geometry and Topology 363
- Electrical and Electronic Engineering 287
Countries citing papers authored by Alexander Razborov
This map shows the geographic impact of Alexander Razborov's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Alexander Razborov with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Alexander Razborov more than expected).
Fields of papers citing papers by Alexander Razborov
This network shows the impact of papers produced by Alexander Razborov. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Alexander Razborov. The network helps show where Alexander Razborov may publish in the future.
Co-authorship network of co-authors of Alexander Razborov
This figure shows the co-authorship network connecting the top 25 collaborators of Alexander Razborov. A scholar is included among the top collaborators of Alexander Razborov based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Alexander Razborov. Alexander Razborov is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 0 | |
| 2 | 0 | |
| 3 | An Ultimate Trade-Off in Propositional Proof Complexity. | 1 |
| 4 | 66 | |
| 5 | 12 | |
| 6 | 1 | |
| 7 | 90 | |
| 8 | The Sign-Rank of AC^0. | 1 |
| 9 | Almost Euclidean subspaces of e N 1 via expander codes | 21 |
| 10 | Almost Euclidean subspaces of ℓ 1 N via expander codes. | 2 |
| 11 | 9 | |
| 12 | 11 | |
| 13 | 21 | |
| 14 | 4 | |
| 15 | Improved Resolution Lower Bounds for the Weak Pigeonhole Principle | 17 |
| 16 | Pseudorandom Generators in Propositional Proof Complexity | 2 |
| 17 | 238 | |
| 18 | 1 | |
| 19 | 235 | |
| 20 | 68 |
About Alexander Razborov
Alexander Razborov is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics and Geometry and Topology, having authored 97 papers that have together received 2.7k indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (37 papers), Advanced Graph Theory Research (27 papers) and Limits and Structures in Graph Theory (18 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (504 citations), Computational Theory and Mathematics (2.2k citations) and Artificial Intelligence (1.5k citations). Alexander Razborov has collaborated with scholars based in Russia, United States and Israel. Frequent co-authors include Steven Rudich, Avi Wigderson, M. Alekhnovich, Mikael Goldmann, Vladimir Lifschitz, Alexander A. Sherstov, Michael Alekhnovich, D. Grigoriev, Roman Smolensky and Allan Borodin. Their work appears in journals such as Journal of the ACM, Annals of Mathematics and SIAM Journal on Computing.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.