Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Prikladnaâ diskretnaâ matematika
Année 2018
no. 4
Précédent
Suivant
Volume (2018) no. 4
Sommaire
In memory of Mikhail Mikhailovich Glukhov
G. P. Agibalov
;
I. A. Pankratova
On estimations of distribution of the length of~aperiodicity segment in the graph of
$k$
-fold iteration of~uniform random mapping
V. O. Mironkin
p. 6-17
One approach to constructing a multiply transitive class of block transformations
I. V. Cherednik
p. 18-47
Cryptanalysis of
$2$
-cascade finite automata generator with functional key
I. V. Borovkova
;
I. A. Pankratova
;
E. V. Semenova
p. 48-56
ElGamal cryptosystems on Boolean functions
G. P. Agibalov
p. 57-65
On a semi-superwized graph clustering problem
A. V. Ilev
;
V. P. Il'ev
p. 66-75
Deterministic methods of Ramanujan graph construction for use in cryptographic algorithms based on generalized cellular automata
P. G. Klyucharev
p. 76-93
A resource-efficient algorithm for study the growth in finite two-generator groups of exponent~
$5$
A. A. Kuznetsov
;
A. S. Kuznetsova
p. 94-103
The unicellular microorganisms ``Amoeba Proteus'' locomotion simulation with the use of movable cellular automata method
Y. P. Hazdiuk
;
V. V. Zhikharevich
;
O. M. Nikitina
;
S. E. Ostapov
p. 104-119
Constructing an aggregated relation with a minimum distance from the expert preferences
V. N. Nefedov
;
S. O. Smerchinskaya
;
N. P. Yashina
p. 120-132