Geodesic

Sommaire du Fascicule no. 1

Modern enumeration theory of permutations with restricted positions
p. 3-35
Asymptotics of the number of $t$-minimal coverings of a~set
p. 36-44
A~limit theorem for a~critical branching process in a~random environment
p. 45-58
Traversing labyrinths with holes that are restricted in fixed directions
p. 59-69
Factorization of even permutations into two factors of given cyclic structure
p. 70-90
On the complexity of computation in finite Abelian, nilpotent and soluble groups
p. 91-111
Edge hypergraphs
p. 112-129
On the lattice of closed classes of nonhomogeneous functions with a~trace of type~$C$
p. 130-145
Storage of binary information in plane logic networks
p. 146-158

Sommaire du Fascicule no. 2

The Steiner problem: A~survey
p. 3-28
Labyrinth traps for groups of automata
p. 29-50
On the manifestation of automaton memory in an experiment
p. 51-58
On the reliability of schemes consisting of unreliable functional elements with one-type constant faults at the element outputs
p. 59-74
Minimal verifying tests of functions from the Post classes
p. 75-82
Large deviation theorems in a~multinomial scheme of trials
p. 83-89
Algebraic operations and equalities generated by Grassmann algebras
p. 90-97
On the $id$-decompositions of the class~$P_k$ over precomplete classes
p. 98-110
Complexity of Boolean functions in the class of canonical polarized polynomials
p. 111-115
Large deviations of the height of a~random tree
p. 116-125
Adaptive strategies in control problems with homogeneous observation processes
p. 126-137
Negative polynomial distribution
p. 138-149
Exponents of classes of non-negative matrices
p. 150-159

Sommaire du Fascicule no. 3

Waiting time and related characteristics in a~multinomial scheme
p. 3-34
On the cardinality of traces of classes of nonhomogeneous functions
p. 35-39
On the number of threshold functions
p. 40-43
The problem of discriminating hypotheses on the parameters of a~generalized moving summation process
p. 44-63
A~threshold function with the Shannon effect for Boolean functions with respect to a~symmetric group
p. 64-75
The cut width of a~graph and the value of a~vertex separation of an edge graph
p. 76-80
On an approach to the solution of a~Boolean linear equation with positive integer coefficients
p. 81-89
A~combinatorial approach to the enumeration of doubly stochastic square matrices with nonnegative integer elements
p. 90-101
Decomposition of Boolean functions into the sum of products of subfunctions
p. 102-104
Connectedness and threshold functions of subgraphs of random homogeneous hypergraphs
p. 105-115
On the complexity of traversing labyrinths by an automaton
p. 116-124
Realization of some systems of Boolean functions by schemes consisting of two-input elements
p. 125-149
On the measure of combinatorial instability of the specification of a~convex polyhedron in~$\mathbb R^3$
p. 150-156
Review of a book, Mahmoud~H.~M. ``Evolution of Random Search Trees''
p. 157-159

Sommaire du Fascicule no. 4

A~method for the design of combinational circuits suitable for control
p. 3-23
On the intersection of some classes of convergences
p. 24-28
Large deviation theorems in a~scheme of allocating identical particles to different cells
p. 29-42
Indistinguishability of finite automata in a~stationary observation environment
p. 43-53
Inclusion and ambiguity problems for regular events in semigroups
p. 54-74
On the correspondence between interval graphs and Boolean functions
p. 75-86
Families of closed classes of $k$-valued logic that are preserved by all automorphisms
p. 87-108
Reconstructibility of the fundamental invariants of a~graph
p. 109-119
Efficient algorithms for calculating the modality of polygons
p. 120-132
On the number of strictly balanced subgraphs of random homogeneous hypergraphs
p. 133-144
Strongly regular locally latticed graphs
p. 145-150
On Losev's method for fast vector-matrix multiplication
p. 151-157