64 results
Search Results
2. Finite algebras of Bernoulli distributions.
3. Malcev rings.
4. On the number of independent sets in damaged Cayley graphs.
5. Weighing algorithms of classification and identification of situations.
6. Prohibitions in discrete probabilistic statistical problems.
7. An enhanced algorithm to search for low-degree annihilators for a Zhegalkin polynomial.
8. Probabilistic analysis of shelf algorithms for strip packing.
9. Complexity of multiplication in some group algebras.
10. A representation of parastrophs of loops and quasigroups.
11. On the number of closure-type mappings.
12. A semi on-line algorithm for the partition problem.
13. Boolean lattices of multiply Ω-foliated formations.
14. Lower bound for the complexity of five-valued polarized polynomials.
15. A generalisation of quadratic residue codes to the case of cubic and biquadratic residues.
16. Random sequences of the form Xt+1 = a t Xt + bt modulo n with dependent coefficients at, bt.
17. A formal reduction of the general problem of expressibility of formulas in the Gödel-Löb provability logic.
18. On a statistic for testing the homogeneity of polynomial samples.
19. On solutions and algebraic duality of generalised linear discrete time systems.
20. On large distances between neighbouring zeros of the Riemann zeta-function.
21. Nondegenerate colourings in the Brooks theorem.
22. Defragmentation of permutation tables with four columns.
23. The diameter of the ridge-graph of a cyclic polytope.
24. On ranks, Green classes, and the theory of determinants of Boolean matrices.
25. The relationship between the level of affinity and cryptographic parameters of Boolean functions.
26. An application of the method of additive chains to inversion in finite fields.
27. Schemes of public distribution of a key based on a noncommutative operation.
28. On some algorithms for constructing low-degree annihilators for Boolean functions.
29. On a class of cell circuits.
30. Endomorphisms of functional graphs.
31. On the rate of convergence of the distribution of the number of cycles of given length in a random permutation with known number of cycles to the limit distributions.
32. Approximate algorithms to pack rectangles into several strips.
33. Solvable and locally closed modules and rings.
34. On the distribution of the mth maximal cycle lengths of random A-permutations.
35. The probability distribution of sums of elements in disjoint parts of a random permutation.
36. Bounds for the probability of a constrained embedding of one discrete sequence into another.
37. Applications of a hidden Markov field model in steganalysis of images.
38. Equational closure.
39. A power divergence test in the problem of sample homogeneity for large numbers of outcomes and trials.
40. A linear in memory non-exhaustive algorithm to solve a two-dimensional interval search problem.
41. Homomorphic relations of algebras with a scheme of operators.
42. On the number of solutions of the equation (x1 + … + xn)m = ax1 … xn in a finite field.
43. On average and typical values of sums of pairwise distances for subsets of vertices of the n-dimensional unit cube.
44. A family of multivariate χ2-statistics.
45. On limit theorems for the generalised allocation scheme.
46. Emergence of a giant component in a random permutation with given number of cycles.
47. Limit distributions of the number of cycles of given length in a random permutation with given number of cycles.
48. On asymptotic expansions for the distributions of the number of cycles in a random permutation.
49. Boolean reducibility.
50. Generating triples of involutions of large sporadic groups.
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.