Geodesic

Volume 15 (2003) no. 1

Sommaire

Limit theorems for probabilities of large deviations of a Galton-Watson process
p. 3-27
On the asymptotic complexity of computing discrete logarithms in the field $\operatorname{\mathit{GF}}(p)$
p. 28-49
Covering runs in binary Markov sequences
p. 50-76
On good pairs in edge-regular graphs
p. 77-97
Synthesis and complexity of reliable schemes in the basis $\{\,\vee,\bar{}\,\}$ with single-type constant faults at the inputs of elements
p. 98-109
Efficient recognition of the completeness of a system of automaton functions with a complete Boolean part
p. 110-130
An order-optimal method for the synthesis of a search operator in a class of automaton circuits of a special form
p. 131-156