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

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

The table below contains the list of citations in 2007 to the papers published in 2005–2006. 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.

N	Citing pulication		Cited paper
1.	T. G. Petrosyan, “Verkhnyaya otsenka chisla mnozhestv, svobodnykh ot proizvedenii, v odnom klasse grupp”, Diskret. matem., 19:1 (2007), 76–88	→	On the number of product-free sets in groups of even order T. G. Petrosyan Diskr. Mat., 17:1 (2005),  89–101
2.	Carota C., “A family of power-divergence diagnostics for goodness-of-fit”, Canad. J. Statist., 35:4 (2007), 549–561	→	A power divergence test in the problem of sample homogeneity for a large number of outcomes and trials A. P. Baranov, Yu. A. Baranov Diskr. Mat., 17:2 (2005),  19–48
3.	A. M. Shoitov, “Slozhnoe raspredelenie Puassona dlya chisla povtorenii znachenii diskretnoi funktsii ot tsepochek”, Diskret. matem., 19:2 (2007), 6–26	→	The Poisson approximation for the number of matches of values of a discrete function from chains A. M. Shoitov Diskr. Mat., 17:2 (2005),  56–69
4.	E. V. Khvorostyanskaya, “Ob uslovii vozniknoveniya gigantskogo dereva v sluchainom nepomechennom lese”, Diskret. matem., 19:3 (2007), 35–50	→	Limit theorems on sizes of trees in a random unlabelled forest Yu. L. Pavlov Diskr. Mat., 17:2 (2005),  70–86
5.	V. A. Kolmykov, “Neustoichivye derevya”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 14:3 (2007), 46–52	→	On stable and unstable trees V. A. Kolmykov Diskr. Mat., 17:2 (2005),  150–152
6.	V. A. Kolmykov, “Monoidy i raspad”, Sib. matem. zhurn., 48:6 (2007), 1246–1249	→	On stable and unstable trees V. A. Kolmykov Diskr. Mat., 17:2 (2005),  150–152
7.	I. S. Sergeev, “O slozhnosti gradienta ratsionalnoi funktsii”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 14:4 (2007), 57–75	→	On the complexity of the computation of differentials and gradients S. B. Gashkov, I. B. Gashkov Diskr. Mat., 17:3 (2005),  45–67
8.	A. L. Yakymiv, “Sluchainye $A$-podstanovki: skhodimost k puassonovskomu protsessu”, Matem. zametki, 81:6 (2007), 939–947	→	On the distribution of the $m$th maximal cycle lengths of random $A$-permutations A. L. Yakymiv Diskr. Mat., 17:4 (2005),  40–58
9.	A. L. Yakymiv, “Predelnaya teorema dlya obschego chisla tsiklov sluchainoi $A$-podstanovki”, Teoriya veroyatn. i ee primen., 52:1 (2007), 69–83	→	On the distribution of the $m$th maximal cycle lengths of random $A$-permutations A. L. Yakymiv Diskr. Mat., 17:4 (2005),  40–58
10.	N. N. Tokareva, “Bent-funktsii s bolee silnymi svoistvami nelineinosti: $k$-bent-funktsii”, Diskretn. analiz i issled. oper., ser. 1, ser. 1, 14:4 (2007), 76–102	→	Approximation of Boolean functions by monomial functions A. S. Kuz'min, V. T. Markov, A. A. Nechaev, A. B. Shishkov Diskr. Mat., 18:1 (2006),  9–29
11.	V. A. Kopyttsev, “Mnogomernaya teorema Puassona dlya chisel reshenii, blizkikh k zadannym vektoram, u sistemy sluchainykh lineinykh uravnenii”, Diskret. matem., 19:4 (2007), 3–22	→	On the number of solutions of a system of random linear equations in a set of vectors of a special form V. A. Kopyttsev Diskr. Mat., 18:1 (2006),  40–62
12.	S. N. Zhuk, “Ob onlain-algoritmakh upakovki pryamougolnikov v neskolko polos”, Diskret. matem., 19:4 (2007), 117–131	→	Approximate algorithms for packing rectangles into several strips S. N. Zhuk Diskr. Mat., 18:1 (2006),  91–105
13.	A. V. Shapovalov, “Tsiklovaya struktura sluchainogo neodnorodnogo gipergrafa na dokriticheskom etape evolyutsii”, Diskret. matem., 19:4 (2007), 52–69	→	The distributions of the numbers of finite subgraphs in random nonhomogeneous hypergraphs A. V. Shapovalov Diskr. Mat., 18:3 (2006),  102–114
14.	V. V. Baev, “Usovershenstvovannyi algoritm poiska annigilyatorov nizkoi stepeni dlya mnogochlena Zhegalkina”, Diskret. matem., 19:4 (2007), 132–138	→	On some algorithms for constructing low-degree annihilators for Boolean functions V. V. Baev Diskr. Mat., 18:3 (2006),  138–151
15.	A. V. Kolchin, V. F. Kolchin, “Perekhod s odnoi reshetki na druguyu raspredelenii summ sluchainykh velichin, vstrechayuschikhsya v obobschennoi skheme razmescheniya”, Diskret. matem., 19:3 (2007), 15–21	→	On transition of distributions of sums of independent identically distributed random variables from one lattice to another in the generalised allocation scheme A. V. Kolchin, V. F. Kolchin Diskr. Mat., 18:4 (2006),  113–127