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
Précédent
Suivant
Sommaire du
Fascicule no. 1
On extreme joint probabilities of~
$k$
events chosen from~
$n$
events
Yu. A. Zuev
p. 5-12
On an invariant for the problem of underdetermined data decomposing
L. A. Sholomov
p. 13-32
EHE: nonce misuse-resistant message authentication
S. V. Agievich
p. 33-41
Multilevel thematic-hierarchical access control (MLTHS-system)
N. A. Gaydamakin
p. 42-57
The level of negative roles of the hierarchical representation of MROSL DP-model
P. N. Devyanin
p. 58-71
List decoding of the biorthogonal wavelet code with predetermined code distance on a~field of odd characteristic
D. V. Litichevskiy
p. 72-77
On the local invertibility of finite state information lossless automata
O. A. Logachev
p. 78-93
On complexity of the satisfiability problem of systems over finite posets
A. Y. Nikitin
;
A. N. Rybalov
p. 94-98
Index intervals in LYaPAS
A. A. Pesnyak
;
D. A. Stefantsov
p. 99-106
Convergence of an iterative algorithm for computing parameters of multi-valued threshold functions
A. V. Burdelev
p. 107-115
Fast algorithm of cluster analysis
$k$
-medoids
I. N. Dmitriev
p. 116-127
Sommaire du
Fascicule no. 2
The class of balanced algebraic threshold functions
D. A. Soshin
p. 5-9
Linear decomposition of Boolean functions into a~sum or a~product of components
A. V. Cheremushkin
p. 10-22
Asymmetric cryptosystems on Boolean functions
G. P. Agibalov
;
I. A. Pankratova
p. 23-33
Mathematical methods in solutions of the problems presented at the Third International Students' Olympiad in Cryptography
N. Tokareva
;
A. Gorodilova
;
S. Agievich
;
V. Idrisova
;
N. Kolomeec
;
A. Kutsenko
;
A. Oblaukhov
;
G. Shushuev
p. 34-58
Efficient steganography detection by means of~compression-based integral classifier
V. A. Monarev
;
A. I. Pestunov
p. 59-71
Deniable group communications in the presence of global unlimited adversary
V. F. Sheidaev
;
D. Y. Gamayunov
p. 72-86
Study of graph isomorphism using Jordan forms of adjacency matrices
M. I. Volodicheva
;
S. N. Leora
p. 87-99
Relativized generic classes~
$\mathrm P$
and~
$\mathrm{NP}$
A. N. Rybalov
p. 100-104
Construction of a~Hamming network based on~a~crossbar with binary memristors
M. S. Tarkov
p. 105-113
Formal grammar of Russian language in examples
Ya. M. Mirzabekov
;
Sh. B. Shihiev
p. 114-126
Sommaire du
Fascicule no. 3
On the number of homogeneous nondegenerate
$p$
-ary functions of the given degree
M. I. Anokhin
p. 5-16
On constructing APN permutations using subfunctions
V. A. Idrisova
p. 17-27
Criteria for Markov block ciphers
O. V. Denisov
p. 28-37
A nonlinear decomposition method in analysis of some encryption schemes using group automorphisms
V. A. Roman'kov
;
A. A. Obzor
p. 38-45
Periods of
$\varphi$
-graphs
N. A. Artemova
p. 46-53
The check of the correspondence of the directed graph to the algebraic lattice
S. V. Belim
;
N. F. Bogachenko
p. 54-65
Structural properties of minimal primitive digraphs
P. V. Lebedev
p. 66-75
New families of multiplicative circulant networks
E. A. Monakhova
p. 76-84
Minimization of syntax diagrams with multiport components
Yu. D. Ryazanov
p. 85-97
The architecture of a~neural network with a~sequential division of images into pairs
P. Sh. Geidarov
p. 98-109
Method for sequential activation of limitations in~linear programming
V. S. Kolosov
p. 110-125
Sommaire du
Fascicule no. 4
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