2-years impact-factor Math-Net.Ru of «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  Full list
N	Citing pulication		Cited paper
1.	G. A. Bakai, “Bolshie ukloneniya dlya obryvayuschegosya obobschennogo protsessa vosstanovleniya”, Teoriya veroyatn. i ee primen., 66:2 (2021), 261–283	→	Large deviations of generalized renewal process G. A. Bakai, A. V. Shklyaev Diskr. Mat., 31:1 (2019),  21–55
2.	Paulo R.A. Firmino, Cícero C.F. de Oliveira, Cláudio T. Cristino, Safety and Reliability Modeling and its Applications, 2021, 305	→	Large deviations of generalized renewal process G. A. Bakai, A. V. Shklyaev Diskr. Mat., 31:1 (2019),  21–55
3.	Yu. Kharin, V. Voloshko, “Robust estimation for binomial conditionally nonlinear autoregressive time series based on multivariate conditional frequencies”, J. Multivar. Anal., 185 (2021), 104777	→	Semibinomial conditionally nonlinear autoregressive models of discrete random sequences: probabilistic properties and statistical parameter estimation V. A. Voloshko, Yu. S. Kharin Diskr. Mat., 31:1 (2019),  72–98
4.	V. V. Zhukov, “Ways of Synthesizing Binary Programs Admitting Recursive Call of Procedures”, MoscowUniv.Comput.Math.Cybern., 45:3 (2021), 87	→	Asymptotically best method for synthesis of Boolean recursive circuits V. V. Zhukov, S. A. Lozhkin Diskr. Mat., 31:1 (2019),  99–110
5.	Yu. V. Borodina, “Nekotorye klassy legkotestiruemykh skhem v bazise Zhegalkina”, Diskret. matem., 33:4 (2021), 3–10	→	Easily testable circuits in Zhegalkin basis in the case of constant faults of type “1” at gate outputs Yu. V. Borodina Diskr. Mat., 31:2 (2019),  14–19
6.	Lozin V., Moshkov M., “Critical Properties and Complexity Measures of Read-Once Boolean Functions”, Ann. Math. Artif. Intell., 89:5-6 (2021), 595–614	→	Attribute-efficient learning of Boolean functions from Post closed classes A. V. Bistrigova Diskr. Mat., 31:2 (2019),  34–56
7.	A. V. Bystrygova, “Rasshifrovka bulevykh funktsii ogranichennogo vesa”, Vestn. Mosk. un-ta. Ser. 1. Matem., mekh., 2021, № 6, 14–20	→	Attribute-efficient learning of Boolean functions from Post closed classes A. V. Bistrigova Diskr. Mat., 31:2 (2019),  34–56
8.	Yu. L. Pavlov, “Svyaznost konfiguratsionnykh grafov v modelyakh slozhnykh setei”, Inform. i ee primen., 15:1 (2021), 18–22	→	On the connectivity of configuration graphs Yu. L. Pavlov Diskr. Mat., 31:2 (2019),  114–122
9.	A. R. Vasin, O. V. Kamlovskii, V. V. Mizerov, “Svoistva raspredelenii elementov v odnom klasse posledovatelnostei nad koltsami Galua”, Matem. vopr. kriptogr., 12:4 (2021), 25–41	→	Bounds on the discrepancy of linear recurring sequences over Galois rings A. R. Vasin Diskr. Mat., 31:3 (2019),  17–25
10.	V. A. Vatutin, E. E. Dyakonova, “Mnogotipnye vetvyaschiesya protsessy v sluchainoi srede”, UMN, 76:6(462) (2021), 71–118	→	Multitype weakly subcritical branching processes in random environment V. A. Vatutin, E. E. D'yakonova Diskr. Mat., 31:3 (2019),  26–46
11.	Sh. K. Formanov, Sh. Yu. Jurayev, “On transient phenomena in branching random processes with discrete time”, Lobachevskii J. Math., 42:12 (2021), 2777–2784	→	Multitype weakly subcritical branching processes in random environment V. A. Vatutin, E. E. D'yakonova Diskr. Mat., 31:3 (2019),  26–46
12.	S. A. Komkov, “Kontinualnost klassov funktsii mnogoznachnoi logiki s minimalnym logarifmicheskim tempom rosta”, Diskret. matem., 33:3 (2021), 54–63	→	On classes of functions of many-valued logic with minimal logarithmic growth rate S. A. Komkov Diskr. Mat., 31:3 (2019),  47–57
13.	S. A. Komkov, “Novye po poryadku eksponentsialnye tempy rosta”, Intellektualnye sistemy. Teoriya i prilozheniya, 25:3 (2021), 159–172	→	On classes of functions of many-valued logic with minimal logarithmic growth rate S. A. Komkov Diskr. Mat., 31:3 (2019),  47–57
14.	S. A. Komkov, “O tempakh rosta struktur s konechnym chislom suschestvennykh ogranichenii”, Intellektualnye sistemy. Teoriya i prilozheniya, 25:4 (2021), 129–132	→	On classes of functions of many-valued logic with minimal logarithmic growth rate S. A. Komkov Diskr. Mat., 31:3 (2019),  47–57
15.	R. A. de la Cruz Jiménez, “Postroenie $8$-bitovykh podstanovok, $8$-bitovykh involyutsii i $8$-bitovykh ortomorfizmov s pochti optimalnymi kriptograficheskimi parametrami”, Matem. vopr. kriptogr., 12:3 (2021), 89–124	→	The limited deficit method and the problem of constructing orthomorphisms and almost orthomorphisms of Abelian groups A. V. Menyachikhin Diskr. Mat., 31:3 (2019),  58–77
16.	I. V. Cherednik, “Razvitie odnogo podkhoda k postroeniyu mnozhestva blochnykh biektivnykh preobrazovanii”, Matem. vopr. kriptogr., 12:3 (2021), 49–66	→	Using binary operations to constructa transitive set of block transformations I. V. Cherednik Diskr. Mat., 31:3 (2019),  93–113
17.	D. I. Trifonov, D. B. Fomin, “Ob invariantnykh podprostranstvakh v XSL-shifrakh”, PDM, 2021, № 54, 58–76	→	Subgroups of direct products of groups invariant under the action of permutationson factors D. A. Burov Diskr. Mat., 31:4 (2019),  3–19
18.	A. A. Chasovskikh, “Klassy lineinykh avtomatov nad konechnymi polyami s operatsiyami superpozitsii”, Intellektualnye sistemy. Teoriya i prilozheniya, 25:4 (2021), 221–224	→	Maximum subclasses in classes of linear automata over finite fields A. A. Chasovskikh Diskr. Mat., 31:4 (2019),  88–101
19.	D. V. Zakablukov, “O sinteze obratimykh skhem iz elementov NOT, CNOT i 2-CNOTs malym chislom dopolnitelnykh vkhodov”, Diskret. matem., 33:3 (2021), 46–54	→	On the dependence of the complexity and depth of reversible circuits consisting of NOT, CNOT, and 2-CNOT gates on the number of additional inputs D. V. Zakablukov Diskr. Mat., 32:1 (2020),  8–26
20.	V. Vysotskaya, “Characteristics of Hadamard square of special Reed — Muller subcodes”, PDM, 2021, № 53, 75–88	→	Classification of Hadamard productsof one-codimensional subcodesof Reed–Muller codes I. V. Chizhov, M. A. Borodin Diskr. Mat., 32:1 (2020),  115–134
1 2  Full list