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

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

The table below contains the list of citations in 2010 to the papers published in 2008–2009. 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.	A. L. Yakymiv, “Predelnaya teorema dlya logarifma poryadka sluchainoi $A$-podstanovki”, Diskret. matem., 22:1 (2010), 126–149	→	Random permutations with cycle lengths in a given finite set A. N. Timashev Diskr. Mat., 20:1 (2008),  25–37
2.	I. A. Kruglov, “Usloviya predelnoi ravnoveroyatnosti sostoyanii registrov sdviga”, Matem. vopr. kriptogr., 1:2 (2010), 19–29	→	The Kloss convergence principle for products of random variables with values in a compact group and distributions determined by a Markov chain I. A. Kruglov Diskr. Mat., 20:1 (2008),  38–51
3.	A. N. Maksimenko, “O chisle faset 2-smezhnostnogo mnogogrannika”, Model. i analiz inform. sistem, 17:1 (2010), 76–82	→	On random 2-adjacent 0/1-polyhedra V. A. Bondarenko, A. G. Brodskiy Diskr. Mat., 20:1 (2008),  64–69
4.	A. G. Brodskiy, “On 2-neighborly polytopes and the gale construction”, Aut. Conrol Comp. Sci., 44:7 (2010), 434	→	On random 2-adjacent 0/1-polyhedra V. A. Bondarenko, A. G. Brodskiy Diskr. Mat., 20:1 (2008),  64–69
5.	Cherepniov M.A., “Version of block Lanczos-type algorithm for solving sparse linear systems”, Bulletin Mathematique de La Societe Des Sciences Mathematiques de Roumanie, 53:3 (2010), 225–230	→	A block algorithm of Lanczos type for solving sparse systems of linear equations M. A. Cherepnev Diskr. Mat., 20:1 (2008),  145–150
6.	V. V. Osokin, “O rasshifrovke monotonnykh bulevykh funktsii s nesuschestvennymi peremennymi”, Diskret. matem., 22:3 (2010), 134–145	→	On the complexity of decoding Boolean cube splitting into cube faces V. V. Osokin Diskr. Mat., 20:2 (2008),  46–62
7.	R. I. Podlovchenko, V. E. Khachatryan, “Polnoe reshenie problemy minimizatsii dlya odnogo mnozhestva binarnykh dvukhlentochnykh avtomatov”, Diskret. matem., 22:3 (2010), 146–159	→	Minimality and deadlockness of multitape automata R. I. Podlovchenko, V. E. Khachatryan Diskr. Mat., 20:2 (2008),  100–121
8.	Yu. L. Pavlov, “Ob uslovnykh Internet-grafakh, stepeni vershin kotorykh ne imeyut matematicheskogo ozhidaniya”, Diskret. matem., 22:3 (2010), 20–33	→	Random graphs of Internet type and the generalised allocation scheme Yu. L. Pavlov, I. A. Cheplyukova Diskr. Mat., 20:3 (2008),  3–18
9.	Pavlov Yu.L., Dertishnikova E.N., “O predelnom raspredelenii maksimalnoi stepeni vershiny v sluchainom grafe internet-tipa”, Tr. Karelskogo nauchnogo tsentra RAN, 2010, № 3, 59–65	→	Random graphs of Internet type and the generalised allocation scheme Yu. L. Pavlov, I. A. Cheplyukova Diskr. Mat., 20:3 (2008),  3–18
10.	Pavlov Yu.L., Cheplyukova I.A., “Ob asimptotike statistiki tipa $\chi^2$ dlya internet-grafov”, Tr. Karelskogo nauchnogo tsentra RAN, 2010, № 3, 66–71	→	Random graphs of Internet type and the generalised allocation scheme Yu. L. Pavlov, I. A. Cheplyukova Diskr. Mat., 20:3 (2008),  3–18
11.	A. V. Shapovalov, “Kharakteristiki sluchainykh sistem diskretnykh uravnenii pri neravnoveroyatnoi vyborke neizvestnykh”, Matem. vopr. kriptogr., 1:3 (2010), 93–117	→	Consistency and an algorithm recognising inconsistency of realisations of a system of random discrete equations with two-valued unknowns A. V. Shapovalov Diskr. Mat., 20:3 (2008),  28–39
12.	M. I. Tikhomirova, V. P. Chistyakov, “Statisticheskii kriterii tipa kriteriya pustykh yaschikov”, Matem. vopr. kriptogr., 1:1 (2010), 101–108	→	Limit distributions of the number of absent chains of identical outcomes M. I. Tikhomirova Diskr. Mat., 20:3 (2008),  40–46
13.	O. A. Logachev, “O znacheniyakh urovnya affinnosti dlya pochti vsekh bulevykh funktsii”, PDM, 2010, № 3(9), 17–21	→	Asymptotic bounds for the affinity level for almost all Boolean functions M. L. Buryakov Diskr. Mat., 20:3 (2008),  73–79
14.	Snegova E., “Criteria for reducibility of moving objects closeness problem”, Advances in databases and information systems, Lecture Notes in Computer Science, 6295, Springer, Berlin, 2010, 583–586	→	Dynamic databases with optimal in order time complexity I. S. Lapshov Diskr. Mat., 20:3 (2008),  89–100
15.	I. B. Kozhukhov, V. A. Yaroshevich, “O potentsialnoi delimosti matrits nad distributivnymi reshetkami”, Diskret. matem., 22:2 (2010), 148–159	→	On ranks, Green classes, and the theory of determinants of Boolean matrices V. B. Poplavskii Diskr. Mat., 20:4 (2008),  42–60
16.	O. A. Logachev, “O znacheniyakh urovnya affinnosti dlya pochti vsekh bulevykh funktsii”, PDM, 2010, № 3(9), 17–21	→	A lower bound for the affinity level for almost all Boolean functions O. A. Logachev Diskr. Mat., 20:4 (2008),  85–88
17.	I. A. Kravchenko, “O chisle sovpadenii dvukh odnorodnykh sluchainykh bluzhdanii s polozhitelnymi prirascheniyami”, Diskret. matem., 22:3 (2010), 63–74	→	Limit theorems for the number of dense series in a random sequence N. M. Mezhennaya Diskr. Mat., 21:1 (2009),  105–116
18.	E. B. Yarovaya, “Modeli vetvyaschikhsya bluzhdanii i ikh primenenie v teorii nadezhnosti”, Avtomat. i telemekh., 2010, № 7, 29–46	→	Critical branching random walks on low-dimensional lattices E. B. Yarovaya Diskr. Mat., 21:1 (2009),  117–138
19.	Yarovaya E.B., “Monotonnost veroyatnosti vozvrascheniya v istochnik v modelyakh vetvyaschegosya sluchainogo bluzhdaniya”, Vestn. Mosk. un-ta. Ser. 1: Matem. Mekh., 2010, № 2, 44–47	→	Critical branching random walks on low-dimensional lattices E. B. Yarovaya Diskr. Mat., 21:1 (2009),  117–138
20.	E. B. Yarovaya, “Kriterii eksponentsialnogo rosta chisla chastits v modelyakh vetvyaschikhsya sluchainykh bluzhdanii”, Teoriya veroyatn. i ee primen., 55:4 (2010), 705–731	→	Critical branching random walks on low-dimensional lattices E. B. Yarovaya Diskr. Mat., 21:1 (2009),  117–138
1 2  Full list