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

2009, Volume 21, Issue 3  

On five types of stability of the lexicographic variant of the combinatorial bottleneck problem
E. E. Gurevskii, V. A. Emelichev 		3–13
On the limit distributions of the vertex degrees of conditional Internet graphs
Yu. L. Pavlov 		14–23
On the estimation of the periods of noisy binary periodic sequences
M. I. Tikhomirova, V. P. Chistyakov 		24–32
On a constructive approach to the calculation of cardinality of the Ryser classes
V. S. Krotkin, O. V. Kuzmin 		33–36
Positively closed classes of three-valued logic generated by one-place functions
S. S. Marchenkov 		37–44
On the game-theoretical approach to the analysis of authentication codes
A. Yu. Zubov 		45–72
On combinatorial Gray codes with distance 3
A. M. Romanov 		73–78
Optimal paths in oriented graphs and eigenvectors in $\max$-$\oplus$ systems
V. D. Matveenko 		79–98
The factorisation of one-generated partially foliated formations
A. B. Elovikov 		99–118
On finite lattices of topologies of commutative unary algebras
A. V. Kartashova 		119–131
The key space of the McEliece–Sidelnikov cryptosystem
I. V. Chizhov 		132–159
Дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026