Geodesic

Sommaire du Fascicule no. 1

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

Sommaire du Fascicule no. 2

Independent systems of automata in labyrinths
p. 3-39
Estimation of the time required to organize a secret channel
p. 40-46
Public key distribution schemes based on a noncommutative group
p. 47-51
On the complexity of recurring sequences
p. 52-62
On a problem of V.\,G. Sprindzhuk
p. 63-82
Characteristic polynomials of multi-index transportation problems
p. 83-88
Construction of maximally non-Hamiltonian graphs
p. 89-102
On generating triples of involutions of large sporadic groups
p. 103-112
On the activity of cell circuits realising the system of all
p. 113-122
On the number of invertible homogeneous structures
p. 123-127
Limit theorems for the number of points of a given set covered by a random linear subspace
p. 128-137
Random partitions of sets with a known number of blocks
p. 138-148
On two chi-square-type statistics constructed from the frequencies of tuples of states of a multiple Markov chain
p. 149-159

Sommaire du Fascicule no. 3

Collectives of automata in labyrinths
p. 3-39
Boolean reducibility
p. 40-53
On the complexity of testing for the primality of a number by homogeneous structures
p. 54-65
On the properties of a special composition of automata
p. 66-75
On the distinguishability of states of automata
p. 76-90
Almost layer-finiteness of the periodic part of a group without involutions
p. 91-104
The structure and methods of generation of closed classes of graphs
p. 105-116
On asymptotic expansions for the distribution of the number of cycles in a random permutation
p. 117-127
Limit distributions of the number of cycles of given length in a random permutation with a known number of cycles
p. 128-144
The occurrence of a gigantic component in a random permutation with a known number of cycles
p. 145-159

Sommaire du Fascicule no. 4

Konstantin Konstantinovich Mardzhanishvili (on the centenary of his birth)
p. 3-6
Structural equivalence of $s$-tuples in random discrete sequences
p. 7-34
Limit theorems and testing hypotheses on Markov chains
p. 35-65
On glueing states of an automaton
p. 66-83
On the complexity of the string generation problem
p. 84-99
On complexity of realisation of linear Boolean functions by circuits of functional elements over the basis
p. 100-112
On the complexity of unitary transformations
p. 113-118
Inert matrices and matchings in partially oriented trees
p. 119-125
On primitive subgroups of full affine groups of finite semi-fields
p. 126-132
A~semi on-line algorithm for the partition problem
p. 133-140
On the number and structure of sum-free sets in a segment of positive integers
p. 141-147
On limit theorems for the generalised allocation scheme
p. 148-157