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, 1999, Volume 6

A B C D E F G K L M N O P R S V W Z Full List
V. E. Alekseev
A polynomial algorithm for finding the largest independent sets in claw-free graphs
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:4,  3–19
O. V. Borodin, A. V. Kostochka, A. Raspaud, E. Sopena
Acyclic coloring of 1-planar graphs
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:4,  20–35
A. V. Chashkin
Modeling of circuits consisting of functional elements by Turing machines
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:3,  42–70
A. A. Chernyak
Residual reliability of $P$-threshold graphs
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:3,  71–86
O. V. Chervyakov
Affine symmetries of the polytope of an independence system with unit shift
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:2,  82–96
M. R. Davidson
Approximate solution of a linear programming problem by the method of potential functions
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:2,  12–22
V. T. Dement'ev, see L. Y. Gorbachevskaya
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:2,  3–11
V. A. Emelichev, Yu. V. Nikulin
On two types of stability in a vector linear-quadratic Boolean programming problem
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:2,  23–31
A. Yu. Filatov, see V. I. Zorkal'tsev
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:1,  33–42
A. È. Frid
On graphs of subwords of DOL-sequences
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:4,  92–103
E. N. Goncharov, Yu. A. Kochetov
The behavior of probabilistic greedy algorithms for a multistage location problem
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:1,  12–32
L. Y. Gorbachevskaya, V. T. Dement'ev, Yu. V. Shamardin
A two-level standardization problem with the uniqueness condition for the optimal consumption choice
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:2,  3–11
M. Yu. Kalugina, see R. M. Larin
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:2,  42–47
A. V. Klepinin, E. V. Sukhanov
On the combinatorial properties of the Arshon sequence
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:2,  23–40
Yu. A. Kochetov, see E. N. Goncharov
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:1,  12–32
R. M. Kolpakov
A criterion for the generation of sets of rational probabilities in the class of Boolean functions
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:2,  41–61
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:2,  97–98
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:4,  123–124
A. V. Kostochka, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:4,  20–35
R. M. Larin, M. Yu. Kalugina
A problem of constructing a hierarchical structure
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:2,  42–47
S. A. Malyugin
Enumeration of perfect binary codes of length 15
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:2,  48–73
S. A. Malyugin
On a lower bound for the number of perfect binary codes
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:4,  44–48
S. S. Marchenkov
$A$-classification of idempotent functions of many-valued logic
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:1,  19–43
Yu. V. Merekin
Lower bounds for the multiplicative complexity of symbol sequences defined by monotone symmetric Boolean functions
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:3,  3–9
Yu. V. Nikulin, see V. A. Emelichev
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:2,  23–31
V. N. Noskov
Diagnosis of parts of circuits in automaton bases
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:1,  44–64
V. N. Noskov
On transformations that improve the reliability of parts of circuits in automaton bases
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:3,  10–41
E. A. Okolnishnikova
Comparison of the complexities of nondeterministic branching $k$-programs
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:1,  65–85
A. L. Perezhogin
On cyclic enumerations of binary sets in terms of given distances
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:2,  62–69
V. N. Potapov
Estimates for the redundancy of the coding of sequences by the Lempel–Ziv algorithm
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:2,  70–81
V. N. Potapov
A survey of methods for the undistorted coding of discrete sources
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:4,  49–91
A. Raspaud, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:4,  20–35
S. V. Sevast'yanov, see G. J. Woeginger
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:2,  3–22
Yu. V. Shamardin, see L. Y. Gorbachevskaya
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:2,  3–11
M. P. Sharova
The influence of dictionary size on the degree of text compression
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:1,  86–96
V. V. Shenmaier
Maximization of a linear objective function by a greedy algorithm
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:4,  104–120
V. I. Shmyrev
A new version of the Hungarian method for finding equilibrium in a linear exchange model
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:1,  43–60
V. I. Shmyrev, Yu. A. Volenko
The Hungarian method for finding equilibrium in a linear exchange model with fixed budgets
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:1,  61–77
L. A. Sholomov
On the complexity of problems of minimization and compression of models of sequential choice
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:3,  87–109
E. Sopena, see O. V. Borodin
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:4,  20–35
E. V. Sukhanov, see A. V. Klepinin
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:2,  23–40
A. J. van Zanten
Binomial number systems and enumerations of combinatorial objects
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:1,  12–18
A. Yu. Vasil'eva
Local spectra of perfect binary codes
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:1,  3–11
V. G. Vizing
On the connected coloring of graphs in prescribed colors
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:4,  36–43
Yu. A. Volenko, see V. I. Shmyrev
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:1,  61–77
I. P. Voznyuk
The location problem on networks with bounded communication capacities
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:1,  3–11
G. J. Woeginger, S. V. Sevast'yanov
A linear approximation scheme for the multiprocessor open shop problem
Diskretn. Anal. Issled. Oper., Series 1, 1999, Volume 6:2,  3–22
G. I. Zabinyako
A program package for integer linear programming
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:2,  32–41
V. I. Zorkal'tsev, A. Yu. Filatov
New algorithms for optimization in the cone of the central path
Diskretn. Anal. Issled. Oper., Series 2, 1999, Volume 6:1,  33–42
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2018