|
Theoretical Backgrounds of Applied Discrete Mathematics
|
|
On equations in free groups with commutant restrictions on solutions
A. I. Zetkina
|
5–13 |
|
|
Axiomatizability and decidability of universal theories of hereditary classes of models of finite and infinite languages
A. V. Ilev
|
14–29 |
|
|
Periodic multiplicative arithmetic functions
E. V. Kaygorodov
|
30–35 |
|
|
Multiplicative residue semigroups with planar Cayley graphs
O. V. Knyazev, D. V. Solomatin
|
36–44 |
|
|
Orthomorphisms of groups with minimal possible pairwise distances
S. V. Spiridonov
|
45–59 |
|
|
Mathematical Methods of Cryptography
|
|
|
Forcing future public ephemeral keys to attack authenticated key establishment protocols
E. K. Alekseev, S. N. Kyazhin, S. V. Smyshlyaev
|
60–77 |
|
|
Applied Automata Theory
|
|
|
On the properties of a finite-state generator
A. O. Bakharev, R. O. Zapanov, S. E. Zinchenko, I. A. Pankratova, E. S. Prudnikov
|
78–85 |
|
|
Applied Graph Theory
|
|
|
On the existence of directed strongly regular graphs with parameters $(22, 9, 6, 3, 4)$
V. A. Byzov, I. A. Pushkarev
|
86–96 |
|
|
Discovery of infinite families of optimal double-loop networks with a given template of generators
E. A. Monakhova, O. G. Monakhov
|
97–115 |
|
|
Mathematical Backgrounds of Informatics and Programming
|
|
|
On the generic complexity of the discrete logarithm problem in Lucas sequences
A. N. Rybalov
|
116–122 |
Contact us: