Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

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 25
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. V. A. Vatutin 16
13. O. A. Logachev 15
14. A. A. Makhnev 15
15. K. A. Popkov 15
16. M. P. Savelov 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 216
2. S. S. Marchenkov 182
3. V. A. Emelichev 169
4. V. I. Afanasyev 127
5. V. G. Mikhailov 125
6. Yu. L. Pavlov 106
7. E. E. Dyakonova 95
8. A. Tuganbaev 95
9. V. T. Markov 92
10. O. A. Logachev 82
11. S. N. Selezneva 74
12. V. M. Sidel'nikov 73
13. V. V. Yashchenko 71
14. A. A. Makhnev 68
15. A. L. Yakymiv 68
16. A. V. Kolchin 67
17. D. S. Romanov 66
18. V. A. Vatutin 64
19. A. A. Sapozhenko 63
20. G. D. Kilibarda 59
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 		78
2. Uniformly distributed sequences of $p$-adic integers
V. S. Anashin
Diskr. Mat., 2002, 14:4, 3–64 		51
3. Bent functions from a finite abelian group into a finite abelian group
V. I. Solodovnikov
Diskr. Mat., 2002, 14:1, 99–113 		47
4. Approximate algorithms for packing rectangles into several strips
S. N. Zhuk
Diskr. Mat., 2006, 18:1, 91–105 		39
5. Transitive polynomial transformations of residue class rings
M. V. Larin
Diskr. Mat., 2002, 14:2, 20–32 		37
6. Effective attack on the McEliece cryptosystem based on Reed–Muller codes
M. A. Borodin, I. V. Chizhov
Diskr. Mat., 2014, 26:1, 10–20 		35
7. 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
8. Properties of bent functions of $q$-valued logic over finite fields
A. S. Ambrosimov
Diskr. Mat., 1994, 6:3, 50–60 		33
9. On the expressibility of functions of many-valued logic in some logical-functional classes
S. S. Marchenkov
Diskr. Mat., 1999, 11:4, 110–126 		32
10. Linear recurrent sequences over commutative rings
A. A. Nechaev
Diskr. Mat., 1991, 3:4, 105–127 		32
11. On the number of independent sets in extenders
A. A. Sapozhenko
Diskr. Mat., 2001, 13:1, 56–62 		31
12. Open coding based on Reed–Muller binary codes
V. M. Sidel'nikov
Diskr. Mat., 1994, 6:2, 3–20 		31
13. 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 		30
14. $\Omega$-foliated formations and Fitting classes of finite groups
V. A. Vedernikov, M. M. Sorokina
Diskr. Mat., 2001, 13:3, 125–144 		30
15. 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 		30
16. 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 		29
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 		25
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 		24
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
| one week | one month | one year | all time |
1. Independent sets in graphs
A. B. Dainiak, A. A. Sapozhenko
Diskr. Mat., 2016, 28:1, 44–77 		14
2. 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 		12
3. Perfect codes in the metric of deletions and insertions
V. I. Levenshtein
Diskr. Mat., 1991, 3:1, 3–20 		12
4. Deciding multiaffinity of polynomials over a finite field
S. N. Selezneva
Diskr. Mat., 2023, 35:2, 109–124 		12
5. Invariant subspaces of circulant and recursive matrices
S. A. Davydov
Diskr. Mat., 2024, 36:4, 44–63 		12
6. Limit theorem for the distribution of the extinction time of subcritical bisexual branching process with large initial number of particles
M. R. Abdyushev
Diskr. Mat., 2024, 36:4, 3–12 		11
7. Asymptotic behavior of the survival probability of almost critical branching processes in a random environment: models and examples
V. V. Kharlamov
Diskr. Mat., 2024, 36:4, 138–157 		11
8. Repetition-free decomposition of strongly dependent functions
A. V. Cheremushkin
Diskr. Mat., 2004, 16:3, 3–42 		10
9. On the computation of logarithms on elliptic curves
I. A. Semaev
Diskr. Mat., 1996, 8:1, 65–71 		9
10. Boolean graphs and functions
V. G. Nikonov, D. S. Shevelev
Diskr. Mat., 1991, 3:4, 52–61 		9
Дискретная математика
Coverage: 1989–2024

Total publications: 1697
Scientific articles: 1649
Authors: 911
Citations: 5506
Cited articles: 1128

Impact-factor Math-Net.Ru
for 2023: 0.720
for 2022: 0.646
for 2021: 0.513
for 2020: 0.573
for 2019: 0.612
for 2018: 0.430
for 2017: 0.500
for 2016: 0.562
for 2015: 0.461
for 2014: 0.341
for 2013: 0.506
for 2012: 0.512
for 2011: 0.506
for 2010: 0.400
for 2009: 0.248
for 2008: 0.273
for 2007: 0.178
for 2006: 0.229
for 2005: 0.165
for 2004: 0.105
for 2003: 0.298

Impact Factor Web of Science
for 2023: 0.300

Scopus Metrics
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

Most published authors
Most cited authors
Most cited articles
Most requested articles
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024