A parallel algorithm of complexity O(log²n) for the set balancing problem

Artikel in diesem Heft

1. On cardinality of the set of alternatives in discrete many-criterion problems
2. Estimates for the number of appearances of symbols on a segment of recurrent sequence over a finite field
3. A parallel algorithm of complexity O(log²n) for the set balancing problem
4. Inequalities for functionals generated by bipartite graphs
5. Combinatorial polynomials in the algebra of shift-commutative operators
6. On lower bounds of sums of characters over the finite fields
7. Integral limit theorems for lacunary distributions
8. On limit theorems for decomposable statistics and efficiency of the corresponding statistical tests
9. Hypercycles in a random hypergraph