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

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

The table below contains the list of citations in 2005 to the papers published in 2003–2004. 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.	S. V. Nagaev, V. I. Vakhtel, “Veroyatnostnye neravenstva dlya kriticheskogo protsessa Galtona–Vatsona”, Teoriya veroyatn. i ee primen., 50:2 (2005), 266–291	→	Limit theorems for probabilities of large deviations of a Galton-Watson process S. V. Nagaev, V. I. Vakhtel' Diskr. Mat., 15:1 (2003),  3–27
2.	A. F. Ronzhin, “Rasshireniya informatsionnykh protokolov, osnovannykh na otobrazheniyakh konechnykh mnozhestv”, Diskret. matem., 17:4 (2005), 18–28	→	Estimation of the time required to organize a secret channel A. A. Grusho, E. E. Timonina Diskr. Mat., 15:2 (2003),  40–46
3.	Galatenko A., Grusho A., Kniazev A., Timonina E., “Statistical covert channels through PROXY server”, Computer network security, Third International Workshop on Mathematical Methods, Models, and Architectures for Computer Network Security, MMM-ACNS 2005 (St. Petersburg, Russia, September 24–28, 2005), Proceedings, Lecture Notes in Comput. Sci., 3685, Springer, Berlin–Heidelberg, 2005, 424–429	→	Estimation of the time required to organize a secret channel A. A. Grusho, E. E. Timonina Diskr. Mat., 15:2 (2003),  40–46
4.	Cho Soojin, Ha Kil-Chan, Kim Young-One, Moon Dongho, “Key exchange protocol using matrix algebras and its analysis”, J. Korean Math. Soc., 42:6 (2005), 1287–1309	→	Public key distribution schemes based on a noncommutative group M. A. Cherepnev Diskr. Mat., 15:2 (2003),  47–51
5.	V. I. Senashov, A. I. Sozutov, V. P. Shunkov, “Issledovaniya grupp s usloviyami konechnosti v Krasnoyarske”, UMN, 60:5(365) (2005), 3–46	→	Almost layer-finiteness of the periodic part of a group without involutions V. I. Senashov, V. P. Shunkov Diskr. Mat., 15:3 (2003),  91–104
6.	A. M. Shoitov, “Puassonovskoe priblizhenie dlya chisla povtorenii znachenii diskretnoi funktsii ot tsepochek”, Diskret. matem., 17:2 (2005), 56–69	→	Structural equivalence of $s$-tuples in random discrete sequences V. G. Mikhailov, A. M. Shoitov Diskr. Mat., 15:4 (2003),  7–34
7.	K. G. Omelyanov, “O chisle nezavisimykh mnozhestv v povrezhdennykh grafakh Keli”, Diskret. matem., 17:3 (2005), 105–108	→	On the number and structure of sum-free sets in a segment of positive integers K. G. Omel'yanov, A. A. Sapozhenko Diskr. Mat., 15:4 (2003),  141–147
8.	Yu. L. Pavlov, “Predelnye teoremy dlya ob'emov derevev v sluchainom nepomechennom lese”, Diskret. matem., 17:2 (2005), 70–86	→	On limit theorems for the generalised allocation scheme A. V. Kolchin Diskr. Mat., 15:4 (2003),  148–157
9.	A. V. Kolodzei, “Teorema o veroyatnostyakh bolshikh uklonenii dlya razdelimykh statistik, ne uovletvoryayuschikh usloviyu Kramera”, Diskret. matem., 17:2 (2005), 87–94	→	On limit theorems for the generalised allocation scheme A. V. Kolchin Diskr. Mat., 15:4 (2003),  148–157
10.	B. A. Sevastyanov, “Skhodimost po raspredeleniyu sluchainykh otobrazhenii konechnykh mnozhestv k vetvyaschimsya protsessam”, Diskret. matem., 17:1 (2005), 18–21	→	Some classes of random mappings of finite sets, and nonhomogeneous branching processes B. A. Sevast'yanov Diskr. Mat., 16:1 (2004),  9–13
11.	V. A. Emelichev, K. G. Kuzmin, “Analiz chuvstvitelnosti effektivnogo resheniya vektornoi bulevoi zadachi minimizatsii proektsii lineinykh funktsii na $\mathbb R_+$ i $\mathbb R_-$”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 12:2 (2005), 24–43	→	A formula for the stability radius of a vector $l_\infty$-extremal trajectory problem V. A. Emelichev, V. N. Krichko Diskr. Mat., 16:1 (2004),  14–20
12.	Yu. L. Pavlov, “Predelnye teoremy dlya ob'emov derevev v sluchainom nepomechennom lese”, Diskret. matem., 17:2 (2005), 70–86	→	Limit theorems for the sizes of trees of an unlabeled graph of a random mapping Yu. L. Pavlov Diskr. Mat., 16:3 (2004),  63–75
13.	Emelichev V., Kuz'Min K., Nikulin Y., “Stability analysis of the Pareto optimal solutions for some vector boolean optimization problem”, Optimization, 54:6 (2005), 545–561	→	Stability analysis of a strictly efficient solution of a vector problem of Boolean programming in the metric $l_1$ V. A. Emelichev, K. G. Kuz'min Diskr. Mat., 16:4 (2004),  14–19