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

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

The table below contains the list of citations in 2009 to the papers published in 2007–2008. 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.	I. A. Kruglov, “O sloyakh v sisteme obrazuyuschikh elementov podpryamogo proizvedeniya podgrupp konechnoi gruppy”, Diskret. matem., 21:1 (2009), 52–65	→	Shifted products of independent random variables with values in finite groups I. A. Kruglov Diskr. Mat., 19:1 (2007),  40–49
2.	Aksenova E.A., Sokolov A.V., Drats V., “Optimalnoe upravlenie $n$ FIFO-ocheredyami na beskonechnom vremeni”, Informatsionno-upravlyayuschie sistemy, 2009, № 6, 46–54	→	Optimal management of two parallel stacks in two-level memory E. A. Aksenova, A. V. Sokolov Diskr. Mat., 19:1 (2007),  67–75
3.	V. A. Emelichev, O. V. Karelkina, “Konechnye koalitsionnye igry: parametrizatsiya kontseptsii ravnovesiya (ot Pareto do Nesha) i ustoichivost effektivnoi situatsii v metrike Geldera”, Diskret. matem., 21:2 (2009), 43–50	→	On stability of an efficient solution of a vector Boolean problem of maximisation of absolute values of linear functions E. Gurevsky, V. A. Emelichev Diskr. Mat., 19:2 (2007),  45–50
4.	A. N. Chuprunov, B. I. Khamdeev, “O veroyatnosti ispravleniya oshibok pri pomekhoustoichivom kodirovanii, kogda chislo oshibok prinadlezhit nekotoromu konechnomu mnozhestvu”, Inform. i ee primen., 3:3 (2009), 52–59	→	On the transition of distributions of sums of random variables related to the generalised allocation scheme from one lattice to another A. V. Kolchin, V. F. Kolchin Diskr. Mat., 19:3 (2007),  15–21
5.	Yu. L. Pavlov, “O predelnykh raspredeleniyakh stepenei vershin v uslovnykh Internet-grafakh”, Diskret. matem., 21:3 (2009), 14–23	→	The limit distribution of the size of a giant component in an Internet-type random graph Yu. L. Pavlov Diskr. Mat., 19:3 (2007),  22–34
6.	Georgakopoulos A., “A short proof of Fleischner's theorem”, Discrete Math., 309:23-24 (2009), 6632–6634	→	An upper bound for the number of maximal independent sets in a graph V. E. Alekseev Diskr. Mat., 19:3 (2007),  84–88
7.	Galvin D., “An upper bound for the number of independent sets in regular graphs”, Discrete Math., 309:23-24 (2009), 6635–6640	→	An upper bound for the number of maximal independent sets in a graph V. E. Alekseev Diskr. Mat., 19:3 (2007),  84–88
8.	Dainyak A.B., “Otsenki chisla nezavisimykh mnozhestv v grafakh s fiksirovannym chislom nezavisimosti”, Vestn. Mosk. un-ta. Ser. 15: Vychislitelnaya matematika i kibernetika, 2009, № 2, 45–48	→	An upper bound for the number of maximal independent sets in a graph V. E. Alekseev Diskr. Mat., 19:3 (2007),  84–88
9.	A. B. Dainyak, “Estimates of the number of independent sets in graphs with a fixed independence number”, MoscowUniv.Comput.Math.Cybern., 33:2 (2009), 97	→	An upper bound for the number of maximal independent sets in a graph V. E. Alekseev Diskr. Mat., 19:3 (2007),  84–88
10.	Cho Ilwoo, Jorgensen P. E. T., “Applications of automata and graphs: Labeling operators in Hilbert space. II”, J. Math. Phys., 50:6 (2009), 063511, 42 pp.	→	On the structure of the set of reversible cellular automata I. V. Kucherenko Diskr. Mat., 19:3 (2007),  102–121
11.	Cho Ilwoo, Jorgensen P. E. T., “Applications of automata and graphs: labeling-operators in Hilbert space. I”, Acta Appl. Math., 107:1-3 (2009), 237–291	→	On the structure of the set of reversible cellular automata I. V. Kucherenko Diskr. Mat., 19:3 (2007),  102–121
12.	Lugo M., “Profiles of permutaions”, Electron. J. Combin., 16:1 (2009), Research Paper 99, 20 pp.	→	Random permutations with cycle lengths in a given finite set A. N. Timashev Diskr. Mat., 20:1 (2008),  25–37
13.	A. G. Brodskii, “O 2-smezhnostnykh mnogogrannikakh i konstruktsii Geila”, Model. i analiz inform. sistem, 16:2 (2009), 5–20	→	On random 2-adjacent 0/1-polyhedra V. A. Bondarenko, A. G. Brodskiy Diskr. Mat., 20:1 (2008),  64–69
14.	Cherepnev M.A., “O nekotorykh vychisleniyakh v prostranstvakh krylova nad GF(2)”, Vestn. Tambovskogo un-ta. Ser.: Estestvennye i tekhnicheskie nauki, 14:4 (2009), 833–835	→	A block algorithm of Lanczos type for solving sparse systems of linear equations M. A. Cherepnev Diskr. Mat., 20:1 (2008),  145–150
15.	Grusho A.A., Grusho N.A., Timonina E.E., “O stoikosti steganograficheskikh skhem”, T-Comm: Telekommunikatsii i transport, 2009, № S3, 187–188	→	Theorems on the nonexistence of consistent sequences of criteria in some discrete problems A. A. Grusho, N. A. Grusho, E. E. Timonina Diskr. Mat., 20:2 (2008),  25–31
16.	E. E. Gasanov, “Teoriya khraneniya i poiska informatsii”, Fundament. i prikl. matem., 15:3 (2009), 49–73	→	On the complexity of decoding Boolean cube splitting into cube faces V. V. Osokin Diskr. Mat., 20:2 (2008),  46–62
17.	Podlovchenko R.I., Khachatryan V.E., “Razreshimost problemy ekvivalentnykh preobrazovanii v odnom mnozhestve dvukhlentochnykh avtomatov i postroenie vsekh minimalnykh avtomatov v etom mnozhestve”, Informatsionnye sistemy i tekhnologii, 2009, № 4, 12–17	→	Minimality and deadlockness of multitape automata R. I. Podlovchenko, V. E. Khachatryan Diskr. Mat., 20:2 (2008),  100–121
18.	Yu. L. Pavlov, “O predelnykh raspredeleniyakh stepenei vershin v uslovnykh Internet-grafakh”, Diskret. matem., 21:3 (2009), 14–23	→	Random graphs of Internet type and the generalised allocation scheme Yu. L. Pavlov, I. A. Cheplyukova Diskr. Mat., 20:3 (2008),  3–18
19.	M. I. Tikhomirova, “Asimptoticheskaya normalnost chisla nepoyavivshikhsya nesploshnykh tsepochek iskhodov nezavisimykh ispytanii”, Diskret. matem., 21:2 (2009), 112–125	→	Limit distributions of the number of absent chains of identical outcomes M. I. Tikhomirova Diskr. Mat., 20:3 (2008),  40–46
20.	E. E. Gasanov, “Teoriya khraneniya i poiska informatsii”, Fundament. i prikl. matem., 15:3 (2009), 49–73	→	Dynamic databases with optimal in order time complexity I. S. Lapshov Diskr. Mat., 20:3 (2008),  89–100
1 2  Full list