Parcourir par

  • Revues
  • Séminaires
  • Livres
  • Congrès
  • Sources

Geodesic


    Parcourir par

    • Revues
    • Séminaires
    • Livres
    • Congrès
    • Sources
Prikladnaâ diskretnaâ matematika
Année 2013
no. 1
Précédent Suivant

Volume (2013) no. 1

Sommaire


Estimates for the number of element appearances in segments of linear recurrent sequences
I. B. Bilyak
p. 5-13

An upper bound for the nonlinearity of some Boolean functions with maximal possible algebraic immunity
N. A. Kolomeec
p. 14-16

Binary representations of underdetermined data and superimposed codes
L. A. Sholomov
p. 17-33

Representation of semantic role based access control system by a colored Petri net
N. A. Semenova
p. 34-49

Transformation rules for states in the DBMS DP-model
V. Y. Smolyaninov
p. 50-68

Edge clique coverings of graphs
I. A. Badekha
p. 69-83

All-pairs shortest paths algorithm for high-dimensional sparse graphs
A. R. Urakov ; T. V. Timeryaev
p. 84-92

Asymptotics for connectivity probability of graph with low reliable arcs
G. Sh. Tsitsiashvili ; M. A. Osipova ; A. S. Losev
p. 93-98

Study of discrete optimization problems with logical constraints based on regular partitions
A. A. Kolokolov ; A. V. Adelshin ; D. I. Yagofarova
p. 99-109

Fast multiplication in finite two-generated groups of exponent five
A. A. Kuznetsov ; A. S. Kuznetsova
p. 110-116

On the upper bound for the density of any injective vector
D. M. Murin
p. 117-124
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité