Prikladnaya Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


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




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

2013, Number 1(19)  

Theoretical Foundations of Applied Discrete Mathematics
Estimates for the number of element appearances in segments of linear recurrent sequences
I. B. Bilyak 		5–13
An upper bound for the nonlinearity of some Boolean functions with maximal possible algebraic immunity
N. A. Kolomeec 		14–16
Binary representations of underdetermined data and superimposed codes
L. A. Sholomov 		17–33

Mathematical Foundations of Computer Security
Representation of semantic role based access control system by a colored Petri net
N. A. Semenova 		34–49
Transformation rules for states in the DBMS DP-model
V. Y. Smolyaninov 		50–68

Applied Graph Theory
Edge clique coverings of graphs
I. A. Badekha 		69–83
All-pairs shortest paths algorithm for high-dimensional sparse graphs
A. R. Urakov, T. V. Timeryaev 		84–92
Asymptotics for connectivity probability of graph with low reliable arcs
G. Sh. Tsitsiashvili, M. A. Osipova, A. S. Losev 		93–98

Computational Methods in Discrete Mathematics
Study of discrete optimization problems with logical constraints based on regular partitions
A. A. Kolokolov, A. V. Adelshin, D. I. Yagofarova 		99–109
Fast multiplication in finite two-generated groups of exponent five
A. A. Kuznetsov, A. S. Kuznetsova 		110–116
On the upper bound for the density of any injective vector
D. M. Murin 		117–124
Прикладная дискретная математика
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2026