2-years impact-factor Math-Net.Ru of «Prikladnaya Diskretnaya Matematika» journal, 2021

2-years impact-factor Math-Net.Ru of the journal in 2021 is calculated as the number of citations in 2021 to the scientific papers published during 2019–2020.

The table below contains the list of citations in 2021 to the papers published in 2019–2020. 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.

1 2 3  Full list
N	Citing pulication		Cited paper
1.	M. S. Bespalov, “Veivletnye $p$-analogi diskretnogo preobrazovaniya Khaara”, Izv. Sarat. un-ta. Nov. ser. Ser.: Matematika. Mekhanika. Informatika, 21:4 (2021), 520–531	→	Bernoulli's discrete periodic functions M. S. Bespalov Prikl. Diskr. Mat., 2019, no. 43,  16–36
2.	P. Yiarayong, “On semiprime and quasi-semiprime ideals in ordered AG-groupoids”, Thai J. Math., 19:2 (2021), 387–398	→	Characterizations of non associative ordered semigroups by the properties of their fuzzy ideals with thresholds $(\alpha,\beta]$ K. Nasreen Prikl. Diskr. Mat., 2019, no. 43,  37–59
3.	K. A. Popkov, “O skhemakh, dopuskayuschikh korotkie edinichnye proveryayuschie testy pri proizvolnykh neispravnostyakh funktsionalnykh elementov”, PDM, 2021, № 51, 85–100	→	Synthesis of easily testable logic networks under arbitrary stuck-at faults at inputs and outputs of gates K. A. Popkov Prikl. Diskr. Mat., 2019, no. 43,  78–100
4.	N. Yu. Berdnikova, I. A. Pankratova, “Kriptoanaliticheskaya obratimost funktsii dvukh argumentov”, PDM. Prilozhenie, 2021, № 14, 67–71	→	Cryptanalytic concept of~finite~automaton invertibility with finite delay G. P. Agibalov Prikl. Diskr. Mat., 2019, no. 44,  34–42
5.	M. Alekhina, O. Barsukova, “Asymptotically optimum on unreliability circuits in the basis consisting of the Webb function in $P_k$ under failures of $k-1$ type at the outputs of elements”, Lobachevskii J. Math., 42:1 (2021), 50–56	→	About reliability of circuits in the basis consisting of the Webb function in $P_k$ under failures of 0 type and $k-1$ type at the outputs of elements M. A. Alekhina, O. Yu. Barsukova Prikl. Diskr. Mat., 2019, no. 44,  58–66
6.	V. M. Deundyak, D. V. Zagumennov, “O granitsakh moschnosti zloumyshlennikov dlya identifitsiruyuschikh algebrogeometricheskikh kodov na spetsialnykh krivykh”, PDM, 2021, № 53, 55–74	→	On application of algebraic geometry codes of $L$-construction in copy protection D. V. Zagumennov, V. V. Mkrtichyan Prikl. Diskr. Mat., 2019, no. 44,  67–93
7.	V. M. Deundyak, D. V. Zagumennov, “On the properties of algebraic geometric codes as copy protection codes”, Autom. Control Comp. Sci., 55:7 (2021), 795–808	→	On application of algebraic geometry codes of $L$-construction in copy protection D. V. Zagumennov, V. V. Mkrtichyan Prikl. Diskr. Mat., 2019, no. 44,  67–93
8.	A. V. Seliverstov, “Dvoichnye resheniya dlya bolshikh sistem lineinykh uravnenii”, PDM, 2021, № 52, 5–15	→	On generic undecidability of Hilbert's tenth problem for polynomial trees A. N. Rybalov Prikl. Diskr. Mat., 2019, no. 44,  107–112
9.	Alexander Rybalov, “On generic complexity of theories of finite algebraic structures”, J. Phys.: Conf. Ser., 1901:1 (2021), 012046	→	On generic undecidability of Hilbert's tenth problem for polynomial trees A. N. Rybalov Prikl. Diskr. Mat., 2019, no. 44,  107–112
10.	Alexander Rybalov, Artem Shevlyakov, “Generic complexity of solving of equations in finite groups, semigroups and fields”, J. Phys.: Conf. Ser., 1901:1 (2021), 012047	→	On generic undecidability of Hilbert's tenth problem for polynomial trees A. N. Rybalov Prikl. Diskr. Mat., 2019, no. 44,  107–112
11.	Alexander Rybalov, “On generic complexity of the problem of searching of isomorphism for finite semigroups”, J. Phys.: Conf. Ser., 1901:1 (2021), 012045	→	On generic undecidability of Hilbert's tenth problem for polynomial trees A. N. Rybalov Prikl. Diskr. Mat., 2019, no. 44,  107–112
12.	V. G. Ryabov, “Maksimalno nelineinye funktsii nad konechnymi polyami”, Diskret. matem., 33:1 (2021), 47–63	→	On the degree of restrictions of $q$-valued logic functions to linear manifolds V. G. Ryabov Prikl. Diskr. Mat., 2019, no. 45,  13–25
13.	V. G. Ryabov, “Kriterii maksimalnoi nelineinosti funktsii nad konechnym polem”, Diskret. matem., 33:3 (2021), 79–91	→	On the degree of restrictions of $q$-valued logic functions to linear manifolds V. G. Ryabov Prikl. Diskr. Mat., 2019, no. 45,  13–25
14.	A. V. Seliverstov, “Dvoichnye resheniya dlya bolshikh sistem lineinykh uravnenii”, PDM, 2021, № 52, 5–15	→	On binary solutions to systems of equations A. V. Seliverstov Prikl. Diskr. Mat., 2019, no. 45,  26–32
15.	A. V. Seliverstov, “Heuristic algorithms for recognition of some cubic hypersurfaces”, Program. Comput. Softw. , 47:1 (2021), 50–55	→	On binary solutions to systems of equations A. V. Seliverstov Prikl. Diskr. Mat., 2019, no. 45,  26–32
16.	Aleksandr Vladislavovich Seliverstov, Matematicheskie osnovy informatiki i informatsionno-kommunikatsionnykh sistem, 2021, 262	→	On binary solutions to systems of equations A. V. Seliverstov Prikl. Diskr. Mat., 2019, no. 45,  26–32
17.	D. Moldovyan, N. Al-Majmar, A. Moldovyan, “Algebraic supports and new forms of the hidden discrete logarithm problem for post-quantum public-key cryptoschemes”, Int. Arab J. Inf. Technol., 18:3 (2021), 372–379	→	On the construction of a semantically secure modification of the McEliece cryptosystem Y. V. Kosolapov, O. Y. Turchenko Prikl. Diskr. Mat., 2019, no. 45,  33–43
18.	Nikolay Andreevich Moldovyan, Dmitriy Nikolaevich Moldovyan, “A novel method for developing post-quantum cryptoschemes and a practical signature algorithm”, ACI, 2021	→	On the construction of a semantically secure modification of the McEliece cryptosystem Y. V. Kosolapov, O. Y. Turchenko Prikl. Diskr. Mat., 2019, no. 45,  33–43
19.	Petro Kravets, Volodymyr Pasichnyk, Mykola Prodaniuk, “Game Self-organization of Hamiltonian Cycle of the Graph”, Vìsn. Nac. unìv. "Lʹvìv. polìteh.", Ser. Ìnf. sist. merežì, 10 (2021), 13	→	Comparison of sufficient degree based conditions for Hamiltonian graph M. B. Abrosimov Prikl. Diskr. Mat., 2019, no. 45,  55–63
20.	R. El-Shanawany, E. El-Kholy, T. Homoda, Z. Bakr, 2021 International Conference on Electronic Engineering (ICEEM), 2021, 1	→	On the one edge algorithm for the orthogonal double covers R. El-Shanawany, A. El-Mesady Prikl. Diskr. Mat., 2019, no. 45,  78–84
1 2 3  Full list