Geodesic

Sommaire du Fascicule no. 1

Complexity of discrete multicriterial problems
p. 3-33
Conditional distribution of the output of memoryless automata with given input characteristics
p. 34-39
Investigation of the process of filling cells in an allocation scheme with reflection
p. 40-52
A classification problem with errors in the measurements
p. 53-66
Distribution of the height of leaves of rooted trees
p. 67-82
Limit theorems for the number of ascending segments in random permutations generated by sorting algorithms
p. 83-99
Equations that contain an unknown permutation
p. 100-115
On the possibility of solving systems of linear integer equations by the method of isolation and estimation of separate unknowns
p. 116-126
On some transformations of random sequences
p. 127-136
Limit distributions of the height of a random forest consisting of plane rooted trees
p. 137-154
On the Korkin--Zolotarev construction
p. 155-157

Sommaire du Fascicule no. 2

Open coding based on Reed--Muller binary codes
p. 3-20
Precomplete classes in the Cartesian products of $P_2$ and $P_3$
p. 21-42
On the complexity of Boolean matrices, graphs and their corresponding Boolean functions
p. 43-73
Limit distributions of the number of cyclic points of a stable random mapping
p. 74-87
The first coordinate sequence of a linear recurrence of maximum period over a Galois ring
p. 88-100
The cardinality of self-orthogonal convolutional codes with given parameters
p. 101-110
On the distribution of the spectral complexity of Boolean functions
p. 111-119
Indistinguishability of finite automata by multiple experiments in a stationary observation environment
p. 120-128
On the computation of sets of powers
p. 129-137
The problem of the minimax path in a network and an algorithm for its solution
p. 138-144
Some properties of mutually inverse systems of functions of $p$-valued logic
p. 145-149
Testing of statistical hypotheses based on a randomly transformed realization
p. 150-158

Sommaire du Fascicule no. 3

Special $C$-equivalences of finite one-sided invertible quasigroups
p. 3-17
Generation of rational numbers by probabilistic switching $\pi$-nets
p. 18-38
Recurrence relations and enumeration interpretations of some combinatorial numbers and polynomials
p. 39-49
Properties of bent functions of $q$-valued logic over finite fields
p. 50-60
On realization of partitions of sets by circuits of functional elements
p. 61-72
Coding of stochastic context-free languages with unique derivation
p. 73-88
On the nonhomogeneity index of graphs of polytopes
p. 89-93
On the random covering of a circle: a discrete model
p. 94-109
On the height of the trunk of random rooted trees
p. 110-121
Ergodicity of a conservative communications network
p. 122-135
Lower bounds for the sums of the characters of polynomials over finite fields
p. 136-142
Properties of matrices over a commutative ring that are associated with the similarity relation
p. 143-153
Review of a book, A.\,D.~Barbour, L.~Holst, and S.~Janson ``Poisson Approximation''
p. 154-159

Sommaire du Fascicule no. 4

Lower cardinality bounds for the complexity of realization of functions in $P_k$ by schemes consisting of functional elements in an arbitrary basis
p. 3-9
Estimates for the length of a code for schemes consisting of functional elements
p. 10-20
Coverings of Boolean graphs
p. 21-34
A system for the automated solution of problems in elementary algebra
p. 35-57
On some closed classes in partial two-valued logic
p. 58-79
On the number of finite automata stabilized by a constant input in a fixed state
p. 80-86
Metric aspects of the theory of integer linear programming
p. 87-106
Limit theorems for conditional distributions
p. 107-132
On the minimal universal collectives of automata for plane labyrinths
p. 133-153
Sergei Vsevolodovich Yablonskii (on the occasion of his seventieth birthday)
p. 154-157