Alexander Razborov

5.9k total citations
97 papers, 2.7k citations indexed

About

Alexander Razborov is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Alexander Razborov has authored 97 papers receiving a total of 2.7k indexed citations (citations by other indexed papers that have themselves been cited), including 74 papers in Computational Theory and Mathematics, 43 papers in Artificial Intelligence and 21 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Alexander Razborov's work include Complexity and Algorithms in Graphs (37 papers), Advanced Graph Theory Research (27 papers) and Limits and Structures in Graph Theory (18 papers). Alexander Razborov is often cited by papers focused on Complexity and Algorithms in Graphs (37 papers), Advanced Graph Theory Research (27 papers) and Limits and Structures in Graph Theory (18 papers). Alexander Razborov collaborates with scholars based in Russia, United States and Israel. Alexander Razborov's 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 and has published in prestigious journals such as Journal of the ACM, Annals of Mathematics and SIAM Journal on Computing.

In The Last Decade

Alexander Razborov

89 papers receiving 2.3k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Alexander Razborov Russia	27	2.2k	1.5k	504	363	287	97	2.7k
Eugene M. Luks United States	20	792 0.4×	792 0.5×	534 1.1×	312 0.9×	351 1.2×	58	1.7k
R. Wilson United States	16	780 0.4×	740 0.5×	885 1.8×	515 1.4×	636 2.2×	25	2.0k
Richard J. Nowakowski Canada	19	1.0k 0.5×	367 0.2×	344 0.7×	371 1.0×	114 0.4×	111	1.5k
Frank Ruskey Canada	21	681 0.3×	643 0.4×	378 0.8×	85 0.2×	247 0.9×	84	1.3k
Michael Krivelevich Israel	29	2.2k 1.0×	571 0.4×	1.5k 3.0×	746 2.1×	312 1.1×	203	3.0k
Jin‐Yi Cai United States	25	1.5k 0.7×	1.1k 0.7×	196 0.4×	135 0.4×	121 0.4×	174	2.3k
Joachim von zur Gathen Germany	23	1.1k 0.5×	1.2k 0.8×	120 0.2×	268 0.7×	246 0.9×	102	2.0k
James B. Shearer United States	17	632 0.3×	337 0.2×	452 0.9×	280 0.8×	406 1.4×	50	1.3k
James Oxley United States	19	1.2k 0.5×	223 0.2×	547 1.1×	257 0.7×	657 2.3×	142	1.6k
Luca Trevisan United States	28	1.8k 0.8×	1.3k 0.9×	127 0.3×	103 0.3×	206 0.7×	117	2.5k

Countries citing papers authored by Alexander Razborov

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Razborov, Alexander, et al.. (2023). Natural quasirandomness properties. Random Structures and Algorithms. 63(3). 624–688.

Razborov, Alexander, et al.. (2023). Space characterizations of complexity measures and size-space trade-offs in propositional proof systems. Journal of Computer and System Sciences. 137. 20–36.

Razborov, Alexander. (2015). An Ultimate Trade-Off in Propositional Proof Complexity.. Electronic colloquium on computational complexity. 22. 33. 1 indexed citations

Hatami, Hamed, Jan Hladký, Daniel Král͏̌, Serguei Norine, & Alexander Razborov. (2013). On the number of pentagons in triangle-free graphs. Journal of Combinatorial Theory Series A. 120(3). 722–732. 66 indexed citations

Razborov, Alexander. (2012). On the Caccetta-Häggkvist Conjecture with Forbidden Subgraphs. Journal of Graph Theory. 74(2). 236–248. 12 indexed citations

Beklemishev, Lev D., et al.. (2011). Sergei Ivanovich Adian (on his eightieth birthday). Russian Mathematical Surveys. 66(1). 197–198. 1 indexed citations

Razborov, Alexander. (2008). On the Minimal Density of Triangles in Graphs. Combinatorics Probability Computing. 17(4). 603–618. 90 indexed citations

Razborov, Alexander & Alexander A. Sherstov. (2008). The Sign-Rank of AC^0.. Electronic colloquium on computational complexity. 15. 1 indexed citations

Guruswami, Venkatesan, et al.. (2008). Almost Euclidean subspaces of e N 1 via expander codes. Symposium on Discrete Algorithms. 353–362. 21 indexed citations

10.

Guruswami, Venkatesan, et al.. (2007). Almost Euclidean subspaces of ℓ 1 N via expander codes.. 14. 2 indexed citations

11.

Razborov, Alexander & Sergey Yekhanin. (2007). . Theory of Computing. 3(1). 221–238. 9 indexed citations

12.

Razborov, Alexander. (2004). An upper bound on the threshold quantum decoherence rate. Quantum Information and Computation. 4(3). 222–228. 11 indexed citations

13.

Razborov, Alexander. (2004). Resolution lower bounds for perfect matching principles. Journal of Computer and System Sciences. 69(1). 3–27. 21 indexed citations

14.

Razborov, Alexander. (2003). Resolution lower bounds for the weak functional pigeonhole principle. Theoretical Computer Science. 303(1). 233–243. 4 indexed citations

15.

Razborov, Alexander. (2001). Improved Resolution Lower Bounds for the Weak Pigeonhole Principle. Electronic colloquium on computational complexity. 8. 17 indexed citations

16.

Alekhnovich, Michael, Eli Ben‐Sasson, Alexander Razborov, & Avi Wigderson. (2000). Pseudorandom Generators in Propositional Proof Complexity. Electronic colloquium on computational complexity. 7. 2 indexed citations

17.

Razborov, Alexander & Steven Rudich. (1997). Natural Proofs. Journal of Computer and System Sciences. 55(1). 24–35. 238 indexed citations

18.

Papadimitriou, Christos H., Oded Goldreich, Avi Wigderson, Alexander Razborov, & Michael Sipser. (1996). The future of computational complexity theory: part I. ACM SIGACT News. 27(3). 6–12. 1 indexed citations

19.

Razborov, Alexander. (1992). On the distributional complexity of disjointness. Theoretical Computer Science. 106(2). 385–390. 235 indexed citations

20.

Razborov, Alexander. (1990). Applications of matrix methods to the theory of lower bounds in computational complexity. COMBINATORICA. 10(1). 81–93. 68 indexed citations

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.

Explore authors with similar magnitude of impact