Parcourir par

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

Geodesic


    Parcourir par

    • Revues
    • Séminaires
    • Livres
    • Congrès
    • Sources
Diskretnaya Matematika
Tome 11 (1999)
no. 1
Précédent Suivant

Volume 11 (1999) no. 1

Sommaire


The probability distribution of the height of the genealogical tree of a multitype Galton--Watson branching process
B. A. Sevast'yanov
p. 3-7

Branching processes and random hypertrees
V. F. Kolchin
p. 8-23

On the existence of hidden channels
A. A. Grusho
p. 24-28

The maximum run length in generalized Bernoulli sequences
L. Ja. Savel'ev
p. 29-52

Matchings up to permutations in a sequence of independent trials
S. M. Buravlev
p. 53-75

A limit theorem on the shape of Ferrers graphs
L. R. Mutafchiev
p. 76-96

Limit distributions of the number of vertices in strata of a simply generated forest
Yu. L. Pavlov ; I. A. Cheplyukova
p. 97-112

The asymptotics of the probability of nonextinction of a multidimensional branching process in a random environment
E. E. D'yakonova
p. 113-128

Reliability of binary systems
A. A. Chernyak ; Zh. A. Chernyak
p. 129-139

Conditions for the efficiency of a solution of a vector discrete optimization problem
V. A. Emelichev ; A. V. Pashkevich ; O. A. Yanushkevich
p. 140-145

On the realization of linear Boolean operators by nonbranching programs with a conditional stop
A. V. Chashkin
p. 146-150

Sergei Vsevolodovich Yablonskii (1924--1998)
V. B. Alekseev ; V. Ya. Kozlov ; V. F. Kolchin ; V. B. Kudryavtsev ; O. B. Lupanov ; È. A. Primenko
p. 151-157
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité