|
Author Index, 2004, Volume 16
V. B. Alekseev
On the number closure-type mappings
Diskr. Mat., 2004, Volume 16:2, 85–97
|
N. N. Andreev, A. M. Zubkov, G. I. Ivchenko, V. F. Kolchin, Yu. I. Maksimov, Yu. I. Medvedev, B. A. Pogorelov, Yu. V. Prokhorov, V. N. Sachkov, B. A. Sevast'yanov
Vladimir Yakovlevich Kozlov (on the occasion of his ninetieth birthday)
Diskr. Mat., 2004, Volume 16:2, 3–6
|
T. V. Andreeva
The method of boundary functionals for irregular structures
Diskr. Mat., 2004, Volume 16:1, 121–139
|
T. V. Andreeva
On a generalization of the method of boundary functionals
Diskr. Mat., 2004, Volume 16:3, 85–104
|
A. S. Asratyan, N. N. Kuzyurin
Analysis of the accuracy of randomized rounding for integer linear programming problems
Diskr. Mat., 2004, Volume 16:4, 3–13
|
S. V. Balakin, see L. Ya. Savel'ev
Diskr. Mat., 2004, Volume 16:3, 43–62
|
Yu. N. Baulina
On the number of solutions of the equation $(x_1+\ldots+x_n)^m=ax_1\ldots x_n$ in a finite field
Diskr. Mat., 2004, Volume 16:4, 41–48
|
T. D. Blaivas
Asymptotics of the complexity of interval search on a Boolean cube in the class of balanced trees
Diskr. Mat., 2004, Volume 16:4, 65–78
|
A. V. Chashkin
Modeling circuits consisting of functional elements on a universal Turing machine
Diskr. Mat., 2004, Volume 16:2, 98–103
|
I. A. Cheplyukova
A case of the limit distribution of the number of cyclic vertices in a random mapping
Diskr. Mat., 2004, Volume 16:3, 76–84
|
A. V. Cheremushkin
Repetition-free decomposition of strongly dependent functions
Diskr. Mat., 2004, Volume 16:3, 3–42
|
E. Couselo, see S. González
Diskr. Mat., 2004, Volume 16:1, 146–156
|
V. P. Elizarov
Necessary conditions for solvability of a system of linear equations over a ring
Diskr. Mat., 2004, Volume 16:2, 44–53
|
V. A. Emelichev, V. N. Krichko
A formula for the stability radius of a vector $l_\infty$-extremal trajectory problem
Diskr. Mat., 2004, Volume 16:1, 14–20
|
V. A. Emelichev, K. G. Kuz'min
Stability analysis of a strictly efficient solution of a vector problem of Boolean programming in the metric $l_1$
Diskr. Mat., 2004, Volume 16:4, 14–19
|
A. N. Erokhin, see È. È. Gasanov
Diskr. Mat., 2004, Volume 16:4, 49–64
|
È. È. Gasanov, A. N. Erokhin
A nonexhaustive algorithm, linear with respect to memory, for solving a two-dimensional interval search problem
Diskr. Mat., 2004, Volume 16:4, 49–64
|
S. González, E. Couselo, V. T. Markov, A. A. Nechaev
Group codes and their nonassociative generalizations
Diskr. Mat., 2004, Volume 16:1, 146–156
|
E. V. Gorbatov
The standard basis of a polynomial ideal over a commutative Artinian chain ring
Diskr. Mat., 2004, Volume 16:1, 52–78
|
I. S. Grunskii, A. S. Senchenko
Properties of systems of defining relations for automata
Diskr. Mat., 2004, Volume 16:4, 79–87
|
V. V. Gushan, see K. K. Shchukin
Diskr. Mat., 2004, Volume 16:4, 149–157
|
G. I. Ivchenko, see N. N. Andreev
Diskr. Mat., 2004, Volume 16:2, 3–6
|
G. A. Karpunin
On the McEliece public-key cryptosystem based on Reed-Muller binary codes
Diskr. Mat., 2004, Volume 16:2, 79–84
|
D. N. Karymov
On the accuracy of approximation in the Poisson limit theorem
Diskr. Mat., 2004, Volume 16:2, 148–159
|
V. F. Kolchin, see N. N. Andreev
Diskr. Mat., 2004, Volume 16:2, 3–6
|
V. A. Kolmykov
On the characteristic polynomials of periodic graphs
Diskr. Mat., 2004, Volume 16:3, 153–159
|
O. A. Kozlitin
Polynomial transformations of a GEO-ring of prime characteristic
Diskr. Mat., 2004, Volume 16:3, 105–117
|
A. M. Kozlov
On the probabilities of large deviations of the Shepp statistic
Diskr. Mat., 2004, Volume 16:1, 140–145
|
V. N. Krichko, see V. A. Emelichev
Diskr. Mat., 2004, Volume 16:1, 14–20
|
M. A. Krikun
Boundaries of a random triangulation of a disk
Diskr. Mat., 2004, Volume 16:2, 121–135
|
V. L. Kurakin
Hopf algebras of linear recurring sequences
Diskr. Mat., 2004, Volume 16:2, 7–43
|
K. G. Kuz'min, see V. A. Emelichev
Diskr. Mat., 2004, Volume 16:4, 14–19
|
N. N. Kuzyurin, see A. S. Asratyan
Diskr. Mat., 2004, Volume 16:4, 3–13
|
Z. S. Lozhkina
On optimal exact coverings of a graph in the class of weakly dense bases
Diskr. Mat., 2004, Volume 16:3, 118–140
|
I. V. Lyalin
On the solution of automaton equations
Diskr. Mat., 2004, Volume 16:2, 104–116
|
A. A. Makhnev, I. M. Minakova
On automorphisms of strongly regular graphs with the parameters $\lambda=1$ and $\mu=2$
Diskr. Mat., 2004, Volume 16:1, 95–104
|
Yu. I. Maksimov, see N. N. Andreev
Diskr. Mat., 2004, Volume 16:2, 3–6
|
V. T. Markov, see S. González
Diskr. Mat., 2004, Volume 16:1, 146–156
|
Yu. I. Medvedev, see N. N. Andreev
Diskr. Mat., 2004, Volume 16:2, 3–6
|
D. A. Mikhailov, A. A. Nechaev
Solving systems of polynomial equations over Galois–Eisenstein rings with the use of the canonical generating systems of polynomial ideals
Diskr. Mat., 2004, Volume 16:1, 21–51
|
I. M. Minakova, see A. A. Makhnev
Diskr. Mat., 2004, Volume 16:1, 95–104
|
A. A. Nechaev, see S. González
Diskr. Mat., 2004, Volume 16:1, 146–156
|
A. A. Nechaev, see D. A. Mikhailov
Diskr. Mat., 2004, Volume 16:1, 21–51
|
Sh. R. Nurutdinov
Modeling Markov chains in Galois fields
Diskr. Mat., 2004, Volume 16:2, 136–147
|
Yu. L. Pavlov
Limit theorems for the sizes of trees of an unlabeled graph of a random mapping
Diskr. Mat., 2004, Volume 16:3, 63–75
|
B. A. Pogorelov, see N. N. Andreev
Diskr. Mat., 2004, Volume 16:2, 3–6
|
Yu. V. Prokhorov, see N. N. Andreev
Diskr. Mat., 2004, Volume 16:2, 3–6
|
N. P. Red'kin
On the complexity of Boolean functions with a small number of ones
Diskr. Mat., 2004, Volume 16:4, 20–31
|
A. S. Rybakov
Spectral properties of a linear congruential generator in special cases
Diskr. Mat., 2004, Volume 16:2, 54–78
|
A. S. Rybakov
The shortest vectors of lattices connected with a linear congruent generator
Diskr. Mat., 2004, Volume 16:4, 88–109
|
V. N. Sachkov, see N. N. Andreev
Diskr. Mat., 2004, Volume 16:2, 3–6
|
L. Ja. Savel'ev, S. V. Balakin
Joint distribution of the number of ones and the number of 1-runs in binary Markov sequences
Diskr. Mat., 2004, Volume 16:3, 43–62
|
S. N. Selezneva
On the complexity of polarized polynomials of functions of many-valued logics that depend on one variable
Diskr. Mat., 2004, Volume 16:2, 117–120
|
B. I. Selivanov
A family of multivariate $\chi^2$-statistics
Diskr. Mat., 2004, Volume 16:4, 110–116
|
A. S. Senchenko, see I. S. Grunskii
Diskr. Mat., 2004, Volume 16:4, 79–87
|
B. A. Sevast'yanov
Some classes of random mappings of finite sets, and nonhomogeneous branching processes
Diskr. Mat., 2004, Volume 16:1, 9–13
|
B. A. Sevast'yanov, see N. N. Andreev
Diskr. Mat., 2004, Volume 16:2, 3–6
|
I. G. Shaposhnikov
On some systems of generators of symmetric and alternating groups admitting a simple programmed realization
Diskr. Mat., 2004, Volume 16:1, 114–120
|
I. G. Shaposhnikov
Homomorphic relations of multibase universal algebras
Diskr. Mat., 2004, Volume 16:4, 134–148
|
K. K. Shchukin, V. V. Gushan
Representation of parastrophs of loops and quasigroups
Diskr. Mat., 2004, Volume 16:4, 149–157
|
M. I. Skvortsova, I. V. Stankevich
On a relationship between the eigenvectors of weighted graphs and their subgraphs
Diskr. Mat., 2004, Volume 16:4, 32–40
|
I. V. Stankevich, see M. I. Skvortsova
Diskr. Mat., 2004, Volume 16:4, 32–40
|
A. N. Timashev
Random free trees and forests with constraints on the multiplicities of vertices
Diskr. Mat., 2004, Volume 16:4, 117–133
|
V. P. Voronin
On average and typical values of sums of pairwise distances for subsets of vertices of the $n$-dimensional unit cube
Diskr. Mat., 2004, Volume 16:3, 141–152
|
R. N. Zabaluev
On the complexity of the realization of Zhegalkin polynomials
Diskr. Mat., 2004, Volume 16:1, 79–94
|
E. N. Zalesskaya
On new classes of conjugate injectors of finite groups
Diskr. Mat., 2004, Volume 16:1, 105–113
|
A. M. Zubkov, see N. N. Andreev
Diskr. Mat., 2004, Volume 16:2, 3–6
|
|
|
Contact us: