|
Author Index, 1999, Volume 11
V. I. Afanasyev
On the maximum of a critical branching process in a random environment
Diskr. Mat., 1999, Volume 11:2, 86–102
|
V. I. Afanasyev
On the time of reaching a fixed level by a critical branching process in a random environment
Diskr. Mat., 1999, Volume 11:4, 33–47
|
V. B. Alekseev, V. Ya. Kozlov, V. F. Kolchin, V. B. Kudryavtsev, O. B. Lupanov, È. A. Primenko
Sergei Vsevolodovich Yablonskii (1924–1998)
Diskr. Mat., 1999, Volume 11:1, 151–157
|
A. N. Alekseichuk
Conditions for the uniqueness of the moment problem in the class of $q$-distributions
Diskr. Mat., 1999, Volume 11:4, 48–57
|
S. V. Aleshin
On a consequence of the Krohn–Rhodes theorem
Diskr. Mat., 1999, Volume 11:4, 101–109
|
S. M. Buravlev
Matchings up to permutations in a sequence of independent trials
Diskr. Mat., 1999, Volume 11:1, 53–75
|
A. V. Chashkin
On the realization of linear Boolean operators by nonbranching programs with a conditional stop
Diskr. Mat., 1999, Volume 11:1, 146–150
|
A. V. Chashkin
On the complexity of narrow systems of Boolean functions
Diskr. Mat., 1999, Volume 11:3, 149–159
|
I. A. Cheplyukova, see Yu. L. Pavlov
Diskr. Mat., 1999, Volume 11:1, 97–112
|
A. A. Chernyak, Zh. A. Chernyak
Reliability of binary systems
Diskr. Mat., 1999, Volume 11:1, 129–139
|
A. A. Chernyak
Structure-complex systems with threshold survival
Diskr. Mat., 1999, Volume 11:4, 65–78
|
Zh. A. Chernyak, see A. A. Chernyak
Diskr. Mat., 1999, Volume 11:1, 129–139
|
D. Yu. Cherukhin
On pre-bad Boolean bases
Diskr. Mat., 1999, Volume 11:2, 118–160
|
V. P. Chistyakov, see M. I. Tikhomirova
Diskr. Mat., 1999, Volume 11:3, 83–90
|
V. P. Chistyakov, see B. I. Selivanov
Diskr. Mat., 1999, Volume 11:4, 145–151
|
A. N. Degtev, D. I. Ivanov
Weakly implicative selector sets of dimension 3
Diskr. Mat., 1999, Volume 11:3, 126–132
|
E. E. D'yakonova
The asymptotics of the probability of nonextinction of a multidimensional branching process in a random environment
Diskr. Mat., 1999, Volume 11:1, 113–128
|
D. E. Efimov
An estimate for the exponent of some sets of nonnegative matrices
Diskr. Mat., 1999, Volume 11:4, 79–88
|
V. A. Emelichev, A. V. Pashkevich, O. A. Yanushkevich
Conditions for the efficiency of a solution of a vector discrete optimization problem
Diskr. Mat., 1999, Volume 11:1, 140–145
|
V. A. Emelichev, V. N. Krichko
On the stability of the Pareto optimum of a vector Boolean programming problem
Diskr. Mat., 1999, Volume 11:4, 27–32
|
E. R. Erokhina, see È. È. Gasanov
Diskr. Mat., 1999, Volume 11:3, 63–82
|
È. È. Gasanov, E. R. Erokhina
Modeling and search complexity in multiprocessor systems
Diskr. Mat., 1999, Volume 11:3, 63–82
|
È. È. Gasanov, Yu. P. Lugovskaya
A constant, in the worst case, algorithm for the search for identical objects
Diskr. Mat., 1999, Volume 11:4, 139–144
|
M. M. Glukhov
Injective mappings of words that do not propagate distortions of letter omission type
Diskr. Mat., 1999, Volume 11:2, 20–39
|
Yu. N. Gorchinskii
On $\overline{\pi}$-homomorphisms of finite algebras with a scheme of operators
Diskr. Mat., 1999, Volume 11:2, 3–19
|
A. A. Grusho
On the existence of hidden channels
Diskr. Mat., 1999, Volume 11:1, 24–28
|
V. G. Il'ichev, O. A. Il'icheva
Sign-invariant structures of matrices, and discrete models
Diskr. Mat., 1999, Volume 11:4, 89–100
|
O. A. Il'icheva, see V. G. Ilichev
Diskr. Mat., 1999, Volume 11:4, 89–100
|
D. I. Ivanov, see A. N. Degtev
Diskr. Mat., 1999, Volume 11:3, 126–132
|
V. A. Ivanov
On the random coding method
Diskr. Mat., 1999, Volume 11:3, 99–108
|
V. Jovović, G. Kilibarda
On the number of Boolean functions in the Post classes $F_8^\mu$
Diskr. Mat., 1999, Volume 11:4, 127–138
|
G. D. Kilibarda, see V. Jovović
Diskr. Mat., 1999, Volume 11:4, 127–138
|
V. F. Kolchin, see V. B. Alekseev
Diskr. Mat., 1999, Volume 11:1, 151–157
|
V. F. Kolchin
Branching processes and random hypertrees
Diskr. Mat., 1999, Volume 11:1, 8–23
|
V. F. Kolchin
Threshold property for systems of equations in finite fields
Diskr. Mat., 1999, Volume 11:3, 15–23
|
V. Ya. Kozlov, see V. B. Alekseev
Diskr. Mat., 1999, Volume 11:1, 151–157
|
A. P. Krachkovskii, see M. A. Kravtsov
Diskr. Mat., 1999, Volume 11:3, 109–125
|
M. A. Kravtsov, A. P. Krachkovskii
On some properties of three-index transportation polytopes
Diskr. Mat., 1999, Volume 11:3, 109–125
|
V. N. Krichko, see V. A. Emelichev
Diskr. Mat., 1999, Volume 11:4, 27–32
|
V. B. Kudryavtsev, see V. B. Alekseev
Diskr. Mat., 1999, Volume 11:1, 151–157
|
V. L. Kurakin
Polynomial transformations of linear recurrent sequences over the ring $\mathbf Z_{p^2}$
Diskr. Mat., 1999, Volume 11:2, 40–65
|
D. A. Kuropatkin
Probabilities of events related to common predecessors of two vertices in a generalized model of recursive trees
Diskr. Mat., 1999, Volume 11:4, 58–64
|
O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko
On properties of Weil sums over finite fields and finite abelian groups
Diskr. Mat., 1999, Volume 11:2, 66–85
|
Yu. P. Lugovskaya, see È. È. Gasanov
Diskr. Mat., 1999, Volume 11:4, 139–144
|
O. B. Lupanov, see V. B. Alekseev
Diskr. Mat., 1999, Volume 11:1, 151–157
|
E. P. Machikina, B. Ya. Ryabko
A fast method for transforming continued fractions into ordinary fractions
Diskr. Mat., 1999, Volume 11:4, 152–156
|
G. S. Makanin, T. A. Makanina
Parametrization of solutions of some equations of squares in a free monoid
Diskr. Mat., 1999, Volume 11:3, 133–148
|
T. A. Makanina, see G. S. Makanin
Diskr. Mat., 1999, Volume 11:3, 133–148
|
S. S. Marchenkov
On the expressibility of functions of many-valued logic in some logical-functional classes
Diskr. Mat., 1999, Volume 11:4, 110–126
|
A. B. Mukhin
Estimates for the local probabilities of convolutions of discrete distributions
Diskr. Mat., 1999, Volume 11:2, 103–111
|
L. R. Mutafchiev
A limit theorem on the shape of Ferrers graphs
Diskr. Mat., 1999, Volume 11:1, 76–96
|
L. R. Mutafchiev
Letter to the editors
Diskr. Mat., 1999, Volume 11:4, 157
|
A. V. Pashkevich, see V. A. Emelichev
Diskr. Mat., 1999, Volume 11:1, 140–145
|
Yu. L. Pavlov, I. A. Cheplyukova
Limit distributions of the number of vertices in strata of a simply generated forest
Diskr. Mat., 1999, Volume 11:1, 97–112
|
È. A. Primenko, see V. B. Alekseev
Diskr. Mat., 1999, Volume 11:1, 151–157
|
B. Ya. Ryabko, see E. P. Machikina
Diskr. Mat., 1999, Volume 11:4, 152–156
|
A. A. Sal'nikov, see O. A. Logachev
Diskr. Mat., 1999, Volume 11:2, 66–85
|
S. V. Savchenko
On the spectra of connected graphs
Diskr. Mat., 1999, Volume 11:3, 29–47
|
L. Ja. Savel'ev
The maximum run length in generalized Bernoulli sequences
Diskr. Mat., 1999, Volume 11:1, 29–52
|
L. Ja. Savel'ev
Random correspondences, binary matrices, and series
Diskr. Mat., 1999, Volume 11:4, 3–26
|
B. I. Selivanov, V. P. Chistyakov
Two remarks on the multidimensional $\chi^2$ statistic
Diskr. Mat., 1999, Volume 11:4, 145–151
|
I. A. Semaev
On the reduction of the calculation of discrete logarithms on an elliptic curve to the calculation of discrete logarithms in a finite field
Diskr. Mat., 1999, Volume 11:3, 24–28
|
B. A. Sevast'yanov
The probability distribution of the height of the genealogical tree of a multitype Galton–Watson branching process
Diskr. Mat., 1999, Volume 11:1, 3–7
|
I. G. Shaposhnikov
Congruences of finite multibase universal algebras
Diskr. Mat., 1999, Volume 11:3, 48–62
|
S. A. Stepanov
Polynomial invariants of finite groups over fields of prime characteristic
Diskr. Mat., 1999, Volume 11:3, 3–14
|
M. I. Tikhomirova, V. P. Chistyakov
Some characteristics of two-stage designs of experiments
Diskr. Mat., 1999, Volume 11:3, 83–90
|
A. N. Timashev
The law of large numbers for permanents of random stochastic matrices
Diskr. Mat., 1999, Volume 11:3, 91–98
|
I. I. Trub
A recurrent algorithm for solving a combinatorial problem on arrangements with restrictions
Diskr. Mat., 1999, Volume 11:2, 112–117
|
O. A. Yanushkevich, see V. A. Emelichev
Diskr. Mat., 1999, Volume 11:1, 140–145
|
V. V. Yashchenko, see O. A. Logachev
Diskr. Mat., 1999, Volume 11:2, 66–85
|
|
|
Contact us: