Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Diskretnaya Matematika
Tome 21 (2009)
no. 3
Précédent
Suivant
Volume 21 (2009) no. 3
Sommaire
On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
E. E. Gurevskii
;
V. A. Emelichev
p. 3-13
On the limit distributions of the vertex degrees of conditional Internet graphs
Yu. L. Pavlov
p. 14-23
On the estimation of the periods of noisy binary periodic sequences
M. I. Tikhomirova
;
V. P. Chistyakov
p. 24-32
On a~constructive approach to the calculation of cardinality of the Ryser classes
V. S. Krotkin
;
O. V. Kuzmin
p. 33-36
Positively closed classes of three-valued logic generated by one-place functions
S. S. Marchenkov
p. 37-44
On the game-theoretical approach to the analysis of authentication codes
A. Yu. Zubov
p. 45-72
On combinatorial Gray codes with distance~3
A. M. Romanov
p. 73-78
Optimal paths in oriented graphs and eigenvectors in
$\max$
-
$\oplus$
systems
V. D. Matveenko
p. 79-98
The factorisation of one-generated partially foliated formations
A. B. Elovikov
p. 99-118
On finite lattices of topologies of commutative unary algebras
A. V. Kartashova
p. 119-131
The key space of the McEliece--Sidelnikov cryptosystem
I. V. Chizhov
p. 132-159