|
Most published authors (scientific articles only) of the journal
scientific articles published in peer review journal, serial, conference publications, indexed in international bibliographical databases and/or having DOI index
|
1. |
S. S. Marchenkov |
41 |
2. |
A. N. Timashev |
29 |
3. |
V. G. Mikhailov |
27 |
4. |
V. A. Emelichev |
26 |
5. |
Yu. L. Pavlov |
26 |
6. |
V. I. Afanasyev |
20 |
7. |
S. N. Selezneva |
20 |
8. |
G. I. Ivchenko |
19 |
9. |
V. P. Chistyakov |
18 |
10. |
E. E. Dyakonova |
17 |
11. |
A. M. Zubkov |
17 |
12. |
M. P. Savelov |
17 |
13. |
V. A. Vatutin |
16 |
14. |
O. A. Logachev |
16 |
15. |
A. A. Makhnev |
15 |
16. |
K. A. Popkov |
15 |
17. |
A. Tuganbaev |
15 |
18. |
È. È. Gasanov |
14 |
19. |
A. A. Nechaev |
14 |
20. |
B. A. Sevast'yanov |
14 |
21. |
B. I. Selivanov |
14 |
22. |
M. I. Tikhomirova |
14 |
23. |
A. V. Chashkin |
14 |
|
40 most published authors of the journal |
|
Most cited authors of the journal |
1. |
A. A. Nechaev |
217 |
2. |
S. S. Marchenkov |
194 |
3. |
V. A. Emelichev |
170 |
4. |
V. I. Afanasyev |
134 |
5. |
V. G. Mikhailov |
126 |
6. |
Yu. L. Pavlov |
112 |
7. |
E. E. Dyakonova |
97 |
8. |
A. Tuganbaev |
95 |
9. |
V. T. Markov |
92 |
10. |
O. A. Logachev |
90 |
11. |
S. N. Selezneva |
85 |
12. |
V. V. Yashchenko |
79 |
13. |
M. P. Savelov |
74 |
14. |
V. M. Sidel'nikov |
74 |
15. |
A. A. Makhnev |
70 |
16. |
D. S. Romanov |
69 |
17. |
A. L. Yakymiv |
68 |
18. |
A. V. Kolchin |
67 |
19. |
V. A. Vatutin |
66 |
20. |
A. A. Sapozhenko |
65 |
|
40 most cited authors of the journal |
|
Most cited articles of the journal |
1. |
Kerdock's code in cyclic form A. A. Nechaev Diskr. Mat., 1989, 1:4, 123–139 |
79 |
2. |
Uniformly distributed sequences of $p$-adic integers V. S. Anashin Diskr. Mat., 2002, 14:4, 3–64 |
52 |
3. |
Bent functions from a finite abelian group into a finite abelian group V. I. Solodovnikov Diskr. Mat., 2002, 14:1, 99–113 |
50 |
4. |
Approximate algorithms for packing rectangles into several strips S. N. Zhuk Diskr. Mat., 2006, 18:1, 91–105 |
39 |
5. |
Effective attack on the McEliece cryptosystem based on Reed–Muller codes M. A. Borodin, I. V. Chizhov Diskr. Mat., 2014, 26:1, 10–20 |
38 |
6. |
Transitive polynomial transformations of residue class rings M. V. Larin Diskr. Mat., 2002, 14:2, 20–32 |
37 |
7. |
Properties of bent functions of $q$-valued logic over finite fields A. S. Ambrosimov Diskr. Mat., 1994, 6:3, 50–60 |
35 |
8. |
On the expressibility of functions of many-valued logic in some logical-functional classes S. S. Marchenkov Diskr. Mat., 1999, 11:4, 110–126 |
33 |
9. |
Bent functions on a finite abelian group O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko Diskr. Mat., 1997, 9:4, 3–20 |
33 |
10. |
Linear recurrent sequences over commutative rings A. A. Nechaev Diskr. Mat., 1991, 3:4, 105–127 |
32 |
11. |
On large deviations of branching processes in a random environment: a geometric distribution of the number of descendants M. V. Kozlov Diskr. Mat., 2006, 18:2, 29–47 |
31 |
12. |
On the number of independent sets in extenders A. A. Sapozhenko Diskr. Mat., 2001, 13:1, 56–62 |
31 |
13. |
Open coding based on Reed–Muller binary codes V. M. Sidel'nikov Diskr. Mat., 1994, 6:2, 3–20 |
31 |
14. |
On an encoding system constructed on the basis of generalized Reed–Solomon codes V. M. Sidel'nikov, S. O. Shestakov Diskr. Mat., 1992, 4:3, 57–63 |
31 |
15. |
Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements Yu. V. Borodina, P. A. Borodin Diskr. Mat., 2010, 22:3, 127–133 |
30 |
16. |
$\Omega$-foliated formations and Fitting classes of finite groups V. A. Vedernikov, M. M. Sorokina Diskr. Mat., 2001, 13:3, 125–144 |
30 |
17. |
On limit theorems for the generalised allocation scheme A. V. Kolchin Diskr. Mat., 2003, 15:4, 148–157 |
28 |
18. |
Method of synthesis of easily testable circuits admitting single fault detection tests of constant length D. S. Romanov Diskr. Mat., 2014, 26:2, 100–130 |
26 |
19. |
A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem V. A. Emelichev, K. G. Kuz'min Diskr. Mat., 2007, 19:3, 79–83 |
25 |
20. |
On the synthesis of circuits admitting complete fault detection test sets of constant length under arbitrary constant faults at the outputs of the gates D. S. Romanov Diskr. Mat., 2013, 25:2, 104–120 |
23 |
21. |
Exact relation between nonlinearity and algebraic immunity M. S. Lobanov Diskr. Mat., 2006, 18:3, 152–159 |
23 |
|
40 most cited articles of the journal |
|
Most requested articles of the journal |
|
|
1. |
Independent sets in graphs A. B. Dainiak, A. A. Sapozhenko Diskr. Mat., 2016, 28:1, 44–77 | 64 |
2. |
On the number of sum-free sets in an interval of natural numbers K. G. Omel'yanov, A. A. Sapozhenko Diskr. Mat., 2002, 14:3, 3–7 | 42 |
3. |
Equational closure S. S. Marchenkov Diskr. Mat., 2005, 17:2, 117–126 | 35 |
4. |
On distance-regular graphs $\Gamma$ of diameter 3 for which $\Gamma_3$ is a triangle-free graph A. A. Makhnev, Venbin Guo Diskr. Mat., 2021, 33:4, 61–67 | 35 |
5. |
The lattices of $n$-multiply $\Omega_1$-foliated $\tau$-closed formations of multioperator $T$-groups E. N. Demina Diskr. Mat., 2012, 24:1, 3–25 | 34 |
6. |
On small distance-regular graphs with the intersection arrays $\{mn-1,(m-1)(n+1)$, $n-m+1;1,1,(m-1)(n+1)\}$ A. A. Makhnev, M. P. Golubyatnikov Diskr. Mat., 2022, 34:1, 76–87 | 29 |
7. |
Hyperbolicity of some 2-generator groups with one defining condition N. B. Bezverkhnyaya Diskr. Mat., 2002, 14:3, 54–69 | 27 |
8. |
Cycle structure of power mappings in a residue classes ring V. E. Tarakanov, A. M. Zubkov Diskr. Mat., 2013, 25:2, 39–62 | 27 |
9. |
Maximally nonlinear functions over finite fields V. G. Ryabov Diskr. Mat., 2021, 33:1, 47–63 | 27 |
10. |
On the number of bijunctive functions that are invariant under a given permutation P. V. Roldugin, A. V. Tarasov Diskr. Mat., 2002, 14:3, 23–41 | 25 |
|
Total publications: |
1715 |
Scientific articles: |
1667 |
Authors: |
917 |
Citations: |
5736 |
Cited articles: |
1159 |
 |
Impact Factor Web of Science |
|
for 2024:
0.300 |
|
for 2023:
0.300 |
 |
Scopus Metrics |
|
2024 |
SJR |
0.195 |
|
2023 |
CiteScore |
0.600 |
|
2023 |
SNIP |
0.704 |
|
2023 |
SJR |
0.177 |
|
2022 |
SJR |
0.265 |
|
2021 |
SJR |
0.226 |
|
2020 |
SJR |
0.254 |
|
2019 |
SJR |
0.157 |
|
2018 |
CiteScore |
0.440 |
|
2018 |
SJR |
0.325 |
|
2017 |
CiteScore |
0.210 |
|
2017 |
SNIP |
0.548 |
|
2017 |
SJR |
0.204 |
|
2016 |
CiteScore |
0.160 |
|
2016 |
SNIP |
0.557 |
|
2016 |
SJR |
0.245 |
|
2015 |
CiteScore |
0.230 |
|
2015 |
SNIP |
0.507 |
|
2015 |
IPP |
0.227 |
|
2015 |
SJR |
0.278 |
|
2014 |
CiteScore |
0.130 |
|
2014 |
SNIP |
0.664 |
|
2014 |
SJR |
0.204 |
|
2013 |
SNIP |
0.034 |
|
2013 |
IPP |
0.019 |
|
2013 |
SJR |
0.142 |
|
2012 |
SNIP |
0.333 |
|
2012 |
IPP |
0.143 |
|
2012 |
SJR |
0.238 |
|