6–8
Alekseenko E.S. An algorithm of computing D-gap numbers and D-weierstrass points. // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 6–8.
8–9
Evdokimov A. A. Coding of finite integer lattice by means of mappings with a bounded distortion. // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 8–9.
9–11
11–12
Kolcheva O.L., Pankratova I. A. Statistical independence of the boolean function superposition // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 11–12.
13–14
Korsakova E. P. Classification of anf graphs for quadratic bent functions in 6 variables // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 13–14.
14–16
Parvatov N. G. Weakly central clones and completeness problem for them // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 14–16.
16–17
Pichkur A. B. Description of the class of permutations, represented as a product of two ermutations with fixed number of mobile points // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 16–17.
17–18
Pogorelov B.A., Pudovkina M. A. On approximation of permutations by imprimitive groups // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 17–18.
18–20
Potapov V. N. On perfect 2-colorings of the Q-ary hypercube // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 18–20.
20–21
Pryanichnikova E. A. Algebras of languages associated with labelled graphs // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 20–21.
21–23
Tokareva N. N. Hypotheses for the number of bent functions // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 21–23.
24–25
Abornev A. V., Bylkov D. N. Polynomials over primary residue rings with a small unique distance // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 24–25.
26–27
Andreeva L. N. Mapping enlargements preserving identification property // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 26–27.
27–29
Artamonov A. V., Vasilev P. N., Makhovenko E. B. Provable secure dynamic group signature scheme // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 27–29.
29–31
Voronin R. I. Algebraic cryptanalysis of one-round S-AES // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 29–31.
31–32
Erofeev S. Y. Discrete logarithm diophantiness // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 31–32.
32–33
Erofeev S. Y, Romankov V.A. Constructing of one-way functions based on undecidability of the endomorphism problem in groups // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 32–33.
33–34
Kovalev D.S., Trenkaev V.N. FPGA implementation of finite automata public key cryptosystem // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 33–34.
34–36
Kukalo I. A. Analysis of the GOST 28147-89 modes of operation that provide confidentiality // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 34–36.
36–38
Lebedeva O. N. On the choice of slid pairs for the correlation cryptanalysis of KeeLoq // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 36–38.
38–39
Pudovkina M. A. On impossible truncated differentials of XSL ciphers // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 38–39.
40–41
Abrosimov M.B., Matorin A. A. Reliability analysis of graphical CAPTCHA-systems by the example of KCAPTCHA // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 40–41.
42–43
Devyanin P. N. About the role dp-model for access and information flows control in operating systems of Linux family // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 42–43.
44–46
Kachanov M. A. Role-based security model of SELinux computer system // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 44–46.
46–48
Kolegov D. N. The development feutures of network access control DP-model // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 46–48.
48–50
Kononov D.D, Isaev S. V. The security model for cross-platform web services of municipal procurement support // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 48–50.
50–55
Miloshenko A. V., Solovjev T.M, Chernyak R.I, Shumskaya M. V. Development of comprehensive taught system that protects information resources from phishing attacks // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 50–55.
55–57
Proskurin V. G. Approaches to development of discretionary dp-model of the modern secure operating systems // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 55–57.
58–60
Bykova V. V. FPT-algorithms and their classification on the base of elasticity // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 58–60.
60–61
Safonov K. V., Kalugin-Balashov D. A. About phrase-structure grammar property // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 60–61.
61–62
Stephantsov D.A., Kryukova A. E. A denotational semantics for the aspecttalk programming language // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 61–62.
62–65
Stephantsov D.A., Tkachenko N. O, Chernov D. V., Shmakova R. V. Design and implementation of the orm library in С + + // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 62–65.
66–67
Zaikin O.S. Solving of cryptanalysis problems in grid systems ( by the example of BOINC) // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 66–67.
67–68
Kolomeec N. A., Pavlov A. V. "Boolean Functions" is a system for the work with boolean functions // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 67–68.
68–69
Semenov A. A., Otpuschennikov I.V., Kochemazov S.E. Application of SAT-approach for solving combinatorial problems // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 68–69.
69–73
Fomichev V. M. On parallel computations in implementation of the meat-in-the-middle attack // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 69–73.
74–76
Berezovsky Yu.V, Vorob'ev V.A. C-model of a predator - prey growth in the ecological niche // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 74–76.
76–78
Salii V. N. On skeleton automata // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 76–78.
78–79
Trenkaev V.N. Fault attack on reconfigurable fsm-based cipher of Zakrevskij // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 78–79.
80–81
Abrosimov M.B., Bondarenko P.P. Minimal extensions for cycles with vertices of two types // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 80–81.
81–82
Abrosimov M.B., Dolgov A. A. On the uniqueness of exact vertex extensions // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 81–82.
83–84
Abrosimov M. B, Komarov D. D. On minimal edge 1-extensions of two special form trees // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 83–84.
84–85
Abrosimov M. B, Modenova O. V. On properties of minimal extensions of orgraphs // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 84–85.
85–87
Bykova V. V. Computational aspects of treewidth for graph // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 85–87.
88–89
Vlasova A. V. On attractors of dynamical systems associated with cycles // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 88–89.
90–91
Grunsky I. S., Sapunov S. V. On mobile agent self-location using topological properties of environment // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 90–91.
91–92
Karmanova E. O. On congruences of paths // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 91–92.
93–94
Kochkarov A. A., Sennikova L.I, Bolurov N.N. On some prefractal graphs properties // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 93–94.
94–96
Melent'ev V.A. Compact graphs and the deterministic algorithm for their synthesis // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 94–96.
96–98
Melent'ev V.A. Restrictions on girths in compact graphs // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 96–98.
98–100
Fomichev V. M. The improvement of exponent's estimates for primitive graphs // Applied Discrete Mathematics. Supplement. 2011. № 4. P. 98–100.
