RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Author Index, 2000, Volume 12

A B C D E G I K L M N O P R S T V Y Full List
A. S. Abashin
Linear recursive MDS-codes of dimensions 2 and 3
Diskr. Mat., 2000, Volume 12:2,  140–153
V. I. Afanasyev
On the time of attaining a maximum by a critical branching process in a random environment and by a stopped random walk
Diskr. Mat., 2000, Volume 12:2,  31–50
V. E. Alekseev, S. V. Sorochan
On the entropy of hereditary classes of colored graphs
Diskr. Mat., 2000, Volume 12:2,  99–102
A. S. Asratyan, N. N. Kuzyurin
Approximation of optima of integer programs of the packing–covering type
Diskr. Mat., 2000, Volume 12:1,  96–106
V. A. Buevich
The completeness criterion for systems containing all one-place bounded-determinate functions
Diskr. Mat., 2000, Volume 12:4,  138–158
A. A. Bulatov
Abstract properties of a class of intervals of lattices of closed classes
Diskr. Mat., 2000, Volume 12:3,  95–113
S. M. Buravlev
Matchings up to the permutations which form a Latin rectangle
Diskr. Mat., 2000, Volume 12:1,  24–46
A. V. Chashkin
On a decomposition of Boolean functions
Diskr. Mat., 2000, Volume 12:3,  114–123
A. V. Chashkin
On the mean time for computing the values of elementary Boolean functions
Diskr. Mat., 2000, Volume 12:4,  109–120
D. Yu. Cherukhin
On the complexity of the realization of a linear function by formulas in finite Boolean bases
Diskr. Mat., 2000, Volume 12:1,  135–144
V. P. Chistyakov, see M. I. Tikhomirova
Diskr. Mat., 2000, Volume 12:4,  46–52
E. Couselo, see S. González
Diskr. Mat., 2000, Volume 12:4,  3–24
N. Yu. Demin
On the number of rules needed for an automaton grammar to generate a finite language
Diskr. Mat., 2000, Volume 12:4,  99–108
O. V. Denisov
A local limit theorem for the distribution of a part of the spectrum of a random binary function
Diskr. Mat., 2000, Volume 12:1,  82–95
V. A. Emelichev, V. N. Krichko, D. P. Podkopaev
On the stability radius of a vector problem of linear Boolean programming
Diskr. Mat., 2000, Volume 12:2,  25–30
V. A. Emelichev, V. G. Pokhil'ko
Analysis of the sensitivity of efficient solutions of a vector problem of minimizing linear forms on a set of permutations
Diskr. Mat., 2000, Volume 12:3,  37–48
È. È. Gasanov
Estimates for the complexity of a method for solving the problem of inclusive search
Diskr. Mat., 2000, Volume 12:2,  118–139
S. B. Gashkov
Remarks on the fast multiplication of polynomials, and Fourier and Hartley transforms
Diskr. Mat., 2000, Volume 12:3,  124–153
S. González, E. Couselo, V. Markov, A. Nechaev
The parameters of recursive MDS-codes
Diskr. Mat., 2000, Volume 12:4,  3–24
G. I. Ivchenko, Yu. I. Medvedev
Statistical problems related to the organization of the control of processes of the generation of discrete random sequences
Diskr. Mat., 2000, Volume 12:2,  3–24
I. D. Kan
Refining of the comparison rule for continuants
Diskr. Mat., 2000, Volume 12:3,  72–75
G. A. Karpunin, I. G. Shaposhnikov
Crossed homomorphisms of finite algebras with a scheme of binary operators
Diskr. Mat., 2000, Volume 12:2,  66–84
N. I. Kazimirov, Yu. L. Pavlov
A remark on Galton–Watson forests
Diskr. Mat., 2000, Volume 12:1,  47–59
M. K. Kravtsov
A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope
Diskr. Mat., 2000, Volume 12:1,  107–112
V. N. Krichko, see V. A. Emelichev
Diskr. Mat., 2000, Volume 12:2,  25–30
V. L. Kurakin
Polynomial transformations of linear recurrent sequences over finite commutative rings
Diskr. Mat., 2000, Volume 12:3,  3–36
O. V. Kuz'min, O. V. Leonova
Touchard polynomials and their applications
Diskr. Mat., 2000, Volume 12:3,  60–71
N. N. Kuzyurin, see A. S. Asratyan
Diskr. Mat., 2000, Volume 12:1,  96–106
O. V. Leonova, see O. V. Kuz'min
Diskr. Mat., 2000, Volume 12:3,  60–71
O. A. Logachev, A. A. Sal'nikov, V. V. Yashchenko
On a property of associated representations of the group $\mathrm{GL}(n,k)$
Diskr. Mat., 2000, Volume 12:2,  154–159
A. A. Makhnev
Pseudo-geometric graphs of the partial geometries $pG_2(4,t)$
Diskr. Mat., 2000, Volume 12:1,  113–134
S. S. Marchenkov
Functional aspects of the completeness problem for some classes of automaton functions
Diskr. Mat., 2000, Volume 12:2,  103–117
S. S. Marchenkov
On the complexity of the computation of rudimentary predicates
Diskr. Mat., 2000, Volume 12:4,  83–98
V. Markov, see S. González
Diskr. Mat., 2000, Volume 12:4,  3–24
A. O. Matveev
Enumeration of the faces of complexes and normalizations of distributive lattices
Diskr. Mat., 2000, Volume 12:3,  76–94
Yu. I. Medvedev, see G. I. Ivchenko
Diskr. Mat., 2000, Volume 12:2,  3–24
V. G. Mikhailov
Limit theorems for the number of nonzero solutions of a system of random equations over the field $\mathrm{GF}(2)$
Diskr. Mat., 2000, Volume 12:1,  70–81
A. Z. Nasyrov
On traversing labyrinths by automata in $n$-dimensional space
Diskr. Mat., 2000, Volume 12:4,  121–137
A. Nechaev, see S. González
Diskr. Mat., 2000, Volume 12:4,  3–24
E. V. Orlova
On the complexity of the realization of finite languages by formulas
Diskr. Mat., 2000, Volume 12:1,  145–157
Yu. L. Pavlov, see N. I. Kazimirov
Diskr. Mat., 2000, Volume 12:1,  47–59
S. V. Pazizin
Probability of correct decoding for a channel with additive normal noise and a binary symmetric channel with a random choice of code words
Diskr. Mat., 2000, Volume 12:2,  93–98
D. P. Podkopaev, see V. A. Emelichev
Diskr. Mat., 2000, Volume 12:2,  25–30
V. G. Pokhil'ko, see V. A. Emelichev
Diskr. Mat., 2000, Volume 12:3,  37–48
M. F. Raţă, A. G. Russu
On some properties of systems, complete with respect to expressibility, of formulas in the Gödel–Löb provability logic
Diskr. Mat., 2000, Volume 12:4,  63–82
U. Rösler, V. A. Topchii, V. A. Vatutin
Convergence conditions for weighted branching processes
Diskr. Mat., 2000, Volume 12:1,  7–23
A. G. Rusu, see M. F. Raţă
Diskr. Mat., 2000, Volume 12:4,  63–82
A. A. Sal'nikov, see O. A. Logachev
Diskr. Mat., 2000, Volume 12:2,  154–159
B. A. Sevast'yanov
Minimal points of a supercritical branching random walk on the lattice $\mathbf N_0^r$, and multitype Galton–Watson branching processes
Diskr. Mat., 2000, Volume 12:1,  3–6
B. A. Sevast'yanov
Sojourn times in a finite set of states of Markov branching processes and the probabilities of extinction of a modified Galton–Watson process
Diskr. Mat., 2000, Volume 12:4,  39–45
O. V. Shabanin
On the complexity of the disjunctive normal form of threshold functions
Diskr. Mat., 2000, Volume 12:2,  85–92
I. G. Shaposhnikov, see G. A. Karpunin
Diskr. Mat., 2000, Volume 12:2,  66–84
A. M. Shoitov
Repetitions of the values of a function of segments of a sequence of independent trials
Diskr. Mat., 2000, Volume 12:3,  49–59
S. V. Sorochan, see V. E. Alekseev
Diskr. Mat., 2000, Volume 12:2,  99–102
B. Stamatovic
On recognizing labyrinths by automata
Diskr. Mat., 2000, Volume 12:2,  51–65
S. A. Stepanov
Vector invariants of symmetric groups in the case of a field of prime characteristic
Diskr. Mat., 2000, Volume 12:4,  25–38
A. Kh. Tabarov
On some varieties of abelian quasigroups
Diskr. Mat., 2000, Volume 12:3,  154–159
M. I. Tikhomirova, V. P. Chistyakov
Moving chi-square
Diskr. Mat., 2000, Volume 12:4,  46–52
A. N. Timashev
On asymptotic expansions in local limit theorems for equiprobable schemes of allocating particles to distinguishable cells
Diskr. Mat., 2000, Volume 12:1,  60–69
V. A. Topchii, see U. Rösler
Diskr. Mat., 2000, Volume 12:1,  7–23
V. A. Vatutin, see U. Rösler
Diskr. Mat., 2000, Volume 12:1,  7–23
A. L. Yakymiv
On permutations with cycle lengths from a random set
Diskr. Mat., 2000, Volume 12:4,  53–62
V. V. Yashchenko, see O. A. Logachev
Diskr. Mat., 2000, Volume 12:2,  154–159
Дискретная математика
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019