Some estimates for the distribution of the height of digital search trees

Artikel in diesem Heft

1. The weight of an n-dimensional Boolean vector and addition modulo 2ⁿ; the generalization to the case of modulo mⁿ
2. Some estimates for the distribution of the height of digital search trees
3. The limit distributions of the maximum size of a tree in a random forest
4. Upper estimates for semi-invariants of the sum of multi-indexed random variables
5. A method for constructing polynomials of k-valued logic functions
6. On realization of Boolean functions by formulae without repetitions
7. Sequential and simultaneous aggregation of diophantine equations
8. Covering a sphere and extremal properties of orthogonal polynomials
9. On a method of constructing well-dispersed sequences
10. Book review