THEORETICAL BACKGROUNDS OF APPLIED DISCRETE MATHEMATICS
Minimization of Boolean functions of manyvariables - iterative method and program realization // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 1(3). P. 5–14.
5–14
Bent functions: results and applications. A survey // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 1(3). P. 15–37.
15–37
Logical methods for design and analysis of choice models // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 1(3). P. 38–71.
38–71
COMPUTATIONAL METHODS IN DISCRETE MATHEMATICS
Approximate solution of the traveling salesmanproblem // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 1(3). P. 72–78.
72–78
MATHEMATICAL BACKGROUNDS OF CRYPTOGRAPHY
Modelling of the PKI protocols in the universally composableframework using model checkers // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 1(3). P. 79–92.
79–92
MATHEMATICAL BACKGROUNDS OF COMPUTER SECURITY
Approaches to the construction of the DP-model of file systems // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 1(3). P. 93–113.
93–113
Usage formal models for vulnerability analysis // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 1(3). P. 113–116.
113–116
Security analysis of the information flows by memory in the computersystems with functional and parametric associated entities // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 1(3). P. 117–125.
117–125
Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 1(3).
Download full-text version
Download fileCounter downloads: 271