RUS  ENG
Full version
PEOPLE

Ivchenko Grigorii Ivanovich

Publications in Math-Net.Ru

  1. Records in random permutations

    Mat. Vopr. Kriptogr., 15:3 (2024),  49–66
  2. Random $A$-permutations in a parametric model

    Mat. Vopr. Kriptogr., 15:1 (2024),  35–55
  3. Properties of the structure of random partitions of a finite set in parametric model

    Mat. Vopr. Kriptogr., 14:1 (2023),  45–63
  4. Multiparametric models of random partitions. Limit distributions and statistical inference

    Mat. Vopr. Kriptogr., 13:4 (2022),  37–51
  5. Random partitions with two-side bounds and $(r,s)$-Bell polynomials in a parametric probabilistic model

    Mat. Vopr. Kriptogr., 13:3 (2022),  77–92
  6. The roots of generating functions and sums of integer-valued random variables

    Mat. Vopr. Kriptogr., 11:1 (2020),  27–46
  7. Partitions without small blocks and $r$-associated Bell polynomials in a parametric model: probabilistic-statistical analysis

    Mat. Vopr. Kriptogr., 10:1 (2019),  27–40
  8. Parametric models of $r$-permutations and $r$-partitions and their probabilistic-statistical analysis

    Mat. Vopr. Kriptogr., 9:1 (2018),  47–64
  9. Parametric models for random combinatorial objects of exponential type and their probabilistic-statistical analysis

    Mat. Vopr. Kriptogr., 8:3 (2017),  41–56
  10. The structure of Boolean functions spectra

    Mat. Vopr. Kriptogr., 7:1 (2016),  57–70
  11. Krawtchouk polynomials and their applications in cryptography and coding theory

    Mat. Vopr. Kriptogr., 6:1 (2015),  33–56
  12. Some problems of spectral analysis of random Boolean functions with constraints

    Diskr. Mat., 25:1 (2013),  90–110
  13. Symmetric Boolean functions and their metric properties matrices of transitions of differences when using some modular groups

    Mat. Vopr. Kriptogr., 4:4 (2013),  49–63
  14. Analysis of the spectrum of random symmetric Boolean functions

    Mat. Vopr. Kriptogr., 4:1 (2013),  59–76
  15. Statistical problems on random permutations with censored data

    Diskr. Mat., 24:4 (2012),  104–113
  16. Stochastic Boolean functions and their spectra

    Mat. Vopr. Kriptogr., 3:3 (2012),  21–34
  17. Some nonequiprobable models of random permutations

    Diskr. Mat., 23:3 (2011),  23–31
  18. Spectrum of random Boolean function and its generating function

    Mat. Vopr. Kriptogr., 2:2 (2011),  41–53
  19. Random polynomials over a finite field

    Diskr. Mat., 20:1 (2008),  3–24
  20. Random incomplete substitutions

    Tr. Diskr. Mat., 11:1 (2008),  35–46
  21. Random combinatorial objects in a general parametric model

    Tr. Diskr. Mat., 10 (2007),  73–86
  22. Random permutations: the general parametric model

    Diskr. Mat., 18:4 (2006),  105–112
  23. Statistical inference for random substitutions with incomplete data

    Tr. Diskr. Mat., 9 (2006),  66–76
  24. Statistics of a parametric model of random substitutions

    Tr. Diskr. Mat., 8 (2004),  116–127
  25. Comparison of Sampling Schemes with and without Replacement

    Mat. Zametki, 73:2 (2003),  195–205
  26. On a class of nonuniform permutations of a random order

    Tr. Diskr. Mat., 7 (2003),  75–88
  27. Investigation of changing urn schemes parameters

    Tr. Diskr. Mat., 6 (2002),  64–81
  28. On random permutations

    Tr. Diskr. Mat., 5 (2002),  73–92
  29. Goncharov's method and its development in the analysis of different models of random permutations

    Teor. Veroyatnost. i Primenen., 47:3 (2002),  558–566
  30. Extremal characteristics of random polynomial over a finite field

    Tr. Diskr. Mat., 4 (2001),  71–82
  31. Statistical problems related to the organization of the control of processes of the generation of discrete random sequences

    Diskr. Mat., 12:2 (2000),  3–24
  32. On the structure of random polynomials over finite fields

    Tr. Diskr. Mat., 3 (2000),  111–138
  33. Estimation in the Markov-Pólya scheme

    Mat. Zametki, 64:3 (1998),  373–382
  34. How many samples does it take to see all the balls in an urn?

    Mat. Zametki, 64:1 (1998),  58–63
  35. Mixtures of probability distributions, and random allocations

    Tr. Diskr. Mat., 2 (1998),  169–182
  36. Decomposable statistics and stopping times in a scheme of sampling without replacement

    Diskr. Mat., 9:1 (1997),  43–58
  37. Exact maximum likelihood estimator of the structure of a stratified population

    Mat. Zametki, 62:2 (1997),  216–222
  38. On the asymptotic efficiency of separable statistics in a polynomial scheme

    Tr. Diskr. Mat., 1 (1997),  121–138
  39. Statistical estimation of the composition of a finite set

    Diskr. Mat., 8:1 (1996),  3–40
  40. Random polynomials over a finite field

    Teor. Veroyatnost. i Primenen., 41:1 (1996),  204–210
  41. Decomposable statistics in inverse urn problems

    Diskr. Mat., 7:2 (1995),  103–117
  42. On the waiting time in an allocation scheme with reflection

    Diskr. Mat., 7:1 (1995),  145–151
  43. Concerning a class of similarity tests

    Mat. Zametki, 58:4 (1995),  536–546
  44. On the random covering of a circle: a discrete model

    Diskr. Mat., 6:3 (1994),  94–109
  45. Investigation of the process of filling cells in an allocation scheme with reflection

    Diskr. Mat., 6:1 (1994),  40–52
  46. Waiting time and related characteristics in a multinomial scheme

    Diskr. Mat., 5:3 (1993),  3–34
  47. Negative polynomial distribution

    Diskr. Mat., 5:2 (1993),  138–149
  48. Allocations with reflection. Waiting time

    Diskr. Mat., 4:4 (1992),  26–33
  49. Limit theorems for decomposable statistics and efficiencies of the corresponding statistical tests

    Diskr. Mat., 3:3 (1991),  73–88
  50. Some conditional distributions for random graphs

    Diskr. Mat., 2:2 (1990),  89–96
  51. Decomposable statistics and a class of stopping times for multinomial experiments

    Dokl. Akad. Nauk SSSR, 305:1 (1989),  26–30
  52. An asymptotic estimate for stratified finite populations

    Diskr. Mat., 1:3 (1989),  87–95
  53. Decomposable statistics in an inverse occupancy problem

    Diskr. Mat., 1:1 (1989),  60–73
  54. Poisson convergence in a generalized allocation scheme

    Mat. Zametki, 44:3 (1988),  362–368
  55. On Asymptotic Normality of Randomized Separable Statistics in a Generalized Allocation Scheme

    Teor. Veroyatnost. i Primenen., 33:4 (1988),  807–813
  56. New Statistical Tests in the Multinomial Scheme and Their Asymptotic Properties

    Teor. Veroyatnost. i Primenen., 33:1 (1988),  201–205
  57. Moments of separable statistics in a generalized distribution scheme

    Mat. Zametki, 39:2 (1986),  284–294
  58. Decomposable statistics and goodness-of-fit tests for multinomial samples

    Trudy Mat. Inst. Steklov., 177 (1986),  60–74
  59. On the estimation of the rate of convergence in limit theorems for divisible statistics

    Teor. Veroyatnost. i Primenen., 31:1 (1986),  91–97
  60. A new way of analyzing frequencies in the method of grouping of observations, and the optimality of the $\chi^2$ test

    Dokl. Akad. Nauk SSSR, 277:2 (1984),  287–291
  61. Discrete problems in probability theory

    Itogi Nauki i Tekhniki. Ser. Teor. Veroyatn. Mat. Stat. Teor. Kibern., 22 (1984),  3–60
  62. On some problems of statistical inference for stratified populations

    Teor. Veroyatnost. i Primenen., 29:1 (1984),  113–118
  63. Optimal estimation for a finite population of unknown size

    Mat. Zametki, 31:4 (1982),  633–640
  64. On the estimation of the size of a finite population

    Teor. Veroyatnost. i Primenen., 27:2 (1982),  380–384
  65. Estimation in sampling from a finite population

    Mat. Zametki, 28:4 (1980),  623–633
  66. Decomposable statistics and the hypotheses testing for groupped data

    Teor. Veroyatnost. i Primenen., 25:3 (1980),  549–560
  67. О некоторых граничных функционалах для марковских блужданий

    Mat. Zametki, 23:2 (1978),  315–326
  68. Decomposable statistics and hypothesis testing. The case of small samples

    Teor. Veroyatnost. i Primenen., 23:4 (1978),  796–806
  69. Asymptotic normality in the scheme of simple random sampling without replacement

    Teor. Veroyatnost. i Primenen., 23:1 (1978),  97–108
  70. On a sequential test

    Teor. Veroyatnost. i Primenen., 21:4 (1976),  854–857
  71. Asymptotic normality of one class of statistics in a multinomial scheme

    Teor. Veroyatnost. i Primenen., 21:1 (1976),  190–195
  72. On some distributions connected with the waiting time in a polynomial scheme

    Teor. Veroyatnost. i Primenen., 20:3 (1975),  557–570
  73. Wating time and testing hypotheses in a multinomial scheme

    Teor. Veroyatnost. i Primenen., 19:4 (1974),  839–844
  74. On comparison of binomial and Poisson distributions

    Teor. Veroyatnost. i Primenen., 19:3 (1974),  612–615
  75. On the limit distributions for middle order statistics in a scheme of series

    Teor. Veroyatnost. i Primenen., 19:2 (1974),  278–288
  76. Variational series for the scheme of summing independent variables

    Teor. Veroyatnost. i Primenen., 18:3 (1973),  557–570
  77. The Strength of Connectivity of a Random Graph

    Teor. Veroyatnost. i Primenen., 18:2 (1973),  417–425
  78. On asymptotic behaviour of the degrees of vertices in a random graph

    Teor. Veroyatnost. i Primenen., 18:1 (1973),  195–203
  79. Limit theorems in an occupancy problem

    Teor. Veroyatnost. i Primenen., 16:2 (1971),  292–305
  80. On limit distributions of order statistics of a multinomial distribution

    Teor. Veroyatnost. i Primenen., 16:1 (1971),  94–107
  81. The distribution of a random number of particles in cells

    Mat. Zametki, 1:5 (1967),  549–554
  82. Asymptotic behaviour of a number of groups of particles in a classical problem of permutation

    Teor. Veroyatnost. i Primenen., 11:4 (1966),  701–708
  83. Some Multidimensional Theorems Concerning one Classical Problem on Permutation

    Teor. Veroyatnost. i Primenen., 10:1 (1965),  156–162
  84. Asymptotic Representations of Finite Differences of a Power Function at an Arbitrary Point

    Teor. Veroyatnost. i Primenen., 10:1 (1965),  151–156

  85. To the memory of Igor Aleksandrovich Kruglov

    Mat. Vopr. Kriptogr., 11:4 (2020),  5–6
  86. Валентин Федорович Колчин (1934–2016)

    Diskr. Mat., 28:4 (2016),  3–5
  87. Yurii Vasil'evich Prokhorov (on the occasion of his eightieth birthday)

    Diskr. Mat., 22:1 (2010),  3–4
  88. Vladimir Yakovlevich Kozlov (on the occasion of his ninetieth birthday)

    Diskr. Mat., 16:2 (2004),  3–6
  89. To the 90th birthday of Kozlov V. Ya.

    Teor. Veroyatnost. i Primenen., 49:3 (2004),  615–617

© Steklov Math. Inst. of RAS, 2025