|
Author Index, 1994, Volume 6
V. B. Alekseev, L. L. Voronenko
On some closed classes in partial two-valued logic
Diskr. Mat., 1994, Volume 6:4, 58–79
|
A. S. Ambrosimov
Properties of bent functions of $q$-valued logic over finite fields
Diskr. Mat., 1994, Volume 6:3, 50–60
|
A. E. Andreev, I. A. Vikhlyantsev
Estimates for the length of a code for schemes consisting of functional elements
Diskr. Mat., 1994, Volume 6:4, 10–20
|
G. V. Balakin
On the possibility of solving systems of linear integer equations by the method of isolation and estimation of separate unknowns
Diskr. Mat., 1994, Volume 6:1, 116–126
|
D. D. Botvich, A. A. Zamyatin
Ergodicity of a conservative communications network
Diskr. Mat., 1994, Volume 6:3, 122–135
|
A. V. Chashkin
On the complexity of Boolean matrices, graphs and their corresponding Boolean functions
Diskr. Mat., 1994, Volume 6:2, 43–73
|
A. N. Datsenko-Chigorin, see B. V. Gladkov
Diskr. Mat., 1994, Volume 6:1, 127–136
|
M. Drmota
Distribution of the height of leaves of rooted trees
Diskr. Mat., 1994, Volume 6:1, 67–82
|
V. A. Emelichev, V. A. Perepelitsa
Complexity of discrete multicriterial problems
Diskr. Mat., 1994, Volume 6:1, 3–33
|
T. G. Gazaryan
Properties of matrices over a commutative ring that are associated with the similarity relation
Diskr. Mat., 1994, Volume 6:3, 143–153
|
B. V. Gladkov, A. N. Datsenko-Chigorin
On some transformations of random sequences
Diskr. Mat., 1994, Volume 6:1, 127–136
|
M. M. Glukhov
Lower bounds for the sums of the characters of polynomials over finite fields
Diskr. Mat., 1994, Volume 6:3, 136–142
|
M. M. Glukhov, Kh. S. Rasulov
Special $C$-equivalences of finite one-sided invertible quasigroups
Diskr. Mat., 1994, Volume 6:3, 3–17
|
V. A. Ivanov
Testing of statistical hypotheses based on a randomly transformed realization
Diskr. Mat., 1994, Volume 6:2, 150–158
|
G. I. Ivchenko, Yu. I. Medvedev
Investigation of the process of filling cells in an allocation scheme with reflection
Diskr. Mat., 1994, Volume 6:1, 40–52
|
G. I. Ivchenko
On the random covering of a circle: a discrete model
Diskr. Mat., 1994, Volume 6:3, 94–109
|
G. Kilibarda
On the minimal universal collectives of automata for plane labyrinths
Diskr. Mat., 1994, Volume 6:4, 133–153
|
V. V. Kochergin
On the computation of sets of powers
Diskr. Mat., 1994, Volume 6:2, 129–137
|
S. L. Kolbin
Some properties of mutually inverse systems of functions of $p$-valued logic
Diskr. Mat., 1994, Volume 6:2, 145–149
|
A. V. Kolchin
Equations that contain an unknown permutation
Diskr. Mat., 1994, Volume 6:1, 100–115
|
V. F. Kolchin
A classification problem with errors in the measurements
Diskr. Mat., 1994, Volume 6:1, 53–66
|
R. M. Kolpakov
Generation of rational numbers by probabilistic switching $\pi$-nets
Diskr. Mat., 1994, Volume 6:3, 18–38
|
A. V. Kolushov, V. A. Yudin
On the Korkin–Zolotarev construction
Diskr. Mat., 1994, Volume 6:1, 155–157
|
O. M. Kopytova
Indistinguishability of finite automata by multiple experiments in a stationary observation environment
Diskr. Mat., 1994, Volume 6:2, 120–128
|
V. L. Kurakin
The first coordinate sequence of a linear recurrence of maximum period over a Galois ring
Diskr. Mat., 1994, Volume 6:2, 88–100
|
O. V. Kuz'min
Recurrence relations and enumeration interpretations of some combinatorial numbers and polynomials
Diskr. Mat., 1994, Volume 6:3, 39–49
|
N. N. Kuzyurin
Metric aspects of the theory of integer linear programming
Diskr. Mat., 1994, Volume 6:4, 87–106
|
D. D. Lozovanu, V. A. Trubin
The problem of the minimax path in a network and an algorithm for its solution
Diskr. Mat., 1994, Volume 6:2, 138–144
|
S. S. Marchenkov
Precomplete classes in the Cartesian products of $P_2$ and $P_3$
Diskr. Mat., 1994, Volume 6:2, 21–42
|
Yu. I. Medvedev, see G. I. Ivchenko
Diskr. Mat., 1994, Volume 6:1, 40–52
|
V. G. Mikhailov
Review of a book, A. D. Barbour, L. Holst, and S. Janson “Poisson Approximation”
Diskr. Mat., 1994, Volume 6:3, 154–159
|
Sh. A. Mirakhmedov
Limit theorems for conditional distributions
Diskr. Mat., 1994, Volume 6:4, 107–132
|
V. G. Nikonov
Coverings of Boolean graphs
Diskr. Mat., 1994, Volume 6:4, 21–34
|
Yu. L. Pavlov
Limit distributions of the height of a random forest consisting of plane rooted trees
Diskr. Mat., 1994, Volume 6:1, 137–154
|
V. A. Perepelitsa, see V. A. Emelichev
Diskr. Mat., 1994, Volume 6:1, 3–33
|
A. S. Podkolzin
A system for the automated solution of problems in elementary algebra
Diskr. Mat., 1994, Volume 6:4, 35–57
|
G. V. Proskurin
Limit distributions of the number of cyclic points of a stable random mapping
Diskr. Mat., 1994, Volume 6:2, 74–87
|
Kh. S. Rasulov, see M. M. Glukhov
Diskr. Mat., 1994, Volume 6:3, 3–17
|
B. V. Ryazanov
On the distribution of the spectral complexity of Boolean functions
Diskr. Mat., 1994, Volume 6:2, 111–119
|
N. F. Samatova
On the nonhomogeneity index of graphs of polytopes
Diskr. Mat., 1994, Volume 6:3, 89–93
|
B. A. Sevast'yanov
Conditional distribution of the output of memoryless automata with given input characteristics
Diskr. Mat., 1994, Volume 6:1, 34–39
|
E. V. Sherisheva
On the number of finite automata stabilized by a constant input in a fixed state
Diskr. Mat., 1994, Volume 6:4, 80–86
|
V. M. Sidel'nikov
Open coding based on Reed–Muller binary codes
Diskr. Mat., 1994, Volume 6:2, 3–20
|
Yu. V. Svirid
The cardinality of self-orthogonal convolutional codes with given parameters
Diskr. Mat., 1994, Volume 6:2, 101–110
|
V. A. Trubin, see D. D. Lozovanu
Diskr. Mat., 1994, Volume 6:2, 138–144
|
V. A. Vatutin
Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms
Diskr. Mat., 1994, Volume 6:1, 83–99
|
V. A. Vatutin
On the height of the trunk of random rooted trees
Diskr. Mat., 1994, Volume 6:3, 110–121
|
I. A. Vikhlyantsev
On realization of partitions of sets by circuits of functional elements
Diskr. Mat., 1994, Volume 6:3, 61–72
|
I. A. Vikhlyantsev, see A. E. Andreev
Diskr. Mat., 1994, Volume 6:4, 10–20
|
L. L. Voronenko, see V. B. Alekseev
Diskr. Mat., 1994, Volume 6:4, 58–79
|
S. V. Yablonskii
Lower cardinality bounds for the complexity of realization of functions in $P_k$ by schemes consisting of functional elements in an arbitrary basis
Diskr. Mat., 1994, Volume 6:4, 3–9
|
V. A. Yudin, see A. V. Kolushov
Diskr. Mat., 1994, Volume 6:1, 155–157
|
A. A. Zamyatin, see D. D. Botvich
Diskr. Mat., 1994, Volume 6:3, 122–135
|
L. P. Zhil'tsova
Coding of stochastic context-free languages with unique derivation
Diskr. Mat., 1994, Volume 6:3, 73–88
|
|
|
Contact us: