|
Author Index, 2007, Volume 19
A. V. Akishin
Incompatible transformations of principal ideal rings
Diskr. Mat., 2007, Volume 19:1, 50–59
|
E. A. Aksenova, A. V. Sokolov
Optimal management of two parallel stacks in two-level memory
Diskr. Mat., 2007, Volume 19:1, 67–75
|
V. E. Alekseev
An upper bound for the number of maximal independent sets in a graph
Diskr. Mat., 2007, Volume 19:3, 84–88
|
A. N. Alekseichuk
Non-asymptotic bounds for probabilities of the rank of a random matrix over a finite field
Diskr. Mat., 2007, Volume 19:2, 85–93
|
V. D. Anosov
On homomorphisms of many-sorted algebraic systems in connection with cryptographic applications
Diskr. Mat., 2007, Volume 19:2, 27–44
|
V. V. Baev
An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial
Diskr. Mat., 2007, Volume 19:4, 132–138
|
A. A. Balagura, O. V. Kuz'min
Generalised Pascal pyramids and their reciprocals
Diskr. Mat., 2007, Volume 19:4, 108–116
|
T. M. Barbolina, see O. O. Iemets
Diskr. Mat., 2007, Volume 19:1, 95–104
|
R. V. Bogonatov
Representations over Galois ring of a linear recurring sequence of maximal period over Galois field
Diskr. Mat., 2007, Volume 19:1, 141–157
|
N. S. Bol'shakova, see E. E. Marenich
Diskr. Mat., 2007, Volume 19:4, 97–107
|
S. M. Buravlev, M. M. Glukhov, V. S. Gorbachev, A. M. Zubkov, V. Ya. Kozlov, S. N. Kozlov, V. F. Kolchin, A. I. Markov, Yu. I. Medvedev, Yu. V. Prokhorov, V. N. Sachkov, B. A. Sevast'yanov
N. N. Andreev, 31.01.1929–25.12.2006
Diskr. Mat., 2007, Volume 19:1, 3–5
|
A. B. Dainiak
On the number of independent sets in graphs with fixed independence number
Diskr. Mat., 2007, Volume 19:2, 63–66
|
V. M. Demidenko
Quadratic assignment problems with additively monotone matrices and incomplete anti-Monge matrices: conditions for effective solvability
Diskr. Mat., 2007, Volume 19:1, 105–132
|
E. E. D'yakonova
Critical multitype branching processes in a random environment
Diskr. Mat., 2007, Volume 19:4, 23–41
|
V. P. Elizarov
Implications of a system of linear equations over a module
Diskr. Mat., 2007, Volume 19:1, 133–140
|
V. A. Emelichev, see E. Gurevsky
Diskr. Mat., 2007, Volume 19:2, 45–50
|
V. A. Emelichev, K. G. Kuz'min
A general approach to studying the stability of a Pareto optimal solution of a vector integer linear programming problem
Diskr. Mat., 2007, Volume 19:3, 79–83
|
Sh. K. Formanov
On the Stein–Tikhomirov method and its applications in nonclassical limit theorems
Diskr. Mat., 2007, Volume 19:1, 27–39
|
Yu. G. Geras'kina
One automaton model in biology
Diskr. Mat., 2007, Volume 19:3, 122–139
|
R. R. Gil'manshin, A. M. Zubkov, N. A. Kolokol'nikova
Bounds for extremal values of the mean number of cells containing a given number of particles
Diskr. Mat., 2007, Volume 19:1, 11–16
|
M. M. Glukhov, see S. M. Buravlev
Diskr. Mat., 2007, Volume 19:1, 3–5
|
V. S. Gorbachev, see S. M. Buravlev
Diskr. Mat., 2007, Volume 19:1, 3–5
|
E. Gurevsky, V. A. Emelichev
On stability of an efficient solution of a vector Boolean problem of maximisation of absolute values of linear functions
Diskr. Mat., 2007, Volume 19:2, 45–50
|
O. A. Emets, T. N. Barbolina
Classes of lexicographic equivalence in Euclidean combinatorial optimisation on arrangements
Diskr. Mat., 2007, Volume 19:1, 95–104
|
N. Josephy, L. Kimball, V. R. Steblovskaya, A. V. Nagaev, M. Pasnievskii
An algorithmic approach to non-self-financing hedging in a discrete-time incomplete market
Diskr. Mat., 2007, Volume 19:3, 140–159
|
Yu. S. Kharin, A. I. Petlitskii
A Markov chain of order $s$ with $r$ partial connections and statistical inference on its parameters
Diskr. Mat., 2007, Volume 19:2, 109–130
|
E. V. Khvorostyanskaya
On conditions for emergence of a giant tree in a random unlabelled forest
Diskr. Mat., 2007, Volume 19:3, 35–50
|
L. Kimball, see N. Josephy
Diskr. Mat., 2007, Volume 19:3, 140–159
|
K. K. Klyuchnikov
The completion time of a program in the case of random failures
Diskr. Mat., 2007, Volume 19:4, 150–157
|
A. V. Kolchin, V. F. Kolchin
On the transition of distributions of sums of random variables related to the generalised allocation scheme from one lattice to another
Diskr. Mat., 2007, Volume 19:3, 15–21
|
V. F. Kolchin, see S. M. Buravlev
Diskr. Mat., 2007, Volume 19:1, 3–5
|
V. F. Kolchin, see A. V. Kolchin
Diskr. Mat., 2007, Volume 19:3, 15–21
|
N. A. Kolokol'nikova, see R. R. Gil'manshin
Diskr. Mat., 2007, Volume 19:1, 11–16
|
V. A. Kopyttsev
A multivariate Poisson theorem for the number of solutions close to given vectors of a system of random linear equations
Diskr. Mat., 2007, Volume 19:4, 3–22
|
O. A. Kozlitin
Periodic properties of a simplest 2-linear shift register
Diskr. Mat., 2007, Volume 19:3, 51–78
|
O. A. Kozlitin
Properties of the output sequence of a simplest 2-linear shift register over $\mathbf Z_{2^n}$
Diskr. Mat., 2007, Volume 19:4, 70–96
|
S. N. Kozlov, see S. M. Buravlev
Diskr. Mat., 2007, Volume 19:1, 3–5
|
V. Ya. Kozlov, see S. M. Buravlev
Diskr. Mat., 2007, Volume 19:1, 3–5
|
I. A. Kruglov
Shifted products of independent random variables with values in finite groups
Diskr. Mat., 2007, Volume 19:1, 40–49
|
I. V. Kucherenko
On the structure of the set of reversible cellular automata
Diskr. Mat., 2007, Volume 19:3, 102–121
|
K. G. Kuz'min, see V. A. Emelichev
Diskr. Mat., 2007, Volume 19:3, 79–83
|
O. V. Kuz'min, see A. A. Balagura
Diskr. Mat., 2007, Volume 19:4, 108–116
|
E. E. Marenich, N. S. Bol'shakova
On the intersection number of a graph
Diskr. Mat., 2007, Volume 19:4, 97–107
|
A. I. Markov, see S. M. Buravlev
Diskr. Mat., 2007, Volume 19:1, 3–5
|
Yu. I. Medvedev, see S. M. Buravlev
Diskr. Mat., 2007, Volume 19:1, 3–5
|
V. G. Mikhailov
Limit theorems for the number of solutions of a system of random linear equations belonging to a given set
Diskr. Mat., 2007, Volume 19:1, 17–26
|
D. M. Motin
On identical transformations in commutative semigroups
Diskr. Mat., 2007, Volume 19:4, 139–149
|
A. V. Nagaev, see N. Josephy
Diskr. Mat., 2007, Volume 19:3, 140–159
|
M. L. Nikolaev, G. Yu. Sofronov
A multiple optimal stopping rule for sums of independent random variables
Diskr. Mat., 2007, Volume 19:4, 42–51
|
V. I. Panteleev, N. A. Peryazev
On representation of $k$-valued logic functions by a sum of products of subfunctions
Diskr. Mat., 2007, Volume 19:2, 94–100
|
M. Pasnievskii, see N. Josephy
Diskr. Mat., 2007, Volume 19:3, 140–159
|
Yu. L. Pavlov
The limit distribution of the size of a giant component in an Internet-type random graph
Diskr. Mat., 2007, Volume 19:3, 22–34
|
N. A. Peryazev, see V. I. Panteleev
Diskr. Mat., 2007, Volume 19:2, 94–100
|
A. I. Petlitskii, see Yu. S. Kharin
Diskr. Mat., 2007, Volume 19:2, 109–130
|
T. G. Petrosyan
An upper bound for the number of product-free sets in a class of groups
Diskr. Mat., 2007, Volume 19:1, 76–88
|
Sh. Pirzada
Mark sequences in multigraphs
Diskr. Mat., 2007, Volume 19:1, 89–94
|
I. A. Popovyan
Optimal logarithmic functions for lifting of a solution of an exponential congruence
Diskr. Mat., 2007, Volume 19:2, 51–62
|
Yu. V. Prokhorov, see S. M. Buravlev
Diskr. Mat., 2007, Volume 19:1, 3–5
|
V. N. Sachkov, see S. M. Buravlev
Diskr. Mat., 2007, Volume 19:1, 3–5
|
V. N. Sachkov
Asymptotic formulas and limit distributions for combinatorial configurations generated by polynomials
Diskr. Mat., 2007, Volume 19:3, 3–14
|
G. V. Savicheva, see V. A. Vedernikov
Diskr. Mat., 2007, Volume 19:2, 78–84
|
I. S. Sergeev
On constructing circuits for transforming the polynomial and normal bases of finite fields from one to the other
Diskr. Mat., 2007, Volume 19:3, 89–101
|
B. A. Sevast'yanov, see S. M. Buravlev
Diskr. Mat., 2007, Volume 19:1, 3–5
|
B. A. Sevast'yanov
A class of subcritical branching processes with immigration and infinite number of types of particles
Diskr. Mat., 2007, Volume 19:1, 6–10
|
A. V. Shapovalov
The cycle structure of a random nonhomogeneous hypergraph on the subcritical stage of evolution
Diskr. Mat., 2007, Volume 19:4, 52–69
|
A. M. Shoitov
The compound Poisson distribution of the number of matches of values of a discrete function of $s$-tuples in segments of a sequence of random variables
Diskr. Mat., 2007, Volume 19:2, 6–26
|
G. Yu. Sofronov, see M. L. Nikolaev
Diskr. Mat., 2007, Volume 19:4, 42–51
|
A. V. Sokolov, see E. A. Aksenova
Diskr. Mat., 2007, Volume 19:1, 67–75
|
V. R. Steblovskaya, see N. Josephy
Diskr. Mat., 2007, Volume 19:3, 140–159
|
S. P. Strunkov
On sequences in periodic groups
Diskr. Mat., 2007, Volume 19:2, 74–77
|
A. Kh. Tabarov
Homomorphisms and endomorphisms of linear and alinear quasigroups
Diskr. Mat., 2007, Volume 19:2, 67–73
|
P. A. Ushakov
On a method to set up a covert channel and estimation of its tolerance for interference
Diskr. Mat., 2007, Volume 19:1, 60–66
|
V. A. Vedernikov, G. V. Savicheva
On finite groups close to completely factorisable groups
Diskr. Mat., 2007, Volume 19:2, 78–84
|
N. Yu. Volkov
On an automaton model of pursuit
Diskr. Mat., 2007, Volume 19:2, 131–160
|
F. Yu. Vorob'ev
A lower bound for the 4-satisfiability threshold
Diskr. Mat., 2007, Volume 19:2, 101–108
|
S. N. Zhuk
On-line algorithms for packing rectangles into several strips
Diskr. Mat., 2007, Volume 19:4, 117–131
|
A. M. Zubkov, see R. R. Gil'manshin
Diskr. Mat., 2007, Volume 19:1, 11–16
|
A. M. Zubkov, see S. M. Buravlev
Diskr. Mat., 2007, Volume 19:1, 3–5
|
|
|
Contact us: