|
In memory of Mikhail Mikhailovich Glukhov
G. P. Agibalov, I. A. Pankratova
|
5 |
|
|
Theoretical Backgrounds of Applied Discrete Mathematics
|
|
|
On estimations of distribution of the length of aperiodicity segment in the graph of $k$-fold iteration of uniform random mapping
V. O. Mironkin
|
6–17 |
|
|
One approach to constructing a multiply transitive class of block transformations
I. V. Cherednik
|
18–47 |
|
|
Mathematical Methods of Cryptography
|
|
|
Cryptanalysis of $2$-cascade finite automata generator with functional key
I. V. Borovkova, I. A. Pankratova, E. V. Semenova
|
48–56 |
|
|
ElGamal cryptosystems on Boolean functions
G. P. Agibalov
|
57–65 |
|
|
Applied Graph Theory
|
|
|
On a semi-superwized graph clustering problem
A. V. Ilev, V. P. Il'ev
|
66–75 |
|
|
Deterministic methods of Ramanujan graph construction for use in cryptographic algorithms based on generalized cellular automata
P. G. Klyucharev
|
76–93 |
|
|
Computational Methods in Discrete Mathematics
|
|
|
A resource-efficient algorithm for study the growth in finite two-generator groups of exponent $5$
A. A. Kuznetsov, A. S. Kuznetsova
|
94–103 |
|
|
Discrete Models for Real Processes
|
|
|
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
|
104–119 |
|
|
Mathematical Foundations of Intelligent Systems
|
|
|
Constructing an aggregated relation with a minimum distance from the expert preferences
V. N. Nefedov, S. O. Smerchinskaya, N. P. Yashina
|
120–132 |
Contact us: