Diskretnaya Matematika
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


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




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

1991, Volume 3, Issue 1  

Perfect codes in the metric of deletions and insertions
V. I. Levenshtein 		3–20
Combinatorial-symmetric analysis of multidimensional random walks
L. A. Pomortsev 		21–41
On the complexity of sorting of Boolean algebra
V. V. Morozenko 		42–47
Boolean functions that are difficult to realize and real numbers that are difficult to evaluate
S. B. Gashkov 		48–60
On the probability of the first passage into a fixed state for a random walk on a half-line
V. I. Afanasyev 		61–67
Incomplete Gaussian sums in finite fields
G. I. Perel'muter 		68–73
On the coding of semilattices and automata on semilattices
G. P. Agibalov 		74–87
On the simplification of Boolean functions with a set of zeros of a special type
A. N. Nurlybaev 		88–97
On the connection between optima in linear and integer linear programming problems
N. N. Kuzyurin 		98–104
On the design of an automaton for traversing plane labyrinths with limited holes
A. N. Zyrichev 		105–113
Binomial moments and exponential generating functions
M. N. Rokhlin 		114–132
Isomorphisms of incidence algebras
V. D. Shmatkov 		133–144
Sufficient conditions for asymptotic normality of decomposable statistics in an inhomogeneous allocation scheme
E. E. D'yakonova, V. G. Mikhailov 		145–154

Information
Review of a book, R. L. Graham, D. E. Knuth, O. Patashnik “Concrete mathematics. A foundation for computer science”
B. B. Pokhodzei 		155–156
Дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026