Misha Rudnev
- Discrete Mathematics and Combinatorics top 5%
- Geometry and Topology top 10%
- Artificial Intelligence
- Algebra and Number Theory
- Computational Theory and Mathematics top 10%
- Co-authors
- Alex IosevichDerrick HartDoowon KohIlya D. ShkredovOliver Roche‐NewtonThomas Brendan MurphyMichael A. BennettJonathan Pakianathan
- Topics
- Limits and Structures in Graph Theory (13 papers)Computational Geometry and Mesh Generation (7 papers)Advanced Graph Theory Research (5 papers)
- Journals
- Transactions of the American Mathematical SocietyAdvances in MathematicsProceedings of the American Mathematical Society
- Partner nations
- United KingdomUnited StatesRussia
In The Last Decade
Misha Rudnev
19 papers receiving 193 citations
Peers
Comparison fields: 5 of 18
- Discrete Mathematics and Combinatorics 169
- Geometry and Topology 65
- Artificial Intelligence 61
- Algebra and Number Theory 60
- Computational Theory and Mathematics 40
Countries citing papers authored by Misha Rudnev
This map shows the geographic impact of Misha Rudnev'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 Misha Rudnev with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Misha Rudnev more than expected).
Fields of papers citing papers by Misha Rudnev
This network shows the impact of papers produced by Misha Rudnev. 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 Misha Rudnev. The network helps show where Misha Rudnev may publish in the future.
Co-authorship network of co-authors of Misha Rudnev
This figure shows the co-authorship network connecting the top 25 collaborators of Misha Rudnev. A scholar is included among the top collaborators of Misha Rudnev 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 Misha Rudnev. Misha Rudnev is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 7 | |
| 2 | 5 | |
| 3 | 11 | |
| 4 | 1 | |
| 5 | On growth rate in SL_2(F_p), the affine group and sum-product type implications | 2 |
| 6 | 17 | |
| 7 | 4 | |
| 8 | 5 | |
| 9 | 6 | |
| 10 | 26 | |
| 11 | 15 | |
| 12 | 13 | |
| 13 | 1 | |
| 14 | 7 | |
| 15 | Areas of rectangles and product sets of sum sets | 1 |
| 16 | 56 | |
| 17 | 14 | |
| 18 | 13 | |
| 19 | 1 |
About Misha Rudnev
Misha Rudnev is a scholar working on Discrete Mathematics and Combinatorics, Computer Graphics and Computer-Aided Design and Algebra and Number Theory, having authored 19 papers that have together received 205 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (13 papers), Computational Geometry and Mesh Generation (7 papers) and Advanced Graph Theory Research (5 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (169 citations), Algebra and Number Theory (60 citations) and Geometry and Topology (65 citations). Misha Rudnev has collaborated with scholars based in United Kingdom, United States and Russia. Frequent co-authors include Alex Iosevich, Derrick Hart, Doowon Koh, Ilya D. Shkredov, Oliver Roche‐Newton, Thomas Brendan Murphy, Michael A. Bennett, Jonathan Pakianathan, J. M. Selig and Thang Pham. Their work appears in journals such as Transactions of the American Mathematical Society, Advances in Mathematics and Proceedings of the American Mathematical Society.
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.