RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
 
Mikhailov Vladimir Gavrilovich

Total publications: 111 (106)
in MathSciNet: 66 (64)
in zbMATH: 49 (49)
in Web of Science: 24 (24)
in Scopus: 26 (26)
Cited articles: 59
Citations in Math-Net.Ru: 253
Citations in Web of Science: 70
Citations in Scopus: 51
Presentations: 5

Number of views:
This page:3201
Abstract pages:14339
Full texts:3853
References:798
Senior Researcher
Doctor of physico-mathematical sciences (1988)
Speciality: 01.01.05 (Probability theory and mathematical statistics)
Birth date: 10.09.1945
E-mail:
   
Main publications:
  1. Mikhailov V. G., “Poisson type limit theorem for pairs of completely”, Teoriya Veroyatnostey i Primrneniya, 53:1 (2008), 59–71

http://www.mathnet.ru/eng/person17796
List of publications on Google Scholar
http://zbmath.org/authors/?q=ai:mikhailov.v-g|mikhajlov.v-g
https://mathscinet.ams.org/mathscinet/MRAuthorID/232211
http://elibrary.ru/author_items.asp?authorid=5322
http://www.researcherid.com/rid/Q-5132-2016
http://www.scopus.com/authid/detail.url?authorId=7401902682

Full list of publications:
| by years | by types | by times cited | by times cited in WoS | by times cited in Scopus | scientific publications | common list |



   2019
1. N. M Mezhennaya, V. G. Mikhailov, “O chisle edinits v vykhodnoi posledovatelnosti obobschennogo generatora Pola”, Diskretnaya matematika, 2019 (to appear)

   2018
2. V. G. Mikhailov, “On the reduction property of the number of $H$-equivalent tuples of states in a discrete Markov chain”, Discrete Math. Appl., 28:2 (2018), 75–82  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  scopus
3. V. G. Mikhailov, Diskr. Mat.  mathnet  crossref  mathscinet  elib

   2018
4. V. G. Mikhailov, “Controlled multinomial allocation scheme”, Mat. Vopr. Kriptogr., 9:1 (2018), 75–88  mathnet  crossref  mathscinet  elib
5. V. O. Mironkin, V. G. Mikhailov, “On the sets of images of $k$-fold iteration of uniform random mapping”, Mat. Vopr. Kriptogr., 9:3 (2018), 99–108  mathnet  crossref  elib
6. N. M Mezhennaya, V. G. Mikhailov, “Tsentralnaya predelnaya teorema dlya chisla edinits v neravnoveroyatnoi multitsiklicheskoi posledovatelnosti”, Obozrenie prikladnoi i promyshlennoi matematiki, 25:3 (2018), 259–260 (tezisy doklada na XIX Vserossiiskom simpoziume po prikladnoi i promyshlennoi matematike, 22 – 30 sentyabrya 2018 g., Sochi)
7. N. M Mezhennaya, V. G. Mikhailov, “O chisle edinits v vykhodnoi posledovatelnosti multitsiklicheskogo generatora, opredelyaemogo bulevoi funktsiei”, Trudy X mezhdunarodnoi konferentsii “Diskretnye modeli v teorii upravlyayuschikh sistem” (Moskva i Podmoskove 23 – 25 maya 2018 g.), eds. V. B. Alekseev, D. S. Romanov, B. R. Danilov, MAKS Press, Moskva, 2018, 195–198

   2017
8. V. G. Mikhailov, “The number of decomposition of random permutation into the product of two involutions with given cycle in one of multipliers”, Mat. Vopr. Kriptogr., 8:1 (2017), 80–94  mathnet  crossref  mathscinet  elib
9. V. G. Mikhailov, N. M. Mezhennaya, “On properties of the output sequence of the multi-cyclic generator over direct sum of residue groups modulo 2”, Diskr. Mat.  mathnet  crossref  mathscinet  elib

   2017
10. N. M. Mezhennaya, V. G. Mikhailov, Review of Applied and Industrial Mathematics, 24:3 (2017), 350–351  mathnet  mathscinet
11. V. G. Mikhailov, “On the probability of existence of substrings with the same structure in a random sequence”, Discrete Math. Appl., 27:6 (2017), 377–386  mathnet  crossref  crossref  mathscinet  isi (cited: 3)  elib  scopus (cited: 4)

   2016
12. V. G. Mikhailov, A. V. Volgin, “The stability of sets of solutions for systems of equations with random distortions”, Matem. vopr. kriptogr., 7:3 (2016), 61–72  mathnet  crossref  mathscinet  elib
13. N. M. Mezhennaya, V. G. Mikhailov, “On the asymptotic normality of frequencies of values in the non-equiprobable multi-cyclic random sequence modulo 4”, Mat. Vopr. Kriptogr., 7:4 (2016), 81–94  mathnet  crossref  mathscinet  elib
14. S. A. Aivazyan, V. B. Alekseev, V. A. Vatutin, M. M. Glukhov, A. A. Grusho, V. A. Emelichev, A. M. Zubkov, G. I. Ivchenko, O. M. Kasim-zade, V. A. Kashtanov, I. N. Kovalenko, V. B. Kudryavtsev, V. V. Mazalov, Yu. V. Matiyasevich, Yu. I. Medvedev, V. G. Mikhailov, Yu. L. Pavlov, B. A. Pogorelov, È. A. Primenko, L. Ya. Savel'ev, V. N. Sachkov, S. A. Stepanov, V. P. Chistyakov, V. N. Chubarikov, Diskr. Mat., 28:4 (2016), 3–5  mathnet  crossref  mathscinet  elib

   2015
15. V. A. Kopytcev, V. G. Mikhailov, “Explicit accuracy estimates for the Poisson approximation to the distribution of the number of solutions of random inclusions”, Mat. Vopr. Kriptogr., 6:1 (2015), 57–79  mathnet  crossref  mathscinet  elib

   2016
16. V. A. Kopyttsev, V. G. Mikhailov, “Estimates for distribution of the minimal distance of a random linear code”, Discrete Math. Appl., 26:4 (2016), 203–211  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib  scopus
17. Vladimir G. Mikhaylov, “Estimates of accuracy of the Poisson approximation for the distribution of number of runs of long string repetitions in a Markov chain”, Discrete Math. Appl., 26:2 (2016), 105–113  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 6)  elib  elib  scopus (cited: 6)

   2015
18. V. G. Mikhailov, A. M. Shoitov, “On multiple repetitions of long tuples in a Markov chain”, Mat. Vopr. Kriptogr., 6:3 (2015), 117–133  mathnet  crossref  mathscinet  elib
19. V. A. Kopyttsev, V. G. Mikhailov, “An estimate of the approximation accuracy in B. A. Sevastyanov's limit theorem and its application in the problem of random inclusions”, Discrete Math. Appl., 25:3 (2015), 149–156  mathnet  crossref  crossref  mathscinet  isi  elib  elib  scopus

   2014
20. V. A. Kopytcev, V. G. Mikhailov, “On an asymptotical property of spheres in the discrete spaces of large dimension”, Mat. Vopr. Kriptogr., 5:1 (2014), 73–83  mathnet  crossref  elib

   2015
21. V. G. Mikhailov, A. M. Shoitov, “On repetitions of long tuples in a Markov chain”, Discrete Math. Appl., 25:5 (2015), 295–303  mathnet  crossref  crossref  mathscinet  isi (cited: 5)  elib  scopus (cited: 5)

   2014
22. V. G. Mikhailov, “Poisson approximation for the distribution of the frequency of a given pattern in the outcome sequence of the MCV-generator”, Mat. Vopr. Kriptogr., 5:4 (2014), 63–71  mathnet  crossref  elib

   2015
23. N. M. Mezhennaya, V. G. Mikhailov, “On frequencies of elements in multicyclic random sequence modulo 4”, Discrete Math. Appl., 25:6 (2015), 359–365  mathnet  crossref  crossref  mathscinet  isi  elib  scopus

   2013
24. V. G. Mihailov, A. M. Shoitov, “On the numbers of equivalent tuples sets in a sequence of independent random variables”, Mat. Vopr. Kriptogr., 4:1 (2013), 77–86  mathnet  crossref  elib
25. V. G. Mikhailov, “Estimate for the Accuracy of the Poisson Approximation for the Number of Empty Cells in an Equiprobable Scheme for Group Allocation of Particles, and Applications”, Proc. Steklov Inst. Math., 282 (2013), 157–171  mathnet  crossref  crossref  mathscinet  isi (cited: 3)  elib (cited: 3)  elib (cited: 3)  scopus (cited: 3)
26. N. M. Mezhennaya, V. G. Mikhailov, “On the distribution of the number of ones in the output sequence of the MCV-generator over $GF(2)$”, Mat. Vopr. Kriptogr., 4:4 (2013), 95–107  mathnet  crossref  elib

   2012
27. V. A. Kopyttsev, V. G. Mikhailov, “Poisson-type limit theorems for the generalised linear inclusion”, Discrete Math. Appl., 22:4 (2012), 477–491  mathnet  crossref  crossref  mathscinet  zmath  elib (cited: 1)  elib (cited: 1)  scopus (cited: 1)
28. V. A. Kopytcev, V. G. Mikhailov, “Conditions of convergence to the Poisson distribution for the number of solutions of random inclusions”, Mat. Vopr. Kriptogr., 3:3 (2012), 35–55  mathnet  crossref  elib
29. N. M. Mezhennaya, V. G. Mikhailov, “Lower bounds for probabilities of embedding with arbitrary margin”, Herald of the Bauman Moscow State Technical University, Series Natural Sciences, 2012, no. 2, 3–11  mathnet  elib

   2011
30. V. A. Kopytcev, V. G. Mikhailov, “On the distribution of the numbers of solutions of random inclusions”, Mat. Vopr. Kriptogr., 2:2 (2011), 55–80  mathnet  crossref  elib
31. V. A. Kopyttsev, V. G. Mikhailov, “Ob odnom asimptoticheskom svoistve sfer v diskretnykh prostranstvakh bolshoi razmernosti”, Obozrenie prikladnoi i promyshlennoi matematiki, 18:4 (2011)
32. S. M. Buravlev, M. M. Glukhov, A. M. Zubkov, A. P. Kovalenko, A. S. Kuzmin, V. N. Latyshev, A. I. Markov, V. N. Markov, Yu. I. Medvedev, V. G. Mikhailov, A. V. Mikhalev, A. A. Nechaev, B. A. Pogorelov, Yu. V. Prokhorov, V. N. Sachkov, “V. L. Kurakin (13.05.1966 – 14.08.2010)”, Mat. Vopr. Kriptogr., 2:3 (2011), 111–112  mathnet  crossref

   2010
33. V. A. Kopyttsev, V. G. Mikhailov, “Poisson-type theorems for the number of special solutions of a random linear inclusion”, Discrete Math. Appl., 20:2 (2010), 191–211  mathnet  crossref  crossref  mathscinet  elib  scopus (cited: 3)
34. V. A. Kopyttsev, V. G. Mikhailov, “Poisson type theorems for the number of solutions of random inclusions”, Mat. Vopr. Kriptogr., 1:4 (2010), 63–84  mathnet  crossref  elib
35. V. G. Mikhailov, “On the limit behaviour of the number of solutions for compatible systems of equations with random selection of unknowns”, Mat. Vopr. Kriptogr., 1:3 (2010), 27–43  mathnet  crossref  elib
36. V. A. Kopyttsev, V. G. Mikhailov, “Issledovanie chisla reshenii sluchainykh nelineinykh sistem vklyuchenii putem svedeniya ikh k lineinym sistemam vklyuchenii”, Obozrenie prikladnoi i promyshlennoi matematiki, 17:3 (2010), 367–368
37. V. A. Kopyttsev, V. G. Mikhailov, “Predelnaya teorema dlya chisla nenulevykh reshenii sluchainogo vklyucheniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 17:3 (2010), 368–369
38. N. M. Mezhennaya, V. G. Mikhailov, “Odin podkhod k razlicheniyu gipotez v zadache o plotnom vlozhenii”, Obozrenie prikladnoi i promyshlennoi matematiki, 17:3 (2010)
39. N. M. Mezhennaya, V. G. Mikhailov, “Nizhnie otsenki dlya veroyatnosti vlozheniya s proizvolnym dopuskom”, Obozrenie prikladnoi i promyshlennoi matematiki, 17:4 (2010)

   2009
40. V. A. Kopyttsev, V. G. Mikhailov, “Nekotorye sledstviya iz teorem puassonovskogo tipa dlya chisla reshenii sluchainogo lineinogo vklyucheniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 16:5 (2009)

   2008
41. V. G. Mikhailov, “Reducing the problem on the limit behavior of the number of solutions for system of equations with random choice of unknowns to a problem on the allocation of particles”, Tr. Diskr. Mat., 11, no. 2, Fizmatlit, Moscow, 2008, 112–124  mathnet
42. V. G. Mikhailov, “Mnogomernye predelnye teoremy puassonovskogo tipa v zadachakh veroyatnostnoi kombinatoriki”, Obozrenie prikladnoi i promyshlennoi matematiki, 15:4 (2008), 752–753  elib
43. V. G. Mikhailov, “On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a random sequence”, Discrete Math. Appl., 18:6 (2008), 563–568  mathnet  crossref  crossref  mathscinet  zmath  elib  scopus (cited: 1)

   2009
44. V. G. Mikhailov, “A Poisson-Type Limit Theorem for the Number of Pairs of Matching Sequences”, Theory Probab. Appl., 53:1 (2009), 106–116  mathnet  crossref  crossref  mathscinet  zmath  isi  elib  elib  scopus

   2007
45. V. G. Mikhailov, “Limit theorems for the number of solutions of a system of random linear equations belonging to a given set”, Discrete Math. Appl., 17:1 (2007), 13–22  mathnet  crossref  crossref  mathscinet  zmath  elib  scopus (cited: 1)
46. V. G. Mihailov, “Formulae to Calculate Distributions of Lempel-Ziv Statistic and Relative Statistics”, OPPM Surveys in Applied and Industrial Mathematics, 14:3 (2007), 461–473
47. V. G. Mikhailov, “Sufficient Conditions for the Sum of a Given Number of Maximally Occupated Urns To Be Gaussian in Equiprobable Urn Scheme”, OPPM Surveys in Applied and Industrial Mathematics, 14:3 (2007), 449–460

   2006
48. V. G. Mikhailov, “On asymptotic properties of the number of runs of events”, Tr. Diskr. Mat., 9, Gelios APB, Moscow, 2006, 152–163  mathnet

   2007
49. V. G. Mikhailov, Theory Probab. Appl., 51:3 (2007), 555–557  mathnet  crossref  crossref  mathscinet  elib

   2005
50. V. G. Mikhailov, N. M. Mezhennaya, “Bounds for the probability of a dense embedding of one discrete sequence into another”, Discrete Math. Appl., 15:4 (2005), 377–386  mathnet  crossref  crossref  mathscinet  zmath  elib  scopus (cited: 1)

   2004
51. V. G. Mikhailov, “On the features of asymptotic behaviour for the number of structurally similar tuples pairs”, Tr. Diskr. Mat., 8, Fizmatlit, Moscow, 2004, 176–186  mathnet

   2003
52. V. G. Mikhailov, A. M. Shoitov, “Structural equivalence of $s$-tuples in random discrete sequences”, Discrete Math. Appl., 13:6 (2003), 541–568  mathnet  crossref  crossref  mathscinet  zmath  scopus (cited: 5)
53. V. G. Mikhailov, “Limit theorems for the number of points of a given set covered by a random linear subspace”, Discrete Math. Appl., 13:2 (2003), 179–188  mathnet  crossref  crossref  mathscinet  zmath  scopus (cited: 1)
54. V. G. Mikhailov, “Poissonian limit theorems for the number of $H$-connected tuples”, Tr. Diskr. Mat., 7, Fizmatlit, Moscow, 2003, 138–155  mathnet
55. V. G. Mikhailov, “On Sevast'yanov's limit theorems on the sum of dependent random indicators”, OPPM Surveys in Applied and Industrial Mathematics, 10:3 (2003), 571–578
56. V. G. Mikhailov, “Poisson-type limit theorems for the number of incomplete matches of $s$-patterns”, Theory Probab. Appl., 47:2 (2003), 343–351  mathnet  crossref  crossref  mathscinet  zmath  isi  elib (cited: 1)  scopus (cited: 2)

   2002
57. V. G. Mikhailov, “On the asymptotic properties of the distribution of the number of pairs of $H$-connected chains”, Discrete Math. Appl., 12:4 (2002), 393–400  mathnet  crossref  mathscinet  zmath  scopus (cited: 2)
58. V. G. Mikhailov, “Investigation of combinatorial-probabilistic model of a controlled shift registers automata”, Tr. Diskr. Mat., 6, Fizmatlit, Moscow, 2002, 139–149  mathnet
59. V. G. Mikhailov, “Investigation of the number of cyclic points in a controlled shift registers automaton”, Tr. Diskr. Mat., 5, Fizmatlit, Moscow, 2002, 167–172  mathnet
60. V. G. Mikhailov, “Estimate of the Accuracy of the Compound Poisson Approximation for the Distribution of the Number of Matching Patterns”, Theory Probab. Appl., 46:4 (2002), 667–675  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 4)  elib (cited: 2)  scopus (cited: 7)

   2001
61. V. G. Mikhailov, “The Poisson limit theorem for the number of noncollinear solutions of a system of random equations of a special form”, Discrete Math. Appl., 11:4 (2001), 391–400  mathnet  crossref  mathscinet  zmath  scopus (cited: 2)
62. V. G. Mikhailov, B. I. Selivanov, “On some statistics in a scheme of particles allocation in cells of a two-dimensional table”, Tr. Diskr. Mat., 4, Fizmatlit, Moscow, 2001, 169–176  mathnet
63. V. G. Mikhailov, “On a Poisson approximation in a problem of a union (intersection) of random sets”, Tr. Diskr. Mat., 4, Fizmatlit, Moscow, 2001, 161–168  mathnet

   2000
64. V. G. Mikhailov, “Limit theorems for the number of nonzero solutions of a system of random equations over the field $\mathrm{GF}(2)$”, Discrete Math. Appl., 10:2 (2000), 115–126  mathnet  crossref  mathscinet  zmath  scopus (cited: 2)
65. V. G. Mikhailov, “Inequalities for the mean number of $m$-tuples repetitions and for the mean number of unappeared $m$-tuples from a given class”, Tr. Diskr. Mat., 3, Fizmatlit, Moscow, 2000, 147–154  mathnet

   1998
66. V. G. Mikhailov, “Inequalities for the number of high-probability outcomes of a multinomial scheme”, Discrete Math. Appl., 8:2 (1998), 119–126  mathnet  crossref  crossref  mathscinet  zmath  scopus
67. V. G. Mikhailov, “Investigation of a Markov scheme for the allocation of particles to cells”, Tr. Diskr. Mat., 2, TVP, Moscow, 1998, 230–236  mathnet  mathscinet  zmath
68. A. M. Zubkov, V. G. Mikhailov, “Estimation of the minimum number of outcomes with a given total probability”, Tr. Diskr. Mat., 2, TVP, Moscow, 1998, 101–111  mathnet  mathscinet  zmath

   1999
69. V. G. Mikhailov, “Limit theorems for the number of nonzero solutions of a system of random equations over GF(2)”, Theory Probab. Appl., 43:3 (1999), 480–487  mathnet  crossref  crossref  mathscinet  zmath  isi (cited: 2)

   1997
70. V. G. Mikhailov, “Some inequalities for the distribution function of the number of nonappearing $s$-chains”, Tr. Diskr. Mat., 1, TVP, Moscow, 1997, 221–226  mathnet  mathscinet  zmath

   1998
71. V. G. Mikhailov, “On a Poisson approximation for the distribution of the number of empty cells in a nonhomogeneous allocation scheme”, Theory Probab. Appl., 42:1 (1998), 174–179  mathnet  crossref  crossref  mathscinet  zmath  isi

   1997
72. V. G. Mikhailov, “Limit theorems for a random covering of a finite setand for the number of solutions of a system of random equations”, Theory Probab. Appl., 41:2 (1997), 265–274  mathnet  crossref  crossref  mathscinet  zmath  isi  scopus (cited: 4)
73. V. A. Vatutin, V. G. Mikhailov, “Asymptotic properties of matrices related to mappings of partitions”, Theory Probab. Appl., 41:2 (1997), 318–325  mathnet  crossref  crossref  mathscinet  zmath  isi  scopus

   1996
74. V. A. Vatutin, V. G. Mikhailov, “On the number of readings of random nonequiprobable files under stable sorting”, Discrete Math. Appl., 6:3 (1996), 207–223  mathnet  crossref  mathscinet  zmath  scopus (cited: 1)
75. V. G. Mikhailov, “Accuracy estimates of compound Poisson approximation by Stein–Chen method”, OPPM Surveys in Applied and Industrial Mathematics, 3:4 (1996), 530–548

   1995
76. V. G. Mikhailov, “Repetition of states of a random-number generator under multiple access”, Theory Probab. Appl., 40:4 (1995), 679–689  mathnet  crossref  mathscinet  zmath  isi
77. V. A. Vatutin, V. G. Mikhailov, “Some estimates for the distribution of the height of a tree for digital searching”, Discrete Math. Appl., 5:4 (1995), 289–300  mathnet  mathscinet  zmath  scopus
78. V. G. Mikhailov, V. A. Vatutin, “Statistical estimation of the entropy of discrete random variables with a large number of outcomes”, Russian Math. Surveys, 50:5 (1995), 963–976  mathnet  crossref  mathscinet  zmath  adsnasa  isi (cited: 3)
79. V. G. Mikhailov, “On overlapping of paths in a graph of a generator of pseudorandom numbers”, OPPM Surveys in Applied and Industrial Mathematics, 2:6 (1995), 888–905
80. V. G. Mikhailov, “Studying a probabilistic model for the generator of pseudorandom numbers”, OPPM Surveys in Applied and Industrial Mathematics, 2:6 (1995), 906–925
81. V. G. Mikhailov, “Review of a book, Yu. V. Borovskikh, V. S. Korolyuk “Random Permanents””, Diskr. Mat., 7:3 (1995), 157–160  mathnet

   1994
82. V. G. Mikhailov, V. P. Chistyakov, “On finite automata theory problems concerned with the number of preimages for output sequence”, OPPM Surveys in Applied and Industrial Mathematics, 1:1 (1994), 7–32
83. V. G. Mikhailov, “On the number of preimages for an automation output sequence”, OPPM Surveys in Applied and Industrial Mathematics, 1:1 (1994), 118–121
84. V. G. Mikhailov, “A generalization of the theorem on the number of preimages for an automation output sequence”, OPPM Surveys in Applied and Industrial Mathematics, 1:1 (1994), 122–125
85. V. G. Mikhailov, “Asymptotic normality for the logarithm of the number of preimages for a finite automation output sequence”, OPPM Surveys in Applied and Industrial Mathematics, 1:1 (1994), 126–135
86. V. G. Mikhailov, “Explicit bounds in limit theorems for sums of random indicators”, OPPM Surveys in Applied and Industrial Mathematics, 1:4 (1994), 580–617
87. V. G. Mikhailov, “Some estimates of accuracy of a Poisson approximation for sums of dependent random indicators”, OPPM Surveys in Applied and Industrial Mathematics, 1:4 (1994), 618–637
88. V. G. Mikhailov, “Review of a book, A. D. Barbour, L. Holst, and S. Janson “Poisson Approximation””, Diskr. Mat., 6:3 (1994), 154–159  mathnet

   1993
89. V. G. Mikhailov, “On a refinement of the central limit theorem for sums of independent random indicators”, Theory Probab. Appl., 38:3 (1993), 479–489  mathnet  crossref  mathscinet  zmath  isi (cited: 6)
90. Mikhailov V. G., “Polynomial and polynomial-like allocations: recent developments”, Probabilistic methods in discrete mathematics (Petrozavodsk, 1992), Progr. Pure Appl. Discrete Math., 1, VSP, Utrecht, 1993, 40–59  mathscinet (cited: 1)

   1991
91. V. G. Mikhailov, “On a theorem of Janson”, Theory Probab. Appl., 36:1 (1991), 173–176  mathnet  crossref  mathscinet  zmath  isi (cited: 8)

   1992
92. E. E. D'yakonova, V. G. Mikhailov, “Sufficient conditions for asymptotic normality of decomposable statistics in an inhomogeneous allocation scheme”, Discrete Math. Appl., 2:3 (1992), 325–335  mathnet  mathscinet  zmath

   1991
93. V. G. Mikhailov, “Asymptotic normality of decomposable statistics from the frequencies of $m$-chains”, Discrete Math. Appl., 1:3 (1991), 335–347  mathnet  mathscinet  zmath

   1989
94. V. G. Mikhailov, “Asymptotic normality of symmetric decomposable statistics in an inhomogeneous scheme”, Diskr. Mat., 1:2 (1989), 15–27  mathnet  mathscinet  zmath

   1988
95. V. G. Mikhailov, “Asymptotic normality of $U$-statistics with nonnegative kernels”, Proc. Steklov Inst. Math., 177 (1988), 111–119  mathnet  mathscinet  zmath

   1983
96. V. A. Vatutin, V. G. Mihaǐlov, “Limit theorems for the number of empty cells in the equiprobable scheme of group disposal of particles”, Theory Probab. Appl., 27:4 (1983), 734–743  mathnet  crossref  mathscinet  zmath  isi (cited: 7)

   1984
97. V. G. Mikhailov, “Asymptotic normality in a scheme of finitely dependent distribution of particles in cells”, Math. USSR-Sb., 47:2 (1984), 499–512  mathnet  crossref  mathscinet  zmath

   1983
98. V. G. Mikhailov, “The central limit theorem for a scheme of independent allocation of particles by cells”, Proc. Steklov Inst. Math., 157 (1983), 147–163  mathnet  mathscinet  zmath

   1980
99. V. G. Mikhaǐlov, “Asymptotic normality of the number of empty cells for group placing of particles”, Theory Probab. Appl., 25:1 (1980), 82–90  mathnet  crossref  mathscinet  zmath  isi (cited: 5)

   1981
100. V. G. Mikhailov, “Convergence to the multidimensional normal law in an equiprobable scheme of distributing particles by groups”, Math. USSR-Sb., 39:2 (1981), 145–167  mathnet  crossref  mathscinet  zmath  isi (cited: 1)

   1979
101. A. M. Zubkov, V. G. Mihaǐlov, “On the repetitions of $s$-tuples in a sequence of independent trials”, Theory Probab. Appl., 24:2 (1979), 269–282  mathnet  crossref  mathscinet  zmath  isi (cited: 14)
102. A. M. Zubkov, V. G. Mihaǐlov, “On the accuracy of Poisson approximation in an occupancy problem”, Theory Probab. Appl., 23:4 (1979), 789–794  mathnet  crossref  mathscinet  zmath  isi (cited: 3)

   1978
103. V. G. Mihaǐlov, “An estimate of the rate of convergence to the Poisson distribution in group placing of particles”, Theory Probab. Appl., 22:3 (1978), 554–562  mathnet  crossref  mathscinet  zmath

   1977
104. V. G. Mihaǐlov, “A Poisson limit theorem in the scheme of group disposal of particles”, Theory Probab. Appl., 22:1 (1977), 152–156  mathnet  crossref  mathscinet  zmath

   1975
105. V. G. Mikhailov, “The central limit theorem for nonhomogeneous $U$-statistics of finitely dependent random variables”, Math. USSR-Sb., 27:4 (1975), 554–563  mathnet  crossref  mathscinet  zmath

   1976
106. V. G. Mikhailov, “The central limit theorem for the number of partial long duplications”, Theory Probab. Appl., 20:4 (1976), 862–866  mathnet  crossref  mathscinet  zmath

   1974
107. V. G. Mikhailov, “Convergence to a process with independent increments in a scheme of increasing sums of dependent random variables”, Math. USSR-Sb., 23:2 (1974), 271–286  mathnet  crossref  mathscinet  zmath

   1975
108. V. G. Mikhailov, “Asymptotic independence of components of multivariate extreme order statistics”, Theory Probab. Appl., 19:4 (1975), 817–821  mathnet  crossref  mathscinet  zmath
109. V. G. Mikhailov, “Convergence to the Poisson process in a scheme of cummulative sums of dependent random variables”, Theory Probab. Appl., 19:2 (1975), 403–407  mathnet  crossref  mathscinet  zmath

   1974
110. V. G. Mikhailov, “Limit distributions of random variables connected with multiple long duplications in a sequence lof independent trials”, Theory Probab. Appl., 19:1 (1974), 180–184  mathnet  crossref  mathscinet  zmath
111. A. M. Zubkov, V. G. Mikhailov, “Limit distributions of random variables connected with long duplications in a sequence of independent trials”, Theory Probab. Appl., 19:1 (1974), 172–179  mathnet  crossref  mathscinet  zmath

Presentations in Math-Net.Ru
1. Вероятностные свойства выходной последовательности генератора Пола
V. G. Mikhailov, N. M. Mezhennaya
Seminar of the Department of Discrete Mathematics, Steklov Mathematical Institute of RAS
February 26, 2013 16:00
2. Оценка точности пуассоновской аппроксимации для распределения числа пустых ячеек при размещении частиц комплектами
V. G. Mikhailov
Seminar of the Department of Discrete Mathematics, Steklov Mathematical Institute of RAS
October 16, 2012 16:00
3. Теоремы пуассоновского типа для числа решений случайного линейного включения, удовлетворяющих дополнительным условиям
V. A. Kopyttsev, V. G. Mikhailov
Seminar of the Department of Discrete Mathematics, Steklov Mathematical Institute of RAS
December 22, 2009 16:00
4. Предельные теоремы для числа решений системы случайных линейных уравнений, попавших в заданное множество
V. G. Mikhailov
Seminar of the Department of Discrete Mathematics, Steklov Mathematical Institute of RAS
December 27, 2005
5. Coincidences of segments in discrete random sequences
V. G. Mikhailov
Steklov Mathematical Institute Seminar
September 19, 2002

Organisations
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019