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


Series 1, 1998, Volume 5, Number 4  


On the structure of minimal distance graphs of perfect binary $(n,3)$-codes
S. V. Avgustinovich
3
The height of small faces in planar normal maps
O. V. Borodin, D. V. Loparev
6
Edge and total coloring of interval graphs
V. A. Boiarshinov
18
On the distance between perfect binary codes
A. Yu. Vasil'eva
25
On problems of lexicographic optimization
V. A. Emelichev, O. A. Yanushkevich
30
Distance-preserving cyclic codes on a linear basis
A. J. van Zanten
38
An estimate for the accuracy of the greedy descent algorithm for the problem of minimizing a supermodular function
V. P. Il'ev
45
On cyclic $\langle m,n\rangle$-numerations
A. L. Perezhogin
61
On the algorithmic complexity of the classical reliability problem
A. A. Chernyak
71
Fast coding of Markov sources with low entropy
M. P. Sharova
81

Information
New books for discrete mathematics
A. D. Korshunov
97
Дискретный анализ и исследование операций
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020