Geodesic

Sommaire du Fascicule no. 1

Perfect codes in the metric of deletions and insertions
p. 3-20
Combinatorial-symmetric analysis of multidimensional random walks
p. 21-41
On the complexity of sorting of Boolean algebra
p. 42-47
Boolean functions that are difficult to realize and real numbers that are difficult to evaluate
p. 48-60
On the probability of the first passage into a~fixed state for a~random walk on a~half-line
p. 61-67
Incomplete Gaussian sums in finite fields
p. 68-73
On the coding of semilattices and automata on semilattices
p. 74-87
On the simplification of Boolean functions with a~set of zeros of a~special type
p. 88-97
On the connection between optima in linear and integer linear programming problems
p. 98-104
On the design of an automaton for traversing plane labyrinths with limited holes
p. 105-113
Binomial moments and exponential generating functions
p. 114-132
Isomorphisms of incidence algebras
p. 133-144
Sufficient conditions for asymptotic normality of decomposable statistics in an inhomogeneous allocation scheme
p. 145-154
Review of a book, R.\,L.~Graham, D.\,E.~Knuth, O.~Patashnik
p. 155-156

Sommaire du Fascicule no. 2

Polyhedral aspects of multi-index axial transportation problems
p. 3-24
An asymptotic formula for the number of correlation-immune Boolean functions of order~$k$
p. 25-46
Combinatorial-probability and geometric methods in threshold logic
p. 47-57
Vector optimization of decompositions of root trees
p. 58-68
On a~mathematical information search mode
p. 69-76
Lower bounds on character sums over finite fields
p. 77-86
Estimates for the number of appearances of elements on an interval of a~recurrent sequence over a~finite field
p. 87-95
Minors and permanents of some (0,1)-matrices
p. 96-102
Planarity of coverings of graphs
p. 103-113
Comparative complexity of probabilistic and deterministic automata
p. 114-120
M\"obius functions of the union of partial orders
p. 121-127
Sampling sums of dependent variables, mixtures of infinitely divisible laws, and branching random processes
p. 128-147
Complexity of the specification of a~convex polyhedron in $R^3$
p. 148-156
Review of a book, I.~Goulden, D.~Jackson ``Combinatorial enumeration''
p. 157-159

Sommaire du Fascicule no. 3

On the power of sets of alternatives in discrete multicriterial problems
p. 3-12
On the organization of knowledge bases in view of automatic problem solving
p. 13-30
A~lower bound on the time complexity of an integer problem on the uniqueness of elements
p. 31-34
One-dimensional projections of polyhedra of problems of discrete optimization
p. 35-45
Enumeration of Hamiltonian cycles
p. 46-49
Inequalities for functionals generated by bipartite graphs
p. 50-65
On the compact summation of vectors
p. 66-72
Limit theorems for decomposable statistics and efficiencies of the corresponding statistical tests
p. 73-88
Integral limit theorems for lacunary distributions
p. 89-101
Hypercycles in a~random hypergraph
p. 102-108
On the number of permutations with cycle lengths in a~given set
p. 109-123
On the functional system $P_{k,\Pi}$
p. 124-134
A~new proof of the Budach~-- Podkolzin theorem
p. 135-146
Ravines of functions and absolutely nonuniform sets and functions
p. 147-158
Review of a book, B.\,A.~Bondarenko ``Generalized Pascal triangles and pyramids, their fractals, graphs and applications''
p. 159-160

Sommaire du Fascicule no. 4

Ivan Matveevich Vinogradov (on the 100th anniversary of his birth)
Classification of lower neighborhoods of closed classes in the lattice~$\mathcal L_k$
p. 3-15
The problem of two periodic tasks
p. 16-23
Joint generalization of the theorems of Lebesgue and Kotzig on the combinatorics of planar maps
p. 24-27
The number and cardinalities of components of solutions of a~discrete isoperimetric problem in the Hamming space
p. 28-46
Transformation of an automaton group under the action of a~feedback operation that admits more than two values
p. 47-51
Boolean graphs and functions
p. 52-61
Methods for constructing de Bruijn sequences
p. 62-78
Elementary theories of finitely presented loops with the invertibility property
p. 79-90
Cyclic properties of some Hamiltonian graphs
p. 91-104
Linear recurrent sequences over commutative rings
p. 105-127
On the degree of uniform id-decomposition of closed classes in~$P_k$
p. 128-142
Distinguishability of vertices of automaton labyrinths by finite automata
p. 143-152
A~parallel algorithm of complexity $O(\log\sp 2n)$ for a~problem on balancing sets
p. 153-158