|
2-years impact-factor Math-Net.Ru of «Prikladnaya Diskretnaya Matematika» journal, 2019
2-years impact-factor Math-Net.Ru of the journal in 2019 is calculated
as the number of citations in 2019 to the scientific papers published during
2017–2018.
The table below contains the list of citations in 2019 to the papers
published in 2017–2018. We take into account all citing publications
we found from different sources, mostly from references lists available
on Math-Net.Ru. Both original and translation versions are taken into account.
The impact factor Math-Net.Ru may change when new citations to a year
given are found.
| Year |
2-years impact-factor Math-Net.Ru |
Scientific papers |
Citations |
Citated papers |
Journal Self-citations |
| 2019 |
0.474 |
78 |
37 |
22 |
48.6% |
|
|
|
| N |
Citing pulication |
|
Cited paper |
|
| 1. |
Y. V. Kosolapov, O. Y. Turchenko, “On the construction of a semantically secure modification of the McEliece cryptosystem”, PDM, 2019, № 45, 33–43  |
→ |
Application of one method of linear code recognition to the wire-tap channel Y. V. Kosolapov, O. Y. Turchenko Prikl. Diskr. Mat., 2017, no. 35, 76–88
|
|
| 2. |
Ya. E. Avezova, “Svoistva primitivnykh mnozhestv orientirovannykh grafov s obschim mnozhestvom konturov”, PDM, 2019, № 43, 101–114  |
→ |
Conditions of primitivity and exponent bounds for sets of digraphs Y. E. Avezova, V. M. Fomichev Prikl. Diskr. Mat., 2017, no. 35, 89–101
|
|
| 3. |
A. V. Seliverstov, “O dvoichnykh resheniyakh sistem uravnenii”, PDM, 2019, № 45, 26–32  |
→ |
On generic NP-completeness of the Boolean satisfiability problem A. N. Rybalov Prikl. Diskr. Mat., 2017, no. 36, 106–112
|
|
| 4. |
E. M. Melnichuk, S. A. Novoselov, “Kharakteristicheskie mnogochleny nekotorykh giperellipticheskikh krivykh rodov $2,3$ i $p$-ranga $1$”, PDM. Prilozhenie, 2019, № 12, 21–24  |
→ |
Hyperelliptic curves, Cartier--Manin matrices and Legendre polynomials S. A. Novoselov Prikl. Diskr. Mat., 2017, no. 37, 20–31
|
|
| 5. |
V. A. Romankov, “Effektivnye metody algebraicheskogo kriptoanaliza i zaschita ot nikh”, PDM. Prilozhenie, 2019, № 12, 117–125  |
→ |
General algebraic cryptographic key exchange scheme and its cryptanalysis V. A. Roman'kov, A. A. Obzor Prikl. Diskr. Mat., 2017, no. 37, 52–61
|
|
| 6. |
V V Kishkan, K V Safonov, R Yu Tsarev, “Syntactical analysis of context-free languages taking into account order of application of productions”, J. Phys.: Conf. Ser., 1333:3 (2019), 032072  |
→ |
On application of multidimensional complex analysis in formal language and grammar theory O. I. Egorushkin, I. V. Kolbasina, K. V. Safonov Prikl. Diskr. Mat., 2017, no. 37, 76–89
|
|
| 7. |
A. N. Rybalov, “O genericheskoi nerazreshimosti desyatoi problemy Gilberta dlya polinomialnykh derevev”, PDM, 2019, № 44, 107–112  |
→ |
On generic complexity of decidability problem for Diophantine systems in the Skolem's form A. N. Rybalov Prikl. Diskr. Mat., 2017, no. 37, 100–106
|
| 8. |
A. V. Seliverstov, “O dvoichnykh resheniyakh sistem uravnenii”, PDM, 2019, № 45, 26–32  |
→ |
On generic complexity of decidability problem for Diophantine systems in the Skolem's form A. N. Rybalov Prikl. Diskr. Mat., 2017, no. 37, 100–106
|
| 9. |
A. Rybalov, “On a generic turing reducibility of computably enumerable sets”, Xii International Scientific and Technical Conference Applied Mechanics and Systems Dynamics, Journal of Physics Conference Series, 1210, IOP Publishing Ltd, 2019, 012122  |
→ |
On generic complexity of decidability problem for Diophantine systems in the Skolem's form A. N. Rybalov Prikl. Diskr. Mat., 2017, no. 37, 100–106
|
|
| 10. |
M. S. Tarkov, “Informatsionnaya emkost seti Khopfilda s kvantovannymi vesami”, PDM, 2019, № 45, 97–103  |
→ |
Reduction of synapses in the Hopfield autoassociative memory M. S. Tarkov Prikl. Diskr. Mat., 2017, no. 37, 107–113
|
|
| 11. |
I. V. Cherednik, “Ob ispolzovanii binarnykh operatsii pri postroenii tranzitivnogo mnozhestva blochnykh preobrazovanii”, Diskret. matem., 31:3 (2019), 93–113  |
→ |
One approach to constructing a transitive class of block transformations I. V. Cherednik Prikl. Diskr. Mat., 2017, no. 38, 5–34
|
| 12. |
O. A. Ustinov, V. A. Kashcheev, A. Yu. Shadrin, A. I. Tuchkova, A. A. Semenov, I. G. Lesina, A. S. Anikin, “Tritium in nitride fuel of fast reactors”, Atom. Energy, 125:4 (2019), 244–249  |
→ |
One approach to constructing a transitive class of block transformations I. V. Cherednik Prikl. Diskr. Mat., 2017, no. 38, 5–34
|
|
| 13. |
I. A. Pankratova, “Svoistva komponent nekotorykh klassov vektornykh bulevykh funktsii”, PDM, 2019, № 44, 5–11  |
→ |
Substitution block ciphers with functional keys G. P. Agibalov Prikl. Diskr. Mat., 2017, no. 38, 57–65
|
| 14. |
N. M. Kiseleva, E. S. Lipatova, I. A. Pankratova, E. E. Trifonova, “Algoritmy vychisleniya kriptograficheskikh kharakteristik vektornykh bulevykh funktsii”, PDM, 2019, № 46, 78–87  |
→ |
Substitution block ciphers with functional keys G. P. Agibalov Prikl. Diskr. Mat., 2017, no. 38, 57–65
|
| 15. |
L. A. Karpova, I. A. Pankratova, “Peremeshivayuschie svoistva nekotorykh klassov podstanovok na $\mathbb{F}_2^n$”, PDM. Prilozhenie, 2019, № 12, 47–50  |
→ |
Substitution block ciphers with functional keys G. P. Agibalov Prikl. Diskr. Mat., 2017, no. 38, 57–65
|
| 16. |
A. I. Metalnikova, I. A. Pankratova, “O klassakh bulevykh funktsii ogranichennoi slozhnosti”, PDM. Prilozhenie, 2019, № 12, 58–60  |
→ |
Substitution block ciphers with functional keys G. P. Agibalov Prikl. Diskr. Mat., 2017, no. 38, 57–65
|
|
| 17. |
D. V. Litichevskii, “Spisochnoe dekodirovanie veivlet-kodov”, Izv. IMI UdGU, 53 (2019), 115–126  |
→ |
List decoding of the biorthogonal wavelet code with predetermined code distance on a field of odd characteristic D. V. Litichevskiy Prikl. Diskr. Mat., 2018, no. 39, 72–77
|
| 18. |
D. V. Litichevskii, “O spisochnom dekodirovanii veivlet-kodov nad konechnymi polyami kharakteristiki dva”, PDM, 2019, № 44, 94–106  |
→ |
List decoding of the biorthogonal wavelet code with predetermined code distance on a field of odd characteristic D. V. Litichevskiy Prikl. Diskr. Mat., 2018, no. 39, 72–77
|
|
| 19. |
A. Yu. Nikitin, “Razreshimost ogranichennykh teorii klassa chastichnykh poryadkov”, PDM, 2019, № 45, 6–12  |
→ |
On complexity of the satisfiability problem of systems over finite posets A. Y. Nikitin, A. N. Rybalov Prikl. Diskr. Mat., 2018, no. 39, 94–98
|
| 20. |
A Yu Nikitin, “On radicals and coordinate partial orders”, J. Phys.: Conf. Ser., 1260:2 (2019), 022004  |
→ |
On complexity of the satisfiability problem of systems over finite posets A. Y. Nikitin, A. N. Rybalov Prikl. Diskr. Mat., 2018, no. 39, 94–98
|
|
|
|
| Total publications: |
910 |
| Scientific articles: |
890 |
| Authors: |
621 |
| Citations: |
1685 |
| Cited articles: |
486 |
 |
Impact Factor Web of Science |
|
for 2025:
0.100 |
|
for 2024:
0.100 |
|
for 2023:
0.200 |
 |
Scopus Metrics |
|
2025 |
CiteScore |
0.400 |
|
2025 |
SNIP |
0.457 |
|
2025 |
SJR |
0.200 |
|
2024 |
CiteScore |
0.400 |
|
2024 |
SNIP |
0.266 |
|
2024 |
SJR |
0.135 |
|
2023 |
CiteScore |
0.600 |
|
2023 |
SNIP |
0.569 |
|
2023 |
SJR |
0.230 |
|
2022 |
SJR |
0.221 |
|
2021 |
SJR |
0.214 |
|
2020 |
SJR |
0.222 |
|
2019 |
SJR |
0.157 |
|
2018 |
CiteScore |
0.330 |
|
2018 |
SJR |
0.265 |
|
2017 |
CiteScore |
0.210 |
|
2017 |
SNIP |
0.072 |
|
2017 |
SJR |
0.200 |
|