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

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

The table below contains the list of citations in 2016 to the papers published in 2014–2015. 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. M. Deundyak, Yu. V. Kosolapov, “Kriptosistema na indutsirovannykh gruppovykh kodakh”, Model. i analiz inform. sistem, 23:2 (2016), 137–152	→	Effective attack on the McEliece cryptosystem based on Reed–Muller codes M. A. Borodin, I. V. Chizhov Diskr. Mat., 26:1 (2014),  10–20
2.	I. V. Chizhov, M. A. Borodin, “Kriptoanaliz kriptosistemy Mak-Elisa, postroennoi na $(k-1)$-podkodakh koda Rida–Mallera”, PDM. Prilozhenie, 2016, № 9, 73–75	→	Effective attack on the McEliece cryptosystem based on Reed–Muller codes M. A. Borodin, I. V. Chizhov Diskr. Mat., 26:1 (2014),  10–20
3.	D. A. Burov, B. A. Pogorelov, “An attack on $\mathrm{6}$ rounds of Khazad”, Matem. vopr. kriptogr., 7:2 (2016), 35–46	→	On the distance from permutations to the union of all imprimitive groups with identical parameters of imprimitivity systems B. A. Pogorelov, M. A. Pudovkina Diskr. Mat., 26:1 (2014),  103–117
4.	P. V. Shnurkov, A. K. Gorshenin, V. V. Belousov, “Analiticheskoe reshenie zadachi optimalnogo upravleniya polumarkovskim protsessom s konechnym mnozhestvom sostoyanii”, Inform. i ee primen., 10:4 (2016), 72–88	→	Analysis of a discrete semi-Markov model of continuous inventory control with periodic interruptions of consumption P. V. Shnurkov, A. V. Ivanov Diskr. Mat., 26:1 (2014),  143–154
5.	Shnurkov P.V., “Solution of the unconditional extremum problem for a linear-fractional integral functional on a set of probability measures”, Dokl. Math., 94:2 (2016), 550–554	→	Analysis of a discrete semi-Markov model of continuous inventory control with periodic interruptions of consumption P. V. Shnurkov, A. V. Ivanov Diskr. Mat., 26:1 (2014),  143–154
6.	Zhang W., Fang Y., Tee K.F., “Reliability Analysis of Multi-State System From Time Response”, Theory, Methodology, Tools and Applications For Modeling and Simulation of Complex Systems, Pt II, Communications in Computer and Information Science, 644, eds. Zhang L., Song X., Wu Y., Springer-Verlag Singapore Pte Ltd, 2016, 53–62	→	Analysis of a discrete semi-Markov model of continuous inventory control with periodic interruptions of consumption P. V. Shnurkov, A. V. Ivanov Diskr. Mat., 26:1 (2014),  143–154
7.	Vatutin V., “Subcritical Branching Processes in Random Environment”, Branching Processes and Their Applications, Lecture Notes in Statistics, 219, ed. DelPuerto I. Gonzalez M. Gutierrez C. Martinez R. Minuesa C. Molina M. Mota M. Ramos A., Springer, 2016, 97–115	→	Functional limit theorems for high-level subcritical branching processes in random environment V. I. Afanasyev Diskr. Mat., 26:2 (2014),  6–24
8.	E. E. Gasanov, A. M. Zubkov, N. V. Klykova, “Algoritm poiska identichnykh ob'ektov s ogranichennoi v khudshem sluchae vremennoi slozhnostyu i lineinym ob'emom pamyati”, Diskret. matem., 28:2 (2016), 3–11	→	Lower bounds of temporal and spatial complexity of the substring search problem E. M. Perper Diskr. Mat., 26:2 (2014),  58–70
9.	K. A. Popkov, “O edinichnykh diagnosticheskikh testakh dlya skhem iz funktsionalnykh elementov v bazise Zhegalkina”, Preprinty IPM im. M. V. Keldysha, 2016, 050, 16 s.	→	Method of synthesis of easily testable circuits admitting single fault detection tests of constant length D. S. Romanov Diskr. Mat., 26:2 (2014),  100–130
10.	K. A. Popkov, “Nizhnie otsenki dlin edinichnykh testov dlya skhem iz funktsionalnykh elementov”, Preprinty IPM im. M. V. Keldysha, 2016, 139, 21 s.	→	Method of synthesis of easily testable circuits admitting single fault detection tests of constant length D. S. Romanov Diskr. Mat., 26:2 (2014),  100–130
11.	G. G. Arakelov, A. V. Gribov, A. V. Mikhalev, “Prikladnaya gomomorfnaya kriptografiya: primery”, Fundament. i prikl. matem., 21:3 (2016), 25–38	→	Application of non-associative groupoids to the realization of an open key distribution procedure S. Yu. Katyshev, V. T. Markov, A. A. Nechaev Diskr. Mat., 26:3 (2014),  45–64
12.	V. T. Markov, A. V. Mikhalev, A. A. Nechaev, “Neassotsiativnye algebraicheskie struktury v kriptografii i kodirovanii”, Fundament. i prikl. matem., 21:4 (2016), 99–124	→	Application of non-associative groupoids to the realization of an open key distribution procedure S. Yu. Katyshev, V. T. Markov, A. A. Nechaev Diskr. Mat., 26:3 (2014),  45–64
13.	V. V. Mazalov, A. A. Pechnikov, L. I. Trukhina, B. T. Tsynguev, “Ranzhirovanie akademicheskogo veb-prostranstva”, UBS, 61 (2016), 118–135	→	Generating functions and the Myerson vector in communication networks V. V. Mazalov, L. I. Trukhina Diskr. Mat., 26:3 (2014),  65–75
14.	Mazalov V.V., Avrachenkov K.E., Trukhina L.I., Tsynguev B.T., “Game-Theoretic Centrality Measures for Weighted Graphs”, Fundam. Inform., 145:3 (2016), 341–358	→	Generating functions and the Myerson vector in communication networks V. V. Mazalov, L. I. Trukhina Diskr. Mat., 26:3 (2014),  65–75
15.	Mazalov V.V., Tsynguev B.T., “Kirchhoff Centrality Measure For Collaboration Network”, Computational Social Networks, Csonet 2016, Lecture Notes in Computer Science, 9795, eds. Nguyen H., Snasel V., Springer Int Publishing Ag, 2016, 147–157	→	Generating functions and the Myerson vector in communication networks V. V. Mazalov, L. I. Trukhina Diskr. Mat., 26:3 (2014),  65–75
16.	N. M. Mezhennaya, “O chisle sovpadenii znakov v diskretnoi sluchainoi posledovatelnosti, upravlyaemoi tsepyu Markova”, Sib. elektron. matem. izv., 13 (2016), 305–317	→	On repetitions of long tuples in a Markov chain V. G. Mikhailov, A. M. Shoitov Diskr. Mat., 26:3 (2014),  79–89
17.	V. G. Mikhailov, “O veroyatnosti nalichiya v sluchainoi posledovatelnosti tsepochek s odinakovoi strukturoi”, Diskret. matem., 28:3 (2016), 97–110	→	On repetitions of long tuples in a Markov chain V. G. Mikhailov, A. M. Shoitov Diskr. Mat., 26:3 (2014),  79–89
18.	A. A. Tuganbaev, “Avtomorfizm-prodolzhaemye i endomorfizm-prodolzhaemye moduli”, Fundament. i prikl. matem., 21:4 (2016), 175–248	→	Characteristic submodules of injective modules over strongly prime rings A. A. Tuganbaev Diskr. Mat., 26:3 (2014),  121–126
19.	S. B. Gashkov, I. S. Sergeev, “Ob additivnoi slozhnosti matrits NOD i NOK”, Matem. zametki, 100:2 (2016), 196–211	→	Arithmetic complexity of the Stirling transforms S. B. Gashkov Diskr. Mat., 26:4 (2014),  23–35
20.	N. M. Mezhennaya, V. G. Mikhailov, “Ob asimptoticheskoi normalnosti chisel poyavlenii znakov v neravnoveroyatnoi multitsiklicheskoi sluchainoi posledovatelnosti po modulyu 4”, Matem. vopr. kriptogr., 7:4 (2016), 81–94	→	On frequencies of elements in multicyclic random sequence modulo 4 N. M. Mezhennaya, V. G. Mikhailov Diskr. Mat., 26:4 (2014),  51–58
1 2 3  Full list