Diskr. Mat., 2009, Volume 21, Issue 3

JOURNALS // Diskretnaya Matematika // Archive

2009, Volume 21, Issue 3

	On five types of stability of the lexicographic variant of the combinatorial bottleneck problem E. E. Gurevskii, V. A. Emelichev		3
	On the limit distributions of the vertex degrees of conditional Internet graphs Yu. L. Pavlov		14
	On the estimation of the periods of noisy binary periodic sequences M. I. Tikhomirova, V. P. Chistyakov		24
	On a constructive approach to the calculation of cardinality of the Ryser classes V. S. Krotkin, O. V. Kuzmin		33
	Positively closed classes of three-valued logic generated by one-place functions S. S. Marchenkov		37
	On the game-theoretical approach to the analysis of authentication codes A. Yu. Zubov		45
	On combinatorial Gray codes with distance 3 A. M. Romanov		73
	Optimal paths in oriented graphs and eigenvectors in $\max$-$\oplus$ systems V. D. Matveenko		79
	The factorisation of one-generated partially foliated formations A. B. Elovikov		99
	On finite lattices of topologies of commutative unary algebras A. V. Kartashova		119
	The key space of the McEliece–Sidelnikov cryptosystem I. V. Chizhov		132