|
Author Index, 2009, Volume 21
A. V. Tarasov, see S. P. Gorshkov
Diskr. Mat., 2009, Volume 21:2, 94–101
|
E. B. Yarovaya
Critical branching random walks on low-dimensional lattices
Diskr. Mat., 2009, Volume 21:1, 117–138
|
F. M. Ablayev, A. V. Vasilyev
On quantum realisation of Boolean functions by the fingerprinting technique
Diskr. Mat., 2009, Volume 21:4, 3–19
|
M. A. Alekhina
On reliability of circuits over the bases $\{\sim,\&,\oplus\}$, $\{\sim,\&,0\}$, $\{\oplus,\&,1\}$, $\{\oplus,\vee,1\}$ in the case of faults of type 0 at the outputs of elements
Diskr. Mat., 2009, Volume 21:2, 102–111
|
A. V. Babash
Periods of output sequences of an automaton for a given periodic input sequence
Diskr. Mat., 2009, Volume 21:4, 39–59
|
G. B. Belyavskaya, A. Kh. Tabarov
Identities with permutations leading to linearity of quasigroups
Diskr. Mat., 2009, Volume 21:1, 36–51
|
V. P. Chistyakov, see M. I. Tikhomirova
Diskr. Mat., 2009, Volume 21:3, 24–32
|
I. V. Chizhov
The key space of the McEliece–Sidelnikov cryptosystem
Diskr. Mat., 2009, Volume 21:3, 132–159
|
A. B. Elovikov
The factorisation of one-generated partially foliated formations
Diskr. Mat., 2009, Volume 21:3, 99–118
|
V. A. Emelichev, O. V. Karelkina
Finite cooperative games: parametrisation of the concept of equilibrium (from Pareto to Nash) and stability of the efficient situation in the Hölder metric
Diskr. Mat., 2009, Volume 21:2, 43–50
|
V. A. Emelichev, see E. E. Gurevskii
Diskr. Mat., 2009, Volume 21:3, 3–13
|
S. P. Gorshkov, A. V. Tarasov
Maximal groups of invariant transformations of multiaffine, bijunctive, weakly positive, and weakly negative Boolean functions
Diskr. Mat., 2009, Volume 21:2, 94–101
|
N. V. Gravin
Nondegenerate colourings in the Brooks theorem
Diskr. Mat., 2009, Volume 21:4, 105–128
|
I. S. Grunskii, see V. B. Kudryavtsev
Diskr. Mat., 2009, Volume 21:1, 3–35
|
I. S. Grunskii, see V. B. Kudryavtsev
Diskr. Mat., 2009, Volume 21:2, 3–42
|
E. E. Gurevskii, V. A. Emelichev
On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
Diskr. Mat., 2009, Volume 21:3, 3–13
|
V. P. Ilyev
Problems on independence systems solvable by the greedy algorithm
Diskr. Mat., 2009, Volume 21:4, 85–94
|
O. V. Karelkina, see V. A. Emelichev
Diskr. Mat., 2009, Volume 21:2, 43–50
|
A. V. Kartashova
On finite lattices of topologies of commutative unary algebras
Diskr. Mat., 2009, Volume 21:3, 119–131
|
V. A. Kozlovskii, see V. B. Kudryavtsev
Diskr. Mat., 2009, Volume 21:1, 3–35
|
V. A. Kozlovskii, see V. B. Kudryavtsev
Diskr. Mat., 2009, Volume 21:2, 3–42
|
V. S. Krotkin, O. V. Kuzmin
On a constructive approach to the calculation of cardinality of the Ryser classes
Diskr. Mat., 2009, Volume 21:3, 33–36
|
I. A. Kruglov
On layers in the system of generators of the subdirect product of subgroups of a finite group
Diskr. Mat., 2009, Volume 21:1, 52–65
|
V. B. Kudryavtsev, I. S. Grunskii, V. A. Kozlovskii
Analysis of behaviour of automata
Diskr. Mat., 2009, Volume 21:1, 3–35
|
V. B. Kudryavtsev, I. S. Grunskii, V. A. Kozlovskii
Reconstruction of automata by fragments of behaviour
Diskr. Mat., 2009, Volume 21:2, 3–42
|
A. S. Kulikov, K. Kutskov
New upper bounds for the problem of maximal satisfiability
Diskr. Mat., 2009, Volume 21:1, 139–157
|
K. Kutskov, see A. S. Kulikov
Diskr. Mat., 2009, Volume 21:1, 139–157
|
O. V. Kuz'min, see V. S. Krotkin
Diskr. Mat., 2009, Volume 21:3, 33–36
|
A. S. Kuzmina
Description of finite nonnilpotent rings with planar zero-divisor graphs
Diskr. Mat., 2009, Volume 21:4, 60–75
|
V. B. Larionov
On distribution of some classes of monotone $k$-valued functions on the lattice of closed classes
Diskr. Mat., 2009, Volume 21:1, 66–77
|
O. A. Logachev, S. V. Smyshlyaev, V. V. Yashchenko
New methods of investigation of perfectly balanced Boolean functions
Diskr. Mat., 2009, Volume 21:2, 51–74
|
A. M. Magomedov
On the edge colouring of bipartite graphs
Diskr. Mat., 2009, Volume 21:2, 153–158
|
A. M. Magomedov
Defragmentation of permutation tables with four columns
Diskr. Mat., 2009, Volume 21:4, 95–104
|
A. N. Maksimenko
The diameter of the ridge-graph of a cyclic polytope
Diskr. Mat., 2009, Volume 21:2, 146–152
|
D. S. Malyshev
On the number of boundary classes in the 3-colouring problem
Diskr. Mat., 2009, Volume 21:4, 129–134
|
S. S. Marchenkov
Positively closed classes of three-valued logic generated by one-place functions
Diskr. Mat., 2009, Volume 21:3, 37–44
|
V. D. Matveenko
Optimal paths in oriented graphs and eigenvectors in $\max$-$\oplus$ systems
Diskr. Mat., 2009, Volume 21:3, 79–98
|
N. M. Mezhennaya
Limit theorems for the number of dense series in a random sequence
Diskr. Mat., 2009, Volume 21:1, 105–116
|
D. V. Paduchikh
On the automorphisms of the strongly regular graph with parameters $(85, 14, 3, 2)$
Diskr. Mat., 2009, Volume 21:1, 78–104
|
Yu. L. Pavlov
On the limit distributions of the vertex degrees of conditional Internet graphs
Diskr. Mat., 2009, Volume 21:3, 14–23
|
V. P. Platonov, S. P. Strunkov
On some equations related to the $tpp$-groups
Diskr. Mat., 2009, Volume 21:4, 82–84
|
M. A. Podkolzina
On completeness and $A$-completeness of $S$-sets of determinate functions containing all one-place determinate $S$-functions
Diskr. Mat., 2009, Volume 21:2, 75–87
|
K. I. Ponomarev
On one statistical model of steganography
Diskr. Mat., 2009, Volume 21:2, 138–145
|
K. I. Ponomarev
A parametric model of embedding and its statistical analysis
Diskr. Mat., 2009, Volume 21:4, 148–157
|
A. M. Romanov
On combinatorial Gray codes with distance 3
Diskr. Mat., 2009, Volume 21:3, 73–78
|
S. N. Selezneva
On the complexity of representation of $k$-valued functions by generalised polarised polynomials
Diskr. Mat., 2009, Volume 21:4, 20–29
|
B. I. Selivanov
On a class of statistics of polynomial samples
Diskr. Mat., 2009, Volume 21:2, 126–137
|
I. K. Sharankhaev
On repetition-free Boolean functions over pre-elementary monotone bases
Diskr. Mat., 2009, Volume 21:2, 88–93
|
S. V. Smyshlyaev, see O. A. Logachev
Diskr. Mat., 2009, Volume 21:2, 51–74
|
S. P. Strunkov, see V. P. Platonov
Diskr. Mat., 2009, Volume 21:4, 82–84
|
A. Kh. Tabarov, see G. B. Belyavskaya
Diskr. Mat., 2009, Volume 21:1, 36–51
|
M. I. Tikhomirova
Asymptotic normality of the number of absent noncontinuous chains of outcomes of independent trials
Diskr. Mat., 2009, Volume 21:2, 112–125
|
M. I. Tikhomirova, V. P. Chistyakov
On the estimation of the periods of noisy binary periodic sequences
Diskr. Mat., 2009, Volume 21:3, 24–32
|
A. A. Tuganbaev
Rings over which all finitely generated modules are $\aleph_0$-injective
Diskr. Mat., 2009, Volume 21:4, 76–81
|
A. V. Vasiliev, see F. M. Ablayev
Diskr. Mat., 2009, Volume 21:4, 3–19
|
V. V. Yashchenko, see O. A. Logachev
Diskr. Mat., 2009, Volume 21:2, 51–74
|
O. V. Zubkov
Finding and estimating the number of repetition-free Boolean functions over the elementary basis in the form of a convergent series
Diskr. Mat., 2009, Volume 21:4, 30–38
|
A. Yu. Zubov
On the game-theoretical approach to the analysis of authentication codes
Diskr. Mat., 2009, Volume 21:3, 45–72
|
A. Yu. Zubov
On the choice of the defence strategy for an authentication code with two-state source
Diskr. Mat., 2009, Volume 21:4, 135–147
|
|
|
Contact us: