Д. О. Ревин

688 citations
63 papers · 378 indexed · h-index 12
Topics
Finite Group Theory Research (61 papers)Coding theory and cryptography (46 papers)graph theory and CDMA systems (16 papers)
Partner nations
RussiaChinaBelarus

In The Last Decade

Д. О. Ревин

52 papers receiving 345 citations

Peers

Д. О. Ревин
Comparison fields: 5 of 14
  • Discrete Mathematics and Combinatorics 370
  • Artificial Intelligence 306
  • Electrical and Electronic Engineering 137
  • Geometry and Topology 102
  • Mathematical Physics 72
Replace John N. Bray with:
John N. Bray United Kingdom
Silvio Dolfi Italy
R. Esteban‐Romero Spain
В. Д. Мазуров Russia
Martin Hertweck Germany
Jianbei An New Zealand
Ulrich Dempwolff Germany
Luis M. Ezquerro Spain
M. A. Grechkoseeva Russia
Timothy C. Burness United Kingdom
Д. О. Ревин relative to John N. Bray United Kingdom John N. Bray's profile →
Citations per field
00.5×3.1×
John N. Bray · 1×
Citations per year

Countries citing papers authored by Д. О. Ревин

Since Specialization
Citations

This map shows the geographic impact of Д. О. Ревин'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 Д. О. Ревин with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Д. О. Ревин more than expected).

Fields of papers citing papers by Д. О. Ревин

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Д. О. Ревин. 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 Д. О. Ревин. The network helps show where Д. О. Ревин may publish in the future.

Co-authorship network of co-authors of Д. О. Ревин

This figure shows the co-authorship network connecting the top 25 collaborators of Д. О. Ревин. A scholar is included among the top collaborators of Д. О. Ревин 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 Д. О. Ревин. Д. О. Ревин is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
#WorkIndexed citations
1 0
2 0
3 0
4 1
5 0
6 1
7 2
8 1
9 1
10 1
11 0
12 0
13
Finite groups in which the $\X$-maximal subgroups are conjugate
1
14 1
15 2
16 5
17 3
18 31
19 9
20 7

About Д. О. Ревин

Д. О. Ревин is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology and Algebra and Number Theory, having authored 63 papers that have together received 378 indexed citations. Recurring topics across this work include Finite Group Theory Research (61 papers), Coding theory and cryptography (46 papers) and graph theory and CDMA systems (16 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (370 citations), Geometry and Topology (102 citations) and Artificial Intelligence (306 citations). Д. О. Ревин has collaborated with scholars based in Russia, China and Belarus. Frequent co-authors include E. P. Vdovin, Wenbin Guo, А. С. Кондратьев, Ning Yang, Andrei V. Zavarnitsine, В. С. Монахов, Wang Zh, A. V. Vasil’ev and Wu Guo. Their work appears in journals such as Journal of Algebra, Russian Mathematical Surveys and Israel Journal of Mathematics.

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

Rankless by CCL
2026