Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Diskretnaya Matematika
Tome 10 (1998)
no. 1
Précédent
Suivant
Volume 10 (1998) no. 1
Sommaire
Hidden channels and information security in computer systems
A. A. Grusho
p. 3-9
The number of
$q$
-ary words with restrictions on the length of a maximal series
A. V. Kostochka
;
V. D. Mazurov
;
L. Ja. Savel'ev
p. 10-19
On the radii of stability, quasistability and steadiness of a vector trajectory problem of lexicographic optimization
V. A. Emelichev
;
R. A. Berdysheva
p. 20-27
Transitivity-preserving operators on relations
L. A. Sholomov
p. 28-45
Lower bounds for the complexity of systems of vectors of
$k$
-valued logic
A. V. Chashkin
p. 46-62
A lower bound for the complexity of inclusive search in the class of tree-like circuits
È. È. Gasanov
p. 63-72
On the maximal
$t$
-packing of a complete multipartite graph
S. G. Sal'nikov
p. 73-81
Asymptotics of the permanents of some
$(0,1)$
-matrices
V. N. Shevchenko
;
A. A. Pavlyuchenok
p. 82-86
The total vertex separation number and the profile of graphs
P. A. Golovach
;
F. V. Fomin
p. 87-94
On the uniqueness of the moment problem in the class of
$q$
-distributions
A. N. Alekseichuk
p. 95-110
The emergence of a giant tree in a random forest
I. A. Cheplyukova
p. 111-126
On combinatorial functions related to the B\"urman--Lagrange series. Quasi-orthogonality relations
B. I. Selivanov
p. 127-140
Limit theorems for a moderately subcritical branching process in a random environment
V. I. Afanasyev
p. 141-157