On conditional Internet graphs whose vertex degrees have no mathematical expectation

Articles in the same Issue

1. Bounds for the number of Boolean functions admitting affine approximations of a given accuracy
2. Identification of a binary Markov chain of order s with r partial connections subjected to additive distortions
3. On conditional Internet graphs whose vertex degrees have no mathematical expectation
4. An estimate of the probability of localisation of the diameter of a random scale-free graph
5. On a recursive class of plateaued Boolean functions
6. On the distribution of some characteristics of a quasimonotone mapping
7. The expressibility problem in a lattice with closure operation
8. An algorithm to restore a linear recurring sequence over the ring R = Z_pⁿ from a linear complication of its highest coordinate sequence
9. The uniform id-decomposition of functions of many-valued logic over homogeneous functions
10. The completeness problem in the function algebra of linear integer-coefficient polynomials
11. Circuits for disjunction admitting short unitary diagnostic tests
12. The group of automorphisms of the set of bent functions
13. Complexity of multiplication in commutative group algebras over fields of prime characteristic
14. The summation of Markov sequences on a finite abelian group
15. The asymptotics of the number of repetition-free Boolean functions in the basis B₁