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

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

The table below contains the list of citations in 2012 to the papers published in 2010–2011. 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 3  Full list
N	Citing pulication		Cited paper
1.	S. S. Marchenkov, “O resheniyakh sistem funktsionalnykh uravnenii avtomatnogo tipa”, Diskretn. analiz i issled. oper., 19:4 (2012), 86–98	→	On the complexity of the $\mathscr E^2$ Grzegorczyk class S. S. Marchenkov Diskr. Mat., 22:1 (2010),  5–16
2.	V. A. Edemskii, O. V. Antonova, “Lineinaya slozhnost obobschennykh tsiklotomicheskikh posledovatelnostei s periodom $2^mp^n$”, PDM, 2012, № 3(17), 5–12	→	On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes V. A. Edemskii Diskr. Mat., 22:1 (2010),  74–82
3.	V. A. Edemskii, O. V. Antonova, “Lineinaya slozhnost obobschennykh tsiklotomicheskikh posledovatelnostei s periodom $2^mp^n$”, PDM. Prilozhenie, 2012, № 5, 8–9	→	On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes V. A. Edemskii Diskr. Mat., 22:1 (2010),  74–82
4.	Hu L., Yue Q., Wang M., “The linear complexity of Whiteman's generalized cyclotomic sequences of period $p^{m+1}q^{n+1}$”, IEEE Trans. Inform. Theory, 58:8 (2012), 5534–5543	→	On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes V. A. Edemskii Diskr. Mat., 22:1 (2010),  74–82
5.	Antonova O.V., Pavlova A.V., “O lineinoi slozhnosti posledovatelnostei Uitmena chetvertogo poryadka”, Vestnik Novgorodskogo gos. un-ta im. Yaroslava Mudrogo, 2012, № 3, 123–125	→	On the linear complexity of binary sequences on the basis of biquadratic and sextic residue classes V. A. Edemskii Diskr. Mat., 22:1 (2010),  74–82
6.	A. N. Cherepov, “Priblizhenie nepreryvnykh funktsii konechnymi avtomatami”, Diskret. matem., 24:3 (2012), 82–89	→	On approximation of continuous functions by determinate functions with delay A. N. Cherepov Diskr. Mat., 22:1 (2010),  83–103
7.	Khan M.A., Pirzada S., Kayibi K.K., “Scores, inequalities and regular hypertournaments”, Math. Inequal. Appl., 15:2 (2012), 343–351	→	Score lists in $[h$-$k]$-bipartite hypertournaments Sh. Pirzada, T. A. Chishti, T. A. Naikoo Diskr. Mat., 22:1 (2010),  150–157
8.	V. A. Kopyttsev, V. G. Mikhailov, “Predelnye teoremy puassonovskogo tipa dlya obobschennogo lineinogo vklyucheniya”, Diskret. matem., 24:3 (2012), 108–121	→	Poisson-type theorems for the number of special solutions of a random linear inclusion V. A. Kopyttsev, V. G. Mikhailov Diskr. Mat., 22:2 (2010),  3–21
9.	V. A. Kopyttsev, V. G. Mikhailov, “Usloviya skhodimosti k raspredeleniyu Puassona dlya chisel reshenii sluchainykh vklyuchenii”, Matem. vopr. kriptogr., 3:3 (2012), 35–55	→	Poisson-type theorems for the number of special solutions of a random linear inclusion V. A. Kopyttsev, V. G. Mikhailov Diskr. Mat., 22:2 (2010),  3–21
10.	A. M. Zubkov, V. I. Kruglov, “Momentnye kharakteristiki vesov vektorov v sluchainykh dvoichnykh lineinykh kodakh”, Matem. vopr. kriptogr., 3:4 (2012), 55–70	→	Poisson-type theorems for the number of special solutions of a random linear inclusion V. A. Kopyttsev, V. G. Mikhailov Diskr. Mat., 22:2 (2010),  3–21
11.	E. E. Dyakonova, “Mnogotipnye vetvyaschiesya protsessy, evolyutsioniruyuschie v markovskoi srede”, Diskret. matem., 24:3 (2012), 130–151	→	Asymptotic properties of multitype critical branching processes evolving in a random environment V. A. Vatutin, E. E. Dyakonova Diskr. Mat., 22:2 (2010),  22–40
12.	O. A. Logachev, S. V. Smyshlyaev, V. V. Yaschenko, “$\rho$-uravnoveshennye bulevy funktsii”, Diskret. matem., 24:2 (2012), 154–159	→	Barriers of perfectly balanced Boolean functions S. V. Smyshlyaev Diskr. Mat., 22:2 (2010),  66–79
13.	Smyshlyaev S.V., “Perfectly balanced Boolean functions and Golić conjecture”, J. Cryptology, 25:3 (2012), 464–483	→	Barriers of perfectly balanced Boolean functions S. V. Smyshlyaev Diskr. Mat., 22:2 (2010),  66–79
14.	Ana Sălăgean, David Gardner, Raphael Phan, Lecture Notes in Computer Science, 7280, Sequences and Their Applications – SETA 2012, 2012, 136	→	Barriers of perfectly balanced Boolean functions S. V. Smyshlyaev Diskr. Mat., 22:2 (2010),  66–79
15.	Amerbaev V.M., Kozhukhov I.B., Revyakin A.M., “Predstavleniya binarnykh otnoshenii v teorii izmerenii i poleznosti dlya otsenki sotsialnogo kapitala”, Vestnik Moskovskoi gosudarstvennoi akademii delovogo administrirovaniya. Ser. Ekonomika, 2012, № 4, 66–71	→	On the potential divisibility of matrices over distributive lattices I. B. Kozhukhov, V. A. Yaroshevich Diskr. Mat., 22:2 (2010),  148–159
16.	Cheplyukova I.A., “O predelnykh raspredeleniyakh nekotorykh chislovykh kharakteristik internet-grafov”, Trudy Karelskogo nauchnogo tsentra RAN, 2012, № 5, 110–121	→	On conditional Internet graphs whose vertex degrees have no mathematical expectation Yu. L. Pavlov Diskr. Mat., 22:3 (2010),  20–33
17.	Pavlov Yu.L., “O predelnykh raspredeleniyakh stepenei vershin uslovnogo konfiguratsionnogo sluchainogo grafa”, Trudy Karelskogo nauchnogo tsentra RAN, 2012, № 5, 78–88	→	On conditional Internet graphs whose vertex degrees have no mathematical expectation Yu. L. Pavlov Diskr. Mat., 22:3 (2010),  20–33
18.	Shabanov D.A., “On $r$-chromatic hypergraphs”, Discrete Math., 312:2 (2012), 441–458	→	On proper colourings of hypergraphs using prescribed colours A. P. Rozovskaya, D. A. Shabanov Diskr. Mat., 22:3 (2010),  94–109
19.	D. S. Romanov, “Metod sinteza legkotestiruemykh skhem v odnom bazise, dopuskayuschikh edinichnye proveryayuschie testy konstantnoi dliny”, Vestn. Mosk. un-ta. Ser. 1. Matem., mekh., 2012, № 2, 24–29	→	Synthesis of easily testable circuits over the Zhegalkin basis in the case of constant faults of type 0 at outputs of elements Yu. V. Borodina, P. A. Borodin Diskr. Mat., 22:3 (2010),  127–133
20.	A. A. Serov, “Otsenka chisla bulevykh funktsii, imeyuschikh kvadratichnye priblizheniya zadannoi tochnosti”, Diskret. matem., 24:3 (2012), 90–107	→	Bounds for the number of Boolean functions admitting affine approximations of a given accuracy A. M. Zubkov, A. A. Serov Diskr. Mat., 22:4 (2010),  3–19
1 2 3  Full list