Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

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, 2007, Volume 14, Issue 1  


In memory of Oleg Borisovich Lupanov (1932–2006)
3–20
On symmetric spaces of graphs
V. E. Alekseev, D. V. Zakharova
21–26
On the construction of schemes for adders of small depth
S. B. Gashkov, M. I. Grinchuk, I. S. Sergeev
27–44
On the depth of Boolean functions over an arbitrary infinite basis
O. M. Kasim-zade
45–69
On an efficient method for estimating the number of nonrepeating words
R. M. Kolpakov
70–86
On one of the possibilities of sharpening estimates for the delay of a parallel adder
V. M. Khrapchenko
86–93
Modeling nonbranching programs with conditional stopping on a universal Turing machine
A. V. Chashkin
94–109
On the complexity of the sequential realization of partial Boolean functions by schemes
L. A. Sholomov
110–139
Дискретный анализ и исследование операций
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025