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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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

Author Index, 1997, Volume 4

A B C D E F G I K M N P R S Y Z Full List
A. A. Ageev
Complexity of the determination of the maximum weighted joining in a graph
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:3,  3–8
V. E. Alekseev
On lower layers of a lattice of hereditary classes of graphs
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:1,  3–12
S. V. Avgustinovich
On the partition of a set of edges of a graph into isomorphic trees
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:4,  3–5
V. L. Beresnev
Mathematical models of planning the development of technical means
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:1,  4–29
A. V. Chashkin
On the average time for the computation of the values of Boolean functions
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:1,  60–78
A. V. Chashkin
Lower bounds on complexity of restrictions of Boolean functions
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:2,  75–111
A. V. Chashkin
On the computation of Boolean functions by probabilistic programs
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:3,  49–68
A. V. Chashkin
Local complexity of Boolean functions
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:3,  69–80
D. Yu. Cherukhin
On an infinite sequence of improvable Boolean bases
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:4,  79–95
A. A. Dobrynin, I. Gutman, V. Iovashevich
Bicyclic graphs and their edge graphs with coinciding Wiener index
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:2,  3–9
P. V. Efremov
Matchings in geometric bipartite graphs
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:2,  10–22
V. A. Emelichev, E. Girlikh, O. A. Yanushkevich
Lexicographic optima of a multicriterial problem
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:2,  3–14
A. A. Evdokimov, A. L. Perezhogin
Minimal numerations of subsets of a finite set, and the problem of the Hamiltonicity of the graph of the middle layers of a hypercube
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:4,  6–12
A. N. Fionov
An efficient method for the randomization of messages based on arithmetic coding
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:2,  51–74
A. È. Frid
On the combinatorial complexity of iteratively generated symbol sequences
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:1,  53–59
E. Kh. Gimadi, N. I. Glebov, V. V. Zalyubovskii
On some problems of mutual amortization of enterprises
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:1,  30–39
E. Girlikh, see V. A. Emelichev
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:2,  3–14
N. I. Glebov, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:1,  30–39
I. Gutman, see A. A. Dobrynin
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:2,  3–9
V. Iovashevich, see A. A. Dobrynin
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:2,  3–9
K. N. Kashirskich, K. N. Potts, S. V. Sevast'yanov
An improved algorithm for solving the two-machine flow shop problem with nonsimultaneous arrival of jobs
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:1,  13–32
O. M. Kasim-zade
Minimal coverings of a Boolean cube by centered antichains
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:3,  9–17
Yu. A. Kochetov, A. V. Plyasunov
A polynomially solvable class of two-level linear programming problems
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:2,  23–33
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:2,  112–114
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:4,  112–114
A. D. Korshunov
On the asymptotics of the number of binary words with a given length of a maximal series. I
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:4,  13–46
Yu. E. Malashenko, N. M. Novikova
Superconcurrent distribution of flows in multicommodity networks
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:2,  34–54
S. S. Marchenkov
$A$-classification of finite injective functions
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:2,  15–42
V. N. Noskov
On the reconstruction of the correct operation of faulty parts of combinational circuits
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:4,  47–74
N. M. Novikova, see Yu. E. Malashenko
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:2,  34–54
M. G. Pashchenko
Lower bounds for the objective function in a dynamic problem of the choice of optimal composition of machinery in a two-level system
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:1,  40–53
A. L. Perezhogin, see A. A. Evdokimov
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:4,  6–12
A. V. Plyasunov, see Yu. A. Kochetov
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:2,  23–33
K. N. Potts, see K. N. Kashirskich
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:1,  13–32
A. V. Pyatkin, see Yu. V. Shamardin
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:1,  79–87
E. O. Rapoport
Turnpike strategies in the distribution of an indivisible resource
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:1,  33–45
A. M. Romanov
On the construction of perfect nonlinear binary codes by symbol inversion
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:1,  46–52
A. M. Romanov
On nonsystematic perfect codes of length 15
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:4,  75–78
F. I. Salimov
Finite generability of distribution algebras
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:2,  43–50
A. A. Sapozhenko
On the number of connected sets with given cardinality of a neighborhood in a graph
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:3,  18–34
S. V. Sevast'yanov, see K. N. Kashirskich
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:1,  13–32
Yu. V. Shamardin
A model for the estimation of the opposition of two coalitions
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:1,  54–64
Yu. V. Shamardin, A. V. Pyatkin
On the accuracy of a set-partition algorithm
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:1,  79–87
M. I. Sviridenko
An approximate algorithm for solving a dynamic problem on the $p$-median for a maximum
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:2,  55–62
M. I. Sviridenko
On the accuracy of solutions of location problems for a maximum by greedy algorithms
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:3,  35–48
O. A. Yanushkevich, see V. A. Emelichev
Diskretn. Anal. Issled. Oper., Series 1, 1997, Volume 4:2,  3–14
V. V. Zalyubovskii, see E. Kh. Gimadi
Diskretn. Anal. Issled. Oper., Series 2, 1997, Volume 4:1,  30–39
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018