Home page
Home page
Home page
Russian page
English page
Math-Net.Ru | MMS | Web of Science | Scopus | MathSciNet | Zentralblatt MATH | Web-mail 

   
 About the Institute
 Staff publications
 Administration
 Academic Council
 Dissertation Councils
 Departments
Staff 
 Seminars
 Conferences
 Events
 Journals and Books
 In memoriam
 Photogallery
 Library


    Address
8 Gubkina St. Moscow,
119991, Russia
Tel.: +7(495) 984 81 41
Fax: +7(495) 984 81 39
Web site: www.mi.ras.ru
E-mail: steklov@mi.ras.ru

View Map
Directions

   
Mikhailov Vladimir Gavrilovich
(full list of publications)
| by years | scientific publications | by types |



   2017
1. 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  elib
2. N. M. Mezhennaya, V. G. Mikhailov, “O svoistvakh vykhodnoi posledovatelnosti multitsiklicheskogo generatora nad pryamoi summoi grupp vychetov po modulyu 2”, Diskret. matem., 29:3 (2017), 45–53  mathnet  crossref  elib [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.]

   2016
3. V. G. Mikhailov, Diskr. Mat., 28:3 (2016), 97–110  mathnet  crossref  mathscinet  elib
4. 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  mathscinet  elib
5. 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  mathscinet  elib

   2015
6. 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  mathscinet  elib
7. V. A. Kopyttsev, V. G. Mikhailov, “Otsenki dlya raspredeleniya minimalnogo rasstoyaniya sluchainogo lineinogo koda”, Diskret. matem., 27:2 (2015), 45–55  mathnet  crossref  mathscinet  zmath  elib; 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  crossref  mathscinet  zmath  isi  elib  scopus
8. V. G. Mikhailov, “Otsenki tochnosti puassonovskoi approksimatsii dlya raspredeleniyachisla serii povtorenii dlinnykh tsepochekv tsepi Markova”, Diskret. matem., 27:4 (2015), 67–78  mathnet (cited: 4)  crossref  mathscinet  zmath  elib; 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  crossref  mathscinet  zmath  isi  elib  scopus (cited: 1)
9. 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  mathscinet  elib

   2014
10. V. A. Kopyttsev, V. G. Mikhailov, “Otsenka tochnosti approksimatsiiv predelnoi teoreme B. A. Sevastyanova i ee primenenie v zadache o sluchainykh vklyucheniyakh”, Diskret. matem., 26:1 (2014), 75–84  mathnet  crossref  mathscinet  elib; 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  crossref  mathscinet  isi  elib  scopus
11. 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  elib
12. V. G. Mikhailov, A. M. Shoitov, “O dlinnykh povtoreniyakh tsepochek v tsepi Markova”, Diskret. matem., 26:3 (2014), 79–89  mathnet (cited: 5)  crossref  mathscinet  elib; V. G. Mikhailov, A. M. Shoitov, “On repetitions of long tuples in a Markov chain”, Discrete Math. Appl., 25:5 (2015), 295–303  crossref  mathscinet  isi (cited: 1)  scopus (cited: 3)
13. 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  elib
14. N. M. Mezhennaya, V. G. Mikhailov, “O chisle poyavlenii znakov v multitsiklicheskoi sluchainoi posledovatelnosti po modulyu 4”, Diskret. matem., 26:4 (2014), 51–58  mathnet (cited: 2)  crossref  mathscinet  elib (cited: 1); N. M. Mezhennaya, V. G. Mikhailov, “On frequencies of elements in multicyclic random sequence modulo 4”, Discrete Math. Appl., 25:6 (2015), 359–365  crossref  mathscinet  isi  scopus

   2013
15. 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  elib
16. 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: 2)  elib (cited: 3)  elib (cited: 3)  scopus (cited: 3)
17. 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  elib

   2012
18. 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)
19. 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  elib
20. 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
21. 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  elib
22. V. A. Kopyttsev, V. G. Mikhailov, “Ob odnom asimptoticheskom svoistve sfer v diskretnykh prostranstvakh bolshoi razmernosti”, Obozrenie prikladnoi i promyshlennoi matematiki, 18:4 (2011)

   2010
23. 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)
24. 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  elib
25. 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  elib
26. 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
27. V. A. Kopyttsev, V. G. Mikhailov, “Predelnaya teorema dlya chisla nenulevykh reshenii sluchainogo vklyucheniya”, Obozrenie prikladnoi i promyshlennoi matematiki, 17:3 (2010), 368–369
28. N. M. Mezhennaya, V. G. Mikhailov, “Odin podkhod k razlicheniyu gipotez v zadache o plotnom vlozhenii”, Obozrenie prikladnoi i promyshlennoi matematiki, 17:3 (2010)
29. N. M. Mezhennaya, V. G. Mikhailov, “Nizhnie otsenki dlya veroyatnosti vlozheniya s proizvolnym dopuskom”, Obozrenie prikladnoi i promyshlennoi matematiki, 17:4 (2010)

   2009
30. 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
31. 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
32. V. G. Mikhailov, “Mnogomernye predelnye teoremy puassonovskogo tipa v zadachakh veroyatnostnoi kombinatoriki”, Obozrenie prikladnoi i promyshlennoi matematiki, 15:4 (2008), 752–753  elib
33. 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
34. V. G. Mikhailov, “Predelnaya teorema puassonovskogo tipa dlya chisla par pochti polnostyu sovpavshikh tsepochek”, TVP, 53:1 (2008), 59–71  mathnet  crossref  mathscinet  zmath  elib; V. G. Mikhailov, “A Poisson-Type Limit Theorem for the Number of Pairs of Matching Sequences”, Theory Probab. Appl., 53:1 (2009), 106–116  crossref  mathscinet  zmath  isi  elib  scopus

   2007
35. 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)
36. 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
37. 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
38. V. G. Mikhailov, “On asymptotic properties of the number of runs of events”, Tr. Diskr. Mat., 9, Gelios APB, Moscow, 2006, 152–163  mathnet

   2005
39. 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
40. 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
41. 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: 3)
42. 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)
43. V. G. Mikhailov, “Poissonian limit theorems for the number of $H$-connected tuples”, Tr. Diskr. Mat., 7, Fizmatlit, Moscow, 2003, 138–155  mathnet
44. 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

   2002
45. V. G. Mikhailov, “Predelnye teoremy puassonovskogo tipa dlya chisla nepolnykh sovpadenii $s$-tsepochek”, TVP, 47:2 (2002), 350–357  mathnet (cited: 2)  crossref  mathscinet (cited: 1)  zmath; V. G. Mikhailov, “Poisson-type limit theorems for the number of incomplete matches of $s$-patterns”, Theory Probab. Appl., 47:2 (2003), 343–351  crossref  mathscinet  zmath  isi  elib (cited: 1)  scopus (cited: 1)
46. 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)
47. V. G. Mikhailov, “Investigation of combinatorial-probabilistic model of a controlled shift registers automata”, Tr. Diskr. Mat., 6, Fizmatlit, Moscow, 2002, 139–149  mathnet
48. 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

   2001
49. V. G. Mikhailov, “Otsenka tochnosti slozhnoi puassonovskoi approksimatsii dlya raspredeleniya chisla sovpadayuschikh tsepochek”, TVP, 46:4 (2001), 713–723  mathnet (cited: 6)  crossref  mathscinet (cited: 1)  zmath; 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  crossref  mathscinet  zmath  isi (cited: 1)  elib (cited: 2)  scopus (cited: 5)
50. 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)
51. 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
52. 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
53. 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: 1)
54. 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
55. 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
56. 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
57. 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
58. V. G. Mikhailov, “Predelnye teoremy dlya chisla nenulevykh reshenii odnoi sistemy sluchainykh uravnenii nad polem GF(2)”, TVP, 43:3 (1998), 598–606  mathnet (cited: 5)  crossref  mathscinet (cited: 1)  zmath; 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  crossref  mathscinet  zmath  isi

   1997
59. 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
60. V. G. Mikhailov, “O puassonovskoi approksimatsii dlya raspredeleniya chisla pustykh yacheek v neodnorodnoi skheme razmescheniya”, TVP, 42:1 (1997), 184–189  mathnet (cited: 2)  crossref  mathscinet (cited: 1)  zmath; 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  crossref  mathscinet  zmath  isi

   1996
61. V. G. Mikhailov, “Predelnye teoremy dlya sluchainogo pokrytiya konechnogo mnozhestva i dlya chisla reshenii sistemy sluchainykh uravnenii”, TVP, 41:2 (1996), 272–283  mathnet (cited: 3)  crossref  mathscinet  zmath; 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  crossref  mathscinet  zmath  isi  scopus (cited: 3)
62. V. A. Vatutin, V. G. Mikhailov, “Asimptoticheskie svoistva matrits, svyazannykh s otobrazheniyami razbienii”, TVP, 41:2 (1996), 241–250  mathnet  crossref  mathscinet  zmath; V. A. Vatutin, V. G. Mikhailov, “Asymptotic properties of matrices related to mappings of partitions”, Theory Probab. Appl., 41:2 (1997), 318–325  crossref  mathscinet  zmath  isi  scopus
63. 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
64. 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
65. 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
66. 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
67. 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: 2)
68. 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
69. 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

   1994
70. 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
71. 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
72. 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
73. 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
74. 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
75. 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

   1993
76. 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: 4)
77. 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
78. V. G. Mikhailov, “On a theorem of Janson”, Theory Probab. Appl., 36:1 (1991), 173–176  mathnet  crossref  mathscinet  zmath  isi (cited: 3)
79. E. E. Dyakonova, V. G. Mikhailov, “O dostatochnykh usloviyakh asimptoticheskoi normalnosti razdelimykh statistik v neodnorodnoi skheme razmescheniya”, Diskret. matem., 3:1 (1991), 145–154  mathnet  mathscinet (cited: 1)  zmath; 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  mathscinet  zmath

   1989
80. V. G. Mikhailov, “Asimptoticheskaya normalnost razdelimykh statistik ot chastot $m$-tsepochek”, Diskret. matem., 1:4 (1989), 92–103  mathnet (cited: 7)  mathscinet (cited: 1)  zmath; V. G. Mikhailov, “Asymptotic normality of decomposable statistics from the frequencies of $m$-chains”, Discrete Math. Appl., 1:3 (1991), 335–347  mathscinet  zmath
81. V. G. Mikhailov, “Asymptotic normality of symmetric decomposable statistics in an inhomogeneous scheme”, Diskr. Mat., 1:2 (1989), 15–27  mathnet  mathscinet  zmath

   1986
82. V. G. Mikhailov, “Ob asimptoticheskoi normalnosti $U$-statistik s neotritsatelnymi yadrami”, Veroyatnostnye zadachi diskretnoi matematiki, Sbornik rabot, Tr. MIAN SSSR, 177, 1986, 105–113  mathnet  mathscinet  zmath; V. G. Mikhailov, “Asymptotic normality of $U$-statistics with nonnegative kernels”, Proc. Steklov Inst. Math., 177 (1988), 111–119  mathscinet  zmath

   1982
83. V. A. Vatutin, V. G. Mikhailov, “Predelnye teoremy dlya chisla pustykh yacheek v ravnoveroyatnoi skheme razmescheniya chastits komplektami”, TVP, 27:4 (1982), 684–692  mathnet (cited: 6)  mathscinet (cited: 16)  zmath; 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  crossref  mathscinet  zmath  isi (cited: 2)
84. V. G. Mikhailov, “Asimptoticheskaya normalnost v skheme konechno-zavisimogo razmescheniya chastits po yacheikam”, Matem. sb., 119(161):4(12) (1982), 509–520  mathnet (cited: 7)  mathscinet  zmath; V. G. Mikhailov, “Asymptotic normality in a scheme of finitely dependent distribution of particles in cells”, Math. USSR-Sb., 47:2 (1984), 499–512  crossref  mathscinet  zmath

   1981
85. V. G. Mikhailov, “Tsentralnaya predelnaya teorema dlya skhemy nezavisimogo razmescheniya chastits po yacheikam”, Teoriya chisel, matematicheskii analiz i ikh prilozheniya, Sbornik statei. Posvyaschaetsya akademiku Ivanu Matveevichu Vinogradovu k ego k ego devyanostoletiyu, Tr. MIAN SSSR, 157, 1981, 138–152  mathnet (cited: 4)  mathscinet (cited: 5)  zmath; 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  mathscinet  zmath

   1980
86. 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)
87. V. G. Mikhailov, “Skhodimost k mnogomernomu normalnomu zakonu v ravnoveroyatnoi skheme razmescheniya chastits komplektami”, Matem. sb., 111(153):2 (1980), 163–186  mathnet (cited: 5)  mathscinet  zmath; 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  crossref  mathscinet  zmath  isi

   1979
88. 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: 11)

   1978
89. A. M. Zubkov, V. G. Mikhailov, “Otsenka tochnosti puassonovskoi approksimatsii v zadache o razmeschenii chastits po yacheikam”, TVP, 23:4 (1978), 819–824  mathnet (cited: 2)  mathscinet  zmath; 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  crossref  mathscinet  zmath  isi (cited: 2)

   1977
90. V. G. Mikhailov, “Otsenka skorosti skhodimosti k raspredeleniyu Puassona pri razmeschenii chastits komplektami”, TVP, 22:3 (1977), 566–574  mathnet (cited: 2)  mathscinet (cited: 1)  zmath; 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  crossref  mathscinet  zmath
91. 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
92. 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
93. V. G. Mikhailov, “Tsentralnaya predelnaya teorema dlya chisla nepolnykh dannykh povtorenii”, TVP, 20:4 (1975), 880–884  mathnet (cited: 4)  mathscinet  zmath; V. G. Mikhailov, “The central limit theorem for the number of partial long duplications”, Theory Probab. Appl., 20:4 (1976), 862–866  crossref  mathscinet  zmath

   1974
94. 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
95. V. G. Mikhailov, “Asimptoticheskaya nezavisimost komponent vektora krainikh chlenov mnogomernogo variatsionnogo ryada”, TVP, 19:4 (1974), 849–853  mathnet (cited: 1)  mathscinet (cited: 1)  zmath; V. G. Mikhailov, “Asymptotic independence of components of multivariate extreme order statistics”, Theory Probab. Appl., 19:4 (1975), 817–821  crossref  mathscinet  zmath
96. V. G. Mikhailov, “Skhodimost k puassonovskomu protsessu v skheme narastayuschikh summ zavisimykh sluchainykh velichin”, TVP, 19:2 (1974), 422–426  mathnet  mathscinet  zmath; 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  crossref  mathscinet  zmath
97. 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
98. 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
Home page

© Steklov Mathematical Institute of RAS, 2004–2017