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

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

The table below contains the list of citations in 2008 to the papers published in 2006–2007. 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.	N. N. Tokareva, “O kvadratichnykh approksimatsiyakh v blochnykh shifrakh”, Probl. peredachi inform., 44:3 (2008), 105–127	→	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
2.	Charpin P., Gong G., “Hyperbent functions, Kloosterman sums, and Dickson polynomials”, IEEE Trans. Inform. Theory, 54:9 (2008), 4230–4238	→	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
3.	A. S. Kuzmin, V. T. Markov, A. A. Nechaev, V. A. Shishkin, A. B. Shishkov, “Bent-funktsii i giperbent-funktsii nad polem iz $2^l$ elementov”, Probl. peredachi inform., 44:1 (2008), 15–37	→	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
4.	M. A. Alekhina, V. I. Volchikhin, “O dvukh metodakh povysheniya nadezhnosti skhem”, Izvestiya vysshikh uchebnykh zavedenii. Povolzhskii region. Fiziko-matematicheskie nauki, 2008, № 4, 17–25	→	On the reliability of schemes in the basis $\{x\vee y\vee z,x\mathbin{\&}y\mathbin{\&}z,\bar{x}\}$ with single-type constant faults at the inputs of the element M. A. Alekhina Diskr. Mat., 18:1 (2006),  116–125
5.	I. A. Kruglov, “Printsip skhodimosti Klossa dlya proizvedenii sluchainykh velichin so znacheniyami v kompaktnoi gruppe, raspredeleniya kotorykh opredelyayutsya tsepyu Markova”, Diskret. matem., 20:1 (2008), 38–51	→	A connection between Markov chains on finite simple semigroups and fundamental groups I. A. Kruglov Diskr. Mat., 18:2 (2006),  48–54
6.	G. A. Mailybaeva, “Poryadok kommunikatsionnoi slozhnosti PIR-protokolov”, Diskret. matem., 20:3 (2008), 136–146	→	Degeneracy bounds for private information retrieval protocols G. A. Mailybaeva Diskr. Mat., 18:2 (2006),  98–110
7.	A. V. Shapovalov, “Kharakteristiki sluchainykh sistem lineinykh uravnenii nad konechnym polem”, Diskret. matem., 20:4 (2008), 136–146	→	The distributions of the numbers of finite subgraphs in random nonhomogeneous hypergraphs A. V. Shapovalov Diskr. Mat., 18:3 (2006),  102–114
8.	V. A. Kolmykov, “O sbalansirovannykh podmnozhestvakh simmetricheskoi inversnoi polugruppy”, Sib. matem. zhurn., 49:4 (2008), 825–828	→	Endomorphisms of functional graphs V. A. Kolmykov Diskr. Mat., 18:3 (2006),  115–119
9.	V. V. Baev, “Nekotorye nizhnie otsenki na algebraicheskuyu immunnost funktsii, zadannykh svoimi sled-formami”, Probl. peredachi inform., 44:3 (2008), 81–104	→	On some algorithms for constructing low-degree annihilators for Boolean functions V. V. Baev Diskr. Mat., 18:3 (2006),  138–151
10.	M. S. Lobanov, “Tochnye sootnosheniya mezhdu nelineinostyu i algebraicheskoi immunnostyu”, Diskretn. analiz i issled. oper., 15:6 (2008), 34–47	→	Exact relation between nonlinearity and algebraic immunity M. S. Lobanov Diskr. Mat., 18:3 (2006),  152–159
11.	S. S. Marchenkov, “Ekvatsionalno zamknutye klassy chastichnykh bulevykh funktsii”, Diskretn. analiz i issled. oper., 15:1 (2008), 82–97	→	On the structure of equationally closed classes S. S. Marchenkov Diskr. Mat., 18:4 (2006),  18–30
12.	S. S. Marchenkov, “Silnye operatory zamykaniya na mnozhestve chastichnykh bulevykh funktsii”, Dokl. RAN, 419:5 (2008), 599–600	→	On the structure of equationally closed classes S. S. Marchenkov Diskr. Mat., 18:4 (2006),  18–30
13.	S. B. Gashkov, I. S. Sergeev, “O postroenii skhem logarifmicheskoi glubiny dlya invertirovaniya v konechnykh polyakh”, Diskret. matem., 20:4 (2008), 8–28	→	An application of the method of additive chains to inversion in finite fields S. B. Gashkov, I. S. Sergeev Diskr. Mat., 18:4 (2006),  56–72
14.	Yu. L. Pavlov, I. A. Cheplyukova, “Sluchainye grafy Internet-tipa i obobschennaya skhema razmescheniya”, Diskret. matem., 20:3 (2008), 3–18	→	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
15.	A. A. Grusho, N. A. Grusho, E. E. Timonina, “Teoremy o nesuschestvovanii sostoyatelnykh posledovatelnostei kriteriev v nekotorykh diskretnykh zadachakh”, Diskret. matem., 20:2 (2008), 25–31	→	Some relations between discrete statistical problems and properties of probability measures on topological spaces A. A. Grusho, E. E. Timonina Diskr. Mat., 18:4 (2006),  128–136
16.	A. A. Grusho, E. E. Timonina, V. M. Chentsov, “Suschestvovanie sostoyatelnykh posledovatelnostei statisticheskikh kriteriev v diskretnykh statisticheskikh zadachakh pri slozhnoi nulevoi gipoteze”, Inform. i ee primen., 2:2 (2008), 64–66	→	Some relations between discrete statistical problems and properties of probability measures on topological spaces A. A. Grusho, E. E. Timonina Diskr. Mat., 18:4 (2006),  128–136
17.	Alexander Grusho, Nick Grusho, Elena Timonina, “Complexity and consistency of statistical criteria”, Sistemy i sredstva inform., 2008, spetsvypusk, 32–39	→	Some relations between discrete statistical problems and properties of probability measures on topological spaces A. A. Grusho, E. E. Timonina Diskr. Mat., 18:4 (2006),  128–136
18.	V. A. Vedernikov, G. V. Savicheva, “Primarno stupenchatye gruppy s sistemami dopolnyaemykh podgrupp”, Sib. matem. zhurn., 49:3 (2008), 515–527	→	On finite groups close to completely factorisable groups V. A. Vedernikov, G. V. Savicheva Diskr. Mat., 19:2 (2007),  78–84
19.	Subramanian V.G., Leith D.J., “On a class of optimal rateless codes”, 2008 46th Annual Allerton Conference on Communication, Control, and Computing, 2008, 418–425	→	Non-asymptotic bounds for probabilities of the rank of a random matrix over a finite field A. N. Alekseichuk Diskr. Mat., 19:2 (2007),  85–93
20.	F. Yu. Vorob’ev, “The structure of the set of satisfying assignments for a random k-CNF”, Comput Math Model, 19:3 (2008), 304	→	A lower bound for the 4-satisfiability threshold F. Yu. Vorob'ev Diskr. Mat., 19:2 (2007),  101–108
1 2  Full list