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



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






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

Author Index, 1996, Volume 3

A B C D G I K M N P R S T Full List
G. G. Amanzhaev
$\epsilon$-entropy and discrete analogues of classes of entire analytic functions
Diskretn. Anal. Issled. Oper., 1996, Volume 3:2,  3–14
G. G. Amanzhaev
Discrete analogues of infinitely smooth functions
Diskretn. Anal. Issled. Oper., 1996, Volume 3:3,  3–39
O. V. Borodin
Colorings and topological representations of graphs
Diskretn. Anal. Issled. Oper., 1996, Volume 3:4,  3–27
I. D. Chernykh, see S. V. Sevast'yanov
Diskretn. Anal. Issled. Oper., 1996, Volume 3:1,  57–74
A. Yu. Chirkov
A lower bound for the number of vertices of the convex hull of integer and mixed-integer points of a polyhedron
Diskretn. Anal. Issled. Oper., 1996, Volume 3:2,  80–89
V. A. Doiber, A. V. Kostochka, H. Sachs
A very short proof of Dirac's theorem on the number of edges in chromatically critical graphs
Diskretn. Anal. Issled. Oper., 1996, Volume 3:4,  28–34
N. I. Glebov, see A. G. Shchukin
Diskretn. Anal. Issled. Oper., 1996, Volume 3:1,  80–90
M. I. Grinchuk
On the complexity of the realization of Boolean functions in three classes of schemes in a basis consisting of all symmetric functions
Diskretn. Anal. Issled. Oper., 1996, Volume 3:1,  3–8
V. P. Il'ev
An error estimate for a gradient algorithm for independence systems
Diskretn. Anal. Issled. Oper., 1996, Volume 3:1,  9–22
M. A. Iordanskii
Constructive descriptions of graphs
Diskretn. Anal. Issled. Oper., 1996, Volume 3:4,  35–63
V. V. Kochergin
On the complexity of computations in finite nilpotent groups
Diskretn. Anal. Issled. Oper., 1996, Volume 3:1,  43–52
A. V. Kononov
Combinatorial complexity of scheduling jobs with simple linear growth of processing times
Diskretn. Anal. Issled. Oper., 1996, Volume 3:2,  15–32
A. D. Korshunov
On the number of $(-1,1)$-matrices of order $n$ with a fixed permanent
Diskretn. Anal. Issled. Oper., 1996, Volume 3:1,  23–42
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., 1996, Volume 3:2,  90–91
A. D. Korshunov
New books for discrete mathematics
Diskretn. Anal. Issled. Oper., 1996, Volume 3:4,  93–94
É. Sh. Kospanov
On a relation between the computation time of a direct mapping and an inverse mapping
Diskretn. Anal. Issled. Oper., 1996, Volume 3:3,  40–46
A. V. Kostochka, see V. A. Doiber
Diskretn. Anal. Issled. Oper., 1996, Volume 3:4,  28–34
A. A. Makhnev
On extensions of partial geometries containing small $\mu$-subgraphs
Diskretn. Anal. Issled. Oper., 1996, Volume 3:3,  71–83
S. S. Marchenkov
$G$-precomplete classes of many-valued logic
Diskretn. Anal. Issled. Oper., 1996, Volume 3:3,  47–70
Yu. V. Merekin
A lower bound on complexity for schemes of the concatenation of words
Diskretn. Anal. Issled. Oper., 1996, Volume 3:1,  52–56
V. N. Noskov
On transformations of combinational circuits that increase the reliability of their parts
Diskretn. Anal. Issled. Oper., 1996, Volume 3:2,  33–61
V. V. Nyu
On the existence of spanning circuits in graphs with short cycles
Diskretn. Anal. Issled. Oper., 1996, Volume 3:4,  64–68
A. L. Perezhogin
On a locally isometric coding of natural numbers
Diskretn. Anal. Issled. Oper., 1996, Volume 3:4,  69–76
N. P. Red'kin
Asymptotically minimal self-correcting schemes for a sequence of Boolean functions
Diskretn. Anal. Issled. Oper., 1996, Volume 3:2,  62–79
H. Sachs, see V. A. Doiber
Diskretn. Anal. Issled. Oper., 1996, Volume 3:4,  28–34
A. I. Serdyukov
On a property of the traveling salesman problem for a maximum in a two-dimensional normed space
Diskretn. Anal. Issled. Oper., 1996, Volume 3:1,  75–79
S. V. Sevast'yanov, I. D. Chernykh
A sufficient condition for the effective solvability of the open shop problem
Diskretn. Anal. Issled. Oper., 1996, Volume 3:1,  57–74
A. G. Shchukin, N. I. Glebov
On the complexity of some generalizations of Johnson's two-machine problem
Diskretn. Anal. Issled. Oper., 1996, Volume 3:1,  80–90
R. Yu. Simanchev
Rank inequalities that generate facets of a polyhedron of connected $k$-factors
Diskretn. Anal. Issled. Oper., 1996, Volume 3:3,  84–110
M. M. Trofimova
A search for a partially known word in a dictionary
Diskretn. Anal. Issled. Oper., 1996, Volume 3:4,  77–92
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020