Parcourir par

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

Geodesic


    Parcourir par

    • Revues
    • Séminaires
    • Livres
    • Congrès
    • Sources
Diskretnaya Matematika
Tome 20 (2008)
no. 3
Précédent Suivant

Volume 20 (2008) no. 3

Sommaire


Random graphs of Internet type and the generalised allocation scheme
Yu. L. Pavlov ; I. A. Cheplyukova
p. 3-18

Finite probabilistic structures
V. M. Maksimov
p. 19-27

Consistency and an algorithm recognising inconsistency of realisations of a~system of random discrete equations with two-valued unknowns
A. V. Shapovalov
p. 28-39

Limit distributions of the number of absent chains of identical outcomes
M. I. Tikhomirova
p. 40-46

A simple upper bound for the number of spanning trees of regular graphs
V. A. Voblyi
p. 47-50

The fundamental difference between depth and delay
V. M. Khrapchenko
p. 51-72

Asymptotic bounds for the affinity level for almost all Boolean functions
M. L. Buryakov
p. 73-79

The closure operator with the equality predicate branching on the set of partial Boolean functions
S. S. Marchenkov
p. 80-88

Dynamic databases with optimal in order time complexity
I. S. Lapshov
p. 89-100

A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
V. N. Bezverkhnii ; I. V. Dobrynina
p. 101-110

Local factorisations of nonlocal Fitting classes
V. V. Shpakov ; N. T. Vorob'ev
p. 111-118

On start states of an automaton model of lung in pure environment
Yu. G. Geras'kina
p. 119-135

The order of communication complexity of PIR-protocols
G. A. Mailybaeva
p. 136-146

Provable security of digital signatures in the tamper-proof device model
N. P. Varnovskii
p. 147-159
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité