2-years impact-factor Math-Net.Ru of «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.

1 2 3  Full list
N	Citing pulication		Cited paper
1.	V. O. Mironkin, “Sloi v grafe $k$-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Matem. vopr. kriptogr., 10:1 (2019), 73–82	→	Limit theorem for the size of an image of subset under compositions of random mappings A. M. Zubkov, A. A. Serov Diskr. Mat., 29:1 (2017),  17–26
2.	V. O. Mironkin, “Kollizii i intsidentnost vershin komponentam v grafe $k$-kratnoi iteratsii ravnoveroyatnogo sluchainogo otobrazheniya”, Diskret. matem., 31:4 (2019), 38–52	→	Limit theorem for the size of an image of subset under compositions of random mappings A. M. Zubkov, A. A. Serov Diskr. Mat., 29:1 (2017),  17–26
3.	V. O. Mironkin, “Raspredelenie dliny otrezka aperiodichnosti v grafe kompozitsii nezavisimykh ravnoveroyatnykh sluchainykh otobrazhenii”, Matem. vopr. kriptogr., 10:3 (2019), 89–99	→	Limit theorem for the size of an image of subset under compositions of random mappings A. M. Zubkov, A. A. Serov Diskr. Mat., 29:1 (2017),  17–26
4.	O. A. Kozlitin, “Generatory psevdosluchainykh posledovatelnostei, ispolzuyuschie registrovye preobrazovaniya konechnykh tsepnykh kolets”, Matem. vopr. kriptogr., 10:3 (2019), 49–65	→	On periodic properties of polylinear shift registers O. A. Kozlitin Diskr. Mat., 29:1 (2017),  27–50
5.	R. M. Kolpakov, M. A. Posypkin, “Ob effektivnoi strategii rasparallelivaniya pri reshenii zadach o summe podmnozhestv metodom vetvei i granits”, Diskret. matem., 31:4 (2019), 20–37	→	On the best choice of a branching variable in the subset sum problem R. M. Kolpakov, M. A. Posypkin Diskr. Mat., 29:1 (2017),  51–58
6.	I. V. Savitskii, “Eliminating Inequalities in Register Machines with Counters”, MoscowUniv.Comput.Math.Cybern., 43:3 (2019), 126	→	Computations on register machines with counters I. V. Savitskii Diskr. Mat., 29:1 (2017),  95–113
7.	V. G. Ryabov, “O stepeni ogranichenii funktsii $q$-znachnoi logiki na lineinye mnogoobraziya”, PDM, 2019, № 45, 13–25	→	Estimating the level of affinity of a quadratic form A. V. Cheremushkin Diskr. Mat., 29:1 (2017),  114–125
8.	N. Yu. Enatskaya, “Enumeration method of analysis of combinatorial schemes”, Proceedings of the 45Th International Conference on Application of Mathematics in Engineering and Economics (Amee'19), AIP Conf. Proc., 2172, eds. V. Pasheva, N. Popivanov, G. Venkov, Amer. Inst. Phys., 2019, 100010	→	Combinatorial representations for the scheme of allocations of distinguishable particles into indistinguishable cells N. Yu. Enatskaya Diskr. Mat., 29:1 (2017),  126–135
9.	A. L. Yakymiv, “Raspredelenie ob'ema naibolshei komponenty sluchainogo $A$-otobrazheniya”, Diskret. matem., 31:4 (2019), 116–127	→	Limit theorems for the logarithm of the order of a random $A$-mapping A. L. Yakymiv Diskr. Mat., 29:1 (2017),  136–155
10.	K. A. Popkov, “Metod postroeniya legko diagnostiruemykh skhem iz funktsionalnykh elementov otnositelno edinichnykh neispravnostei”, PDM, 2019, № 46, 38–57	→	Lower bounds for lengths of single tests for Boolean circuits K. A. Popkov Diskr. Mat., 29:2 (2017),  53–69
11.	D. V. Litichevskii, “Spisochnoe dekodirovanie veivlet-kodov”, Izv. IMI UdGU, 53 (2019), 115–126	→	Biorthogonal wavelet codes with prescribed code distance A. A. Soloviev, D. V. Chernikov Diskr. Mat., 29:2 (2017),  96–108
12.	V. E. Viktorenkov, “Tsiklovaya struktura sluchainykh podstanovok na mnozhestve dvukhtsvetnykh elementov. I”, Matem. vopr. kriptogr., 10:3 (2019), 9–32	→	On the structure of digraphs of polynomial transformations over finite commutative rings with unity V. E. Viktorenkov Diskr. Mat., 29:3 (2017),  3–23
13.	O. A. Kozlitin, “Generatory psevdosluchainykh posledovatelnostei, ispolzuyuschie registrovye preobrazovaniya konechnykh tsepnykh kolets”, Matem. vopr. kriptogr., 10:3 (2019), 49–65	→	On the structure of digraphs of polynomial transformations over finite commutative rings with unity V. E. Viktorenkov Diskr. Mat., 29:3 (2017),  3–23
14.	D. G. Meshchaninov, “A Family of Closed Classes in k-Valued Logic”, Moscow Univ. Comput. Math. Cybern., 43:1 (2019), 25	→	Closed classes of polynomials modulo $p^2$ D. G. Meshchaninov Diskr. Mat., 29:3 (2017),  54–69
15.	D. V. Sirotkin, D. S. Malyshev, “Konstruktivnaya teorema suschestvovaniya, assotsiirovannaya s lokalnymi preobrazovaniyami grafov dlya zadachi o nezavisimom mnozhestve”, Zhurnal SVMO, 21:2 (2019), 215–221	→	A method of graph reduction and its applications D. V. sirotkin, D. S. Malyshev Diskr. Mat., 29:3 (2017),  114–125
16.	A. A. Tuganbaev, “Arifmeticheskie koltsa”, Algebra, Itogi nauki i tekhn. Sovrem. mat. i ee pril. Temat. obz., 164, VINITI RAN, M., 2019, 3–73	→	Arithmetical rings and Krull dimension A. A. Tuganbaev Diskr. Mat., 29:3 (2017),  126–132
17.	V. I. Afanasev, “Funktsionalnaya predelnaya teorema dlya lokalnogo vremeni ostanovlennogo sluchainogo bluzhdaniya”, Diskret. matem., 31:1 (2019), 7–20	→	Convergence to the local time of Brownian meander V. I. Afanasyev Diskr. Mat., 29:4 (2017),  28–40
18.	V. I. Afanasev, “Dvugranichnaya zadacha dlya sluchainogo bluzhdaniya s ogranicheniem na maksimalnoe priraschenie”, Diskret. matem., 31:3 (2019), 3–16	→	Convergence to the local time of Brownian meander V. I. Afanasyev Diskr. Mat., 29:4 (2017),  28–40
19.	V. E. Viktorenkov, “Tsiklovaya struktura sluchainykh podstanovok na mnozhestve dvukhtsvetnykh elementov. I”, Matem. vopr. kriptogr., 10:3 (2019), 9–32	→	Estimate of the maximal cycle length in the graph of polynomial transformation of Galois–Eisenstein ring O. A. Kozlitin Diskr. Mat., 29:4 (2017),  41–58
20.	O. A. Kozlitin, “Generatory psevdosluchainykh posledovatelnostei, ispolzuyuschie registrovye preobrazovaniya konechnykh tsepnykh kolets”, Matem. vopr. kriptogr., 10:3 (2019), 49–65	→	Estimate of the maximal cycle length in the graph of polynomial transformation of Galois–Eisenstein ring O. A. Kozlitin Diskr. Mat., 29:4 (2017),  41–58
1 2 3  Full list