|
Theoretical Foundations of Applied Discrete Mathematics
|
|
Solving parallel equations over $\omega$-regular languages
V. G. Bushkov, N. V. Evtushenko
|
6–7 |
|
|
The degree of proximity of the Boolean function reduced representation to the class of monomial functions according to basis selection
A. V. Ivanov
|
7–9 |
|
|
Properties of bent functions with minimal distance
N. A. Kolomeets, A. V. Pavlov, A. A. Levin
|
9–10 |
|
|
About finite lower neighbourhood in functional space
N. G. Parvatov
|
11 |
|
|
About tseitin's transformation in logical equations
A. A. Semenov
|
12–13 |
|
|
APN-functions
M. È. Tuzhilin
|
13–14 |
|
|
The explicit form of information characteristic for partially defined data
L. A. Sholomov
|
15–16 |
|
|
On Quaternary and Binary Bent Functions
P. Solé, N. N. Tokareva
|
16–18 |
|
|
Mathematical Methods of Cryptography, Steganography and Coding
|
|
|
A hybrid approach (SAT+ROBDD) to cryptanalysis of stream encryption systems
A. S. Ignat'ev, A. A. Semenov, D. V. Bespalov, O. S. Zaikin
|
19–20 |
|
|
Generalized invertibility of dynamical systems for encryption problems
A. M. Kovalev, V. A. Kozlovskii, V. F. Shcherbak
|
20–21 |
|
|
Stream and finite automaton ciphersystems
I. V. Pankratov
|
21–24 |
|
|
On 2-transitivity of generalized Feistel ciphers
M. A. Pudovkina
|
24–26 |
|
|
Analysis of perturbed quantization stegosystems
E. V. Razinkov, R. Kh. Latypov
|
26–28 |
|
|
Transitions identification experiments with information-lossless automata
V. N. Trenkaev
|
29–30 |
|
|
Argument of knowledge of a Goppa codeword and of a bounded error
V. E. Fedyukovich
|
30–32 |
|
|
On complexity of formal coding method for analysis of generator with monocycle substitutional transition function
V. M. Fomichev
|
32–34 |
|
|
Protocol verification tools
A. V. Cheremushkin
|
34–36 |
|
|
The generalized automorphisms of Reed-Muller code and McEliece–Sidelnikov public key cryptosystem
I. V. Chizhov
|
36–37 |
|
|
Mathematical Foundations of Computer Security
|
|
|
Analysis of conditions for taking ownership access within the base role DP-model without memory-information flows
P. N. Devyanin
|
38–39 |
|
|
Teaching the models of access and information flows management within discipline “Theoretical foundations of computer security”
P. N. Devyanin
|
39–41 |
|
|
Closure of basic role DP-model
M. A. Kachanov
|
41–44 |
|
|
Approaches to security of computer systems with functionally or parametrically associated entities
D. N. Kolegov
|
44–46 |
|
|
Multivalued logic in the enterprise information management system
M. M. Kucherov, A. A. Kytmanov
|
46–48 |
|
|
Analysis of network safety with Markov's chains
I. N. Kirko, V. P. Kushnir
|
48–50 |
|
|
Implementation of a method for protecting credentials in the multi-tier applications
P. A. Pautov
|
50–51 |
|
|
Mathematical and software tools for programs obfuscation
A. G. Pozdeev, V. N. Krivopalov, E. V. Romashkin, E. D. Radchenko
|
52–53 |
|
|
Software implementation of closure algorithms for the basic DP-model of computer systems with discretionary access control
I. V. Smith
|
54–55 |
|
|
The technology and the instrumental environment for creation of protected information processing systems
D. A. Stefantsov
|
55–56 |
|
|
Digital watermarks resistant to collusion attacks
R. S. Struzhkov, T. M. Solov'ev, R. I. Chernyak
|
56–59 |
|
|
Wireless LAN security analysis in Tomsk
M. I. Tsoi
|
59–60 |
|
|
The method for secure video streaming over distributed networks
E. V. Shcherba
|
60–62 |
|
|
Mathematical Foundations of Reliability of Computing and Control Systems
|
|
|
Test suites derivation for nondeterministic finite state mashines with respect to the separability relation
E. A. Aken'shina, N. V. Shabaldina
|
63–65 |
|
|
Path delay and multiple stuck-at fault test design for circuits derived from irredundant systems with factorized synthesis method
V. V. Andreeva, A. Yu. Matrosova, A. V. Mel'nikov, A. V. Morozova
|
65–66 |
|
|
Representation of an arbitrary number with weight sum of essential subtrees
N. B. Butorina, S. A. Lykhina
|
66–68 |
|
|
Path delay fault classification
A. Yu. Matrosova
|
68–69 |
|
|
Path delay fault test design for circuits obtained by covering ROBDDs with CLBs
E. A. Nikolaeva, A. Yu. Matrosova
|
69–70 |
|
|
Fault tolerant combinational circuit design
S. A. Ostanin
|
71–72 |
|
|
Mathematical Foundations of Informatics and Programming
|
|
|
Analitic approach to context-free languages in the Greibach normal form
O. I. Egorushkin, K. V. Safonov
|
73–74 |
|
|
Software errors search in complex data processing algorithms
A. N. Makarov
|
75–76 |
|
|
Routed service of data transmission
V. I. Nikonov
|
76–78 |
|
|
Approximation of the network traffic by model of alternating process
O. V. Nissenbaum, I. B. Pakhomov
|
78–79 |
|
|
Towards the definition of the software subsystems integration measure
D. A. Stefantsov
|
79–81 |
|
|
Translation of discrete finite automata descriptions from Microsoft Visio format to source code in C language
L. V. Stolyarov, I. R. Dedinskii, A. A. Shalyto
|
81–83 |
|
|
Computational Methods in Discrete Mathematics
|
|
|
Experimental program estimation for the quantity of prime numbers necessary for elimination of polynomial equations without integer roots
Yu. L. Zachesov, N. P. Salikhov
|
84–87 |
|
|
Discrete logarithm problem in subgroups of prime order
I. A. Pankratova
|
87–90 |
|
|
Main problems of linear algebra related with satisfiability problem
R. T. Faizullin
|
90–91 |
|
|
Transformation of CNF via resolution
I. G. Khnykin
|
91–93 |
|
|
Applied Graph Theory
|
|
|
Computational complexity of graph extensions
M. B. Abrosimov
|
94–95 |
|
|
Some properties of graph edge clique coverings
I. A. Badeha, P. V. Roldugin
|
95–96 |
|
|
Graph recognition by moving agent
I. S. Grunskii, E. A. Tatarinov
|
96–98 |
|
|
On exact extensions of tournaments
A. A. Dolgov
|
98 |
|
|
Algorithms for generation of rooted tree on the base of total partition procedure
V. V. Kruchinin
|
99–101 |
|
|
Algorithms for the graph isomorphism problem based on graph deregularisation
I. V. Shirokov, A. V. Prolubnikov
|
101–102 |
|
|
Mathematical Foundations of Intelligent Systems
|
|
|
On some relations between graphic images and sounds
A. M. Grishin
|
103–105 |
|
|
Risk management on quality indicators
V. V. Zolotarev
|
105–107 |
|
|
Correct evaluation of alternatives weight coefficients in the method of analytical hierarchies
S. I. Kolesnikova
|
107–109 |
|
|
Approach to recognition of technical system state on the base of entropy conception and formalism of multisets
S. I. Kolesnikova, V. G. Bukreev
|
109–111 |
|
|
Information protection for law students
M. Ya. Tovstein
|
111–112 |
|
|
Logical-combinatorial multicriteria selection of diagnostic tests optimal subset
A. E. Yankovskaya, A. E. Petelin
|
113–114 |
|
|
Reduction of multicriteria selection of optimal subset tests in intelligent systems
A. E. Yankovskaya
|
114–115 |
Contact us: