Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Prikladnaâ diskretnaâ matematika
Année 2017
Précédent
Suivant
Sommaire du
Fascicule no. 1
Homomorphic stability of finite groups
M. I. Kabenyuk
p. 5-13
Estimator for the distribution of the numbers of runs in a~random sequence controlled by stationary Markov chain
N. M. Mezhennaya
p. 14-28
On the rank of random quadratic form over finite field
A. V. Cheremushkin
p. 29-37
About
$2$
-cascade finite automata cryptographic generators and their cryptanalysis
G. P. Agibalov
;
I. A. Pankratova
p. 38-47
Overview of attacks on AES-128: to the
$15^\text{th}$
anniversary of~AES
K. D. Zhukov
p. 48-62
Detecting DOM-based XSS vulnerabilities using debug API of the modern web-browser
D. A. Sigalov
;
A. V. Razdobarov
;
A. A. Petukhov
p. 63-75
Application of one method of linear code recognition to the wire-tap channel
Y. V. Kosolapov
;
O. Y. Turchenko
p. 76-88
Conditions of primitivity and exponent bounds for sets of digraphs
Y. E. Avezova
;
V. M. Fomichev
p. 89-101
Cellular-automata models of natural processes, implementation on supercomputers
O. L. Bandman
p. 102-121
Sommaire du
Fascicule no. 2
Random equations over free semilattices
M. A. Vakhrameev
p. 5-12
Improving the rate of convergence in the multidimensional central limit theorem for sums of locally dependent random vectors
A. V. Volgin
p. 13-24
Application of Gauss sums to calculate the exact values of the number of appearances of elements on cycles of linear recurrences
M. M. Glukhov
;
O. V. Kamlovskii
p. 25-50
On solvability of regular equations in the variety of metabelian groups
V. A. Roman'kov
p. 51-58
Cryptautomata with functional keys
G. P. Agibalov
p. 59-72
Compactly supported functions in cryptography algorithms
A. V. Shchurenko
;
V. L. Leontiev
p. 73-83
Automated static analysis and classification of Android malware using permission and API calls models
A. A. Skovoroda
;
D. Y. Gamayunov
p. 84-105
On generic NP-completeness of the Boolean satisfiability problem
A. N. Rybalov
p. 106-112
On the non-redundant representation of the minimax basis of strong associations
V. V. Bykova
;
A. V. Kataeva
p. 113-126
Sommaire du
Fascicule no. 3
On the two definitions of degree of a~function over an associative, commutative ring
M. I. Anokhin
p. 5-19
Hyperelliptic curves, Cartier--Manin matrices and Legendre polynomials
S. A. Novoselov
p. 20-31
On primitivity of mixing digraphs associated with
$2$
-feedbacks shift registers
A. M. Koreneva
p. 32-51
General algebraic cryptographic key exchange scheme and its cryptanalysis
V. A. Roman'kov
;
A. A. Obzor
p. 52-61
Estimations of unreliability of circuits in Rosser--Turkett~basis (in
$P_3$
) with faults of type~
$0$
at the outputs of gates
M. A. Alekhina
;
O. Yu. Barsukova
p. 62-75
On application of multidimensional complex analysis in formal language and grammar theory
O. I. Egorushkin
;
I. V. Kolbasina
;
K. V. Safonov
p. 76-89
Effective translation for LL(1)-grammar in the example of a~programming language
Yu. L. Kostyuk
p. 90-99
On generic complexity of decidability problem for Diophantine systems in the Skolem's form
A. N. Rybalov
p. 100-106
Reduction of synapses in the Hopfield autoassociative memory
M. S. Tarkov
p. 107-113
Optimal routing by landmarks in the time-dependent networks
V. V. Bykova
;
A. A. Soldatenko
p. 114-123
Sommaire du
Fascicule no. 4
One approach to constructing a~transitive class of block transformations
I. V. Cherednik
p. 5-34
On almost nilpotent varieties of anticommutative metabelian algebras
O. V. Shulezhko
;
N. P. Panov
p. 35-48
On irreducible algebraic sets over linearly ordered semilattices~II
A. N. Shevlyakov
p. 49-56
Substitution block ciphers with functional keys
G. P. Agibalov
p. 57-65
Single fault detection tests for logic networks of AND, NOT gates
K. A. Popkov
p. 66-88
On minimal vertex
$1$
-extensions of path orientation
M. B. Abrosimov
;
O. V. Modenova
p. 89-94
On generic complexity of the problem of finding roots in groups of residues
A. N. Rybalov
p. 95-100
Complexes in LYaPAS
V. O. Safonov
;
D. A. Stefantsov
p. 101-109
Analysis of
$L$
-structure of polyhedron in the partial MAX SAT problem
A. V. Adelshin
;
A. K. Kuchin
p. 110-118
Improvement of the lower bound for the complexity of exponentiation
V. V. Kochergin
;
D. V. Kochergin
p. 119-132