THEORETICAL BACKGROUNDS OF APPLIED DISCRETE MATHEMATICS
LOWER AND UPPER NEIGHBORHOODS IN SET WITHCLOSURE PROPERTY // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 5–13.
5–13
APN-FUNCTIONS // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 14–20.
14–20
ON COMPLEXITY OF FORMAL CODING METHOD FOR ANALYSIS OF GENERATOR WITH MONOCYCLE SUBSTITUTIONAL TRANSITION FUNCTION // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 21–28.
21–28
ALMOST ALL LATIN SQUARES HAVE TRIVIAL AU-TOPARATOPY GROUP // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 29–32.
29–32
COMPUTATIONAL METHODS IN DISCRETE MATHEMATICS
DISCRETE MODELS OF PHYSICAL-CHEMICAL PROCESSES // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 33–49.
33–49
CELLULAR-AUTOMATON MODEL FOR EXPLOSION SIMULATION // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 50–58.
50–58
MATHEMATICAL METHODS OF CRYPTOGRAPHY
SYMMETRIC STREAM AND FINITE AUTOMATON CIPHERSYSTEMS // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 59–68.
59–68
MATHEMATICAL BACKGROUNDS OF COMPUTER SECURITY
ANALYSIS OF CONDITIONS FOR RECEPTION OF ACCESS OWNING WITHIN THE BASE ROLE DP-MODEL OF COMPUTER SYSTEMS WITHOUT MEMORY INFORMATION FLOWS // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 69–84.
69–84
DP-MODEL OF COMPUTER STEGANOGRAPHY SYSTEM // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 85–90.
85–90
MODELING NETWORK COMPUTER SYSTEMS WITH VULNERABILITIES // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 91–99.
91–99
THE IMPLEMENTATION OF THE DBMS CREDENTIALS PROTECTION METHOD IN THE WEB APPLICATIONS // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 100–105.
100–105
APPLIED THEORY OF AUTOMATA
TEST SUITES DERIVATION FOR NONDETERMINISTIC FINITE STATE MASHINES WITH RESPECT TO THE SEPARABILITY RELATION // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 106–111.
106–111
MATHEMATICAL BACKGROUNDS OF INFORMATICS ANDPROGRAMMING
AN ANALITIC APPROACH IN THE THEORY OF CONTEXT-FREE LANGUAGES GREIBACH NORMAL FORM // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 112–116.
112–116
METHOD FOR AUTOMATED PROGRAM ERRORS SEARCH IN COMPLEX DATA PROCESSING ALGORITHMS // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5). P. 117–127.
117–127
Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2009. № 3(5).
Download full-text version
Download fileCounter downloads: 208