Persons
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
 
Darkhovsky, Boris Semenovich
Statistics Math-Net.Ru
Total publications: 49
Scientific articles: 49
Presentations: 6

Number of views:
This page:1624
Abstract pages:12061
Full texts:5343
References:858
Main Scientist Researcher
Doctor of physico-mathematical sciences
E-mail:

https://www.mathnet.ru/eng/person33612
List of publications on Google Scholar
https://zbmath.org/authors/?q=ai:darkhovskii.b-s
https://mathscinet.ams.org/mathscinet/MRAuthorID/205485
https://elibrary.ru/author_items.asp?authorid=4454
https://www.scopus.com/authid/detail.url?authorId=6603906205

Publications in Math-Net.Ru Citations
2023
1. Yu. A. Dubnov, A. Yu. Popkov, B. S. Darkhovsky, “Estimating the Hölder exponents based on the $\epsilon$-complexity of continuous functions: an experimental analysis of the algorithm”, Avtomat. i Telemekh., 2023, no. 4,  19–34  mathnet; Autom. Remote Control, 84:4 (2023), 377–388
2022
2. B. S. Darkhovsky, “Estimate of the Hölder Exponent Based on the $\epsilon$-Complexity of Continuous Functions”, Mat. Zametki, 111:4 (2022),  620–623  mathnet; Math. Notes, 111:4 (2022), 628–631  scopus 2
2020
3. B. S. Darkhovsky, “Methods for estimating the global maximum point and the integral of a continuous function on a compact set”, Dokl. RAN. Math. Inf. Proc. Upr., 492 (2020),  20–23  mathnet  zmath  elib; Dokl. Math., 101:3 (2020), 189–191
4. B. S. Darkhovsky, “On the complexity and dimension of continuous finite-dimensional maps”, Teor. Veroyatnost. i Primenen., 65:3 (2020),  479–497  mathnet  elib; Theory Probab. Appl., 65:3 (2020), 375–387  isi  scopus 6
2018
5. B. S. Darkhovsky, Yu. S. Popkov, A. Yu. Popkov, A. S. Aliev, “A method of generating random vectors with a given probability density function”, Avtomat. i Telemekh., 2018, no. 9,  31–45  mathnet  elib; Autom. Remote Control, 79:9 (2018), 1569–1581  isi  scopus 4
2017
6. A. Yu. Popkov, B. S. Darkhovsky, Yu. S. Popkov, “Iterative MC-algorithm to solve the global optimization problems”, Avtomat. i Telemekh., 2017, no. 2,  82–98  mathnet  elib; Autom. Remote Control, 78:2 (2017), 261–275  isi  scopus 2
2015
7. B. S. Darkhovskii, Yu. S. Popkov, A. Yu. Popkov, “Monte Carlo method of batch iterations: probabilistic characteristics”, Avtomat. i Telemekh., 2015, no. 5,  60–71  mathnet  elib; Autom. Remote Control, 76:5 (2015), 776–785  isi  elib  scopus 7
8. Y. S. Popkov, A. Y. Popkov, B. S. Darkhovskiy, “Parallel Monte Carlo for entropy-robust estimation”, Matem. Mod., 27:6 (2015),  14–32  mathnet  mathscinet  elib; Math. Models Comput. Simul., 8:1 (2016), 27–39  scopus 5
2014
9. B. S. Darkhovskii, A. Yu. Popkov, Yu. S. Popkov, “Method of Monte Carlo batch iteration to solving by global optimization problems”, Informatsionnye Tekhnologii i Vychslitel'nye Sistemy, 2014, no. 3,  39–52  mathnet
10. B. S. Darhovsky, A. Piryatinska, “New approach to the segmentation problem for time series of arbitrary nature”, Trudy Mat. Inst. Steklova, 287 (2014),  61–74  mathnet  elib; Proc. Steklov Inst. Math., 287:1 (2014), 54–67  isi  elib  scopus 17
2013
11. B. S. Darhovsky, “Change-point detection in random sequence under minimal prior information”, Teor. Veroyatnost. i Primenen., 58:3 (2013),  585–590  mathnet  mathscinet  elib; Theory Probab. Appl., 58:3 (2014), 488–493  isi  elib
2011
12. B. S. Darhovsky, “Uncertain change-point problem for random sequence”, Teor. Veroyatnost. i Primenen., 56:1 (2011),  30–46  mathnet  mathscinet  zmath  elib; Theory Probab. Appl., 56:1 (2012), 44–56  isi  elib  scopus
2008
13. B. S. Darhovsky, “Stochastic Recovery Problem”, Probl. Peredachi Inf., 44:4 (2008),  20–32  mathnet  mathscinet  zmath; Problems Inform. Transmission, 44:4 (2008), 303–314  isi  scopus 4
14. B. E. Brodskii, B. S. Darhovsky, “Minimax Sequential Tests for Many Composite Hypotheses. II”, Teor. Veroyatnost. i Primenen., 53:1 (2008),  3–15  mathnet  mathscinet  zmath; Theory Probab. Appl., 53:1 (2009), 1–12  isi  scopus
2007
15. B. E. Brodskii, B. S. Darhovsky, “Minimax Sequential Tests for Many Composite Hypotheses. I”, Teor. Veroyatnost. i Primenen., 52:4 (2007),  625–643  mathnet  mathscinet  zmath; Theory Probab. Appl., 52:4 (2008), 565–579  isi  scopus 4
2006
16. B. S. Darhovsky, “Sequential testing of two composite statistical hypotheses”, Avtomat. i Telemekh., 2006, no. 9,  142–157  mathnet  mathscinet  zmath; Autom. Remote Control, 67:9 (2006), 1485–1499  scopus 1
2004
17. B. S. Darhovsky, “A new approach to the stochastic recovery problem”, Teor. Veroyatnost. i Primenen., 49:1 (2004),  36–53  mathnet  mathscinet  zmath; Theory Probab. Appl., 49:1 (2005), 51–64  isi 5
2002
18. B. S. Darhovsky, A. Ya. Kaplan, S. L. Shishkin, “On an Approach to the Estimation of the Complexity of Curves (Using as an Example an Electroencephalogram of a Human Being)”, Avtomat. i Telemekh., 2002, no. 3,  134–140  mathnet  zmath; Autom. Remote Control, 63:3 (2002), 468–474  isi  scopus 8
19. B. S. Darhovsky, M. Staroswiecki, “The hypotheses testing problem under unknown parameter”, Teor. Veroyatnost. i Primenen., 47:4 (2002),  654–671  mathnet  mathscinet  zmath; Theory Probab. Appl., 47:4 (2003), 609–622  isi
2000
20. B. S. Darhovskiĭ, “On an approach to the stochastic recovery problem”, Avtomat. i Telemekh., 2000, no. 9,  43–52  mathnet  mathscinet  zmath; Autom. Remote Control, 61:9 (2000), 1451–1458
1999
21. B. E. Brodskii, B. S. Darhovsky, “Problems and methods of probabilistic diagnostics”, Avtomat. i Telemekh., 1999, no. 8,  3–50  mathnet  mathscinet  zmath; Autom. Remote Control, 60:8 (1999), 1061–1096  isi 5
1998
22. B. S. Darhovskiĭ, “A method for the retrospective estimation of the change points of linear regression coefficients”, Avtomat. i Telemekh., 1998, no. 8,  185–189  mathnet  mathscinet  zmath; Autom. Remote Control, 59:8 (1998), 1201–1204 1
23. B. E. Brodskii, B. S. Darhovsky, A. Ya. Kaplan, S. L. Shishkin, “Nonparametric segmentation of the electrical signals of the brain”, Avtomat. i Telemekh., 1998, no. 2,  23–32  mathnet  zmath; Autom. Remote Control, 59:2 (1998), 172–179  scopus 2
24. B. S. Darhovsky, “On a stochastic renewal problem”, Teor. Veroyatnost. i Primenen., 43:2 (1998),  357–364  mathnet  mathscinet  zmath; Theory Probab. Appl., 43:2 (1999), 282–288  isi 10
1997
25. B. S. Darkhovskii, “Local-Optimal Vibrational Stabilization of Nonlinear Dynamic Systems”, Avtomat. i Telemekh., 1997, no. 7,  122–131  mathnet  mathscinet  zmath; Autom. Remote Control, 58:7 (1997), 1165–1172
26. B. S. Darkhovskii, “Local-Optimal Stabilization under Incomplete Information”, Avtomat. i Telemekh., 1997, no. 4,  144–154  mathnet  mathscinet  zmath; Autom. Remote Control, 58:4 (1997), 636–644
1995
27. B. S. Darhovsky, “Retrospective detection of the change-point in some models of regression type”, Teor. Veroyatnost. i Primenen., 40:4 (1995),  898–903  mathnet  mathscinet  zmath; Theory Probab. Appl., 40:4 (1995), 748–753  isi 16
1993
28. R. G. Gleĭzer, B. S. Darhovskiĭ, “A method for the stabilization of polystationary dynamical systems”, Avtomat. i Telemekh., 1993, no. 6,  76–84  mathnet  mathscinet  zmath; Autom. Remote Control, 54:6 (1993), 932–938
29. B. E. Brodskiĭ, B. S. Darhovskĭ, “An algorithm for a posteriori detection of multiple change points in a random sequence”, Avtomat. i Telemekh., 1993, no. 1,  62–67  mathnet  mathscinet  zmath; Autom. Remote Control, 54:1 (1993), 54–59 3
1992
30. R. G. Gleĭzer, B. S. Darhovskiĭ, “Estimation of parameters that linearly enter differential equations”, Avtomat. i Telemekh., 1992, no. 10,  184–187  mathnet  mathscinet  zmath; Autom. Remote Control, 53:10 (1992), 1642–1645
1990
31. B. S. Darhovsky, G. G. Magaril-Il'yaev, “On the synthesis of stabilization systems”, Avtomat. i Telemekh., 1990, no. 12,  66–74  mathnet  mathscinet  zmath; Autom. Remote Control, 51:12 (1990), 1658–1665
32. R. G. Gleizer, B. S. Darhovsky, “Locally optimal control of a class of chemical reactors”, Avtomat. i Telemekh., 1990, no. 5,  176–185  mathnet  mathscinet; Autom. Remote Control, 51:5 (1990), 717–724
33. B. E. Brodskiĭ, B. S. Darkhovskiĭ, “Comparative analysis of some nonparametric methods for fast detection of the change point of a random sequence”, Teor. Veroyatnost. i Primenen., 35:4 (1990),  655–668  mathnet  mathscinet  zmath; Theory Probab. Appl., 35:4 (1990), 639–652  isi 23
34. B. E. Brodskiĭ, B. S. Darkhovskiĭ, “Asymptotic analysis of some estimators in the a posteriori change-point problem”, Teor. Veroyatnost. i Primenen., 35:3 (1990),  551–557  mathnet  mathscinet  zmath; Theory Probab. Appl., 35:3 (1990), 550–556  isi 5
1989
35. B. E. Brodskii, B. S. Darhovsky, “A nonparametric method for detection of switching times for two random sequences”, Avtomat. i Telemekh., 1989, no. 10,  66–75  mathnet  mathscinet  zmath; Autom. Remote Control, 50:10 (1989), 1356–1363 2
1988
36. B. S. Darhovsky, “On crudeness conditions of a locally optimal stabilization system”, Avtomat. i Telemekh., 1988, no. 5,  41–51  mathnet  mathscinet  zmath; Autom. Remote Control, 49:5 (1988), 580–588
1987
37. B. S. Darkhovskii, B. E. Brodskii, “Non-Parametrical Procedure for the Fast Detection of a Change in Mean of a Random Sequence”, Teor. Veroyatnost. i Primenen., 32:4 (1987),  703–711  mathnet  mathscinet  zmath; Theory Probab. Appl., 32:4 (1987), 640–648  isi 11
1985
38. B. S. Darhovskiĭ, E. S. Levitin, “Quadratic optimality conditions for problems of semi-infinite mathematical programming”, Tr. Mosk. Mat. Obs., 48 (1985),  163–210  mathnet  mathscinet  zmath
39. B. S. Darhovskiĭ, “A nonparametric method of estimation of homogeneity intervals of a random sequence”, Teor. Veroyatnost. i Primenen., 30:4 (1985),  795–799  mathnet  mathscinet  zmath; Theory Probab. Appl., 30:4 (1986), 845–849  isi 20
1984
40. B. S. Darhovsky, G. G. Magaril-Il'yaev, “A local-optimization method for control of dynamic systems”, Dokl. Akad. Nauk SSSR, 274:2 (1984),  273–275  mathnet  mathscinet  zmath
41. B. S. Darhovskii, “On two problems of estimation of the times of change of probability characteristics of a random sequence”, Teor. Veroyatnost. i Primenen., 29:3 (1984),  464–473  mathnet  mathscinet  zmath; Theory Probab. Appl., 29:3 (1985), 478–487  isi 22
1983
42. B. E. Brodskii, B. S. Darhovsky, “On the fastest detection of the time when the probabilistic characteristics of a random sequence change”, Avtomat. i Telemekh., 1983, no. 10,  101–108  mathnet  mathscinet  zmath; Autom. Remote Control, 44:10 (1983), 1324–1330 1
1980
43. B. S. Darhovsky, A. K. Kagramanov, G. P. Sushkova, D. S. Shapovalov, “Forecasting deliveries tо a plant”, Avtomat. i Telemekh., 1980, no. 4,  159–164  mathnet
44. B. S. Darkhovsky, E. S. Levitin, “Second-order optimality conditions for a class of nonsmooth problems of mathematical programming”, Sibirsk. Mat. Zh., 21:2 (1980),  79–97  mathnet  mathscinet  zmath; Siberian Math. J., 21:2 (1980), 205–219  isi
45. B. S. Darhovskiĭ, B. E. Brodskiĭ, “A posteriori detection of the «disorder» time for a random sequence”, Teor. Veroyatnost. i Primenen., 25:3 (1980),  635–639  mathnet  mathscinet  zmath; Theory Probab. Appl., 25:3 (1981), 624–628  isi 13
1979
46. B. S. Darhovsky, E. S. Levitin, “Quadratic optimality conditions for a class of nonsmooth problems of mathematical programming”, Dokl. Akad. Nauk SSSR, 244:2 (1979),  270–273  mathnet  mathscinet
1978
47. B. S. Darhovsky, “Error estimation for linearization”, Differ. Uravn., 14:7 (1978),  1313–1316  mathnet  mathscinet  zmath 2
1976
48. B. S. Darhovskiĭ, “A non-parametric method for a posteriori detection of the «disorder» time for a sequence of independent random variables”, Teor. Veroyatnost. i Primenen., 21:1 (1976),  180–184  mathnet  mathscinet  zmath; Theory Probab. Appl., 21:1 (1976), 178–183 43
1973
49. B. S. Darhovsky, E. S. Levitin, “The differential properties of the minimax in a certain problem of allocation of resources”, Zh. Vychisl. Mat. Mat. Fiz., 13:5 (1973),  1219–1227  mathnet  mathscinet  zmath; U.S.S.R. Comput. Math. Math. Phys., 13:5 (1973), 146–157 1

Presentations in Math-Net.Ru
1. About complexity and dimension of continuous finite-dimensional maps
B. S. Darhovsky
Principle Seminar of the Department of Probability Theory, Moscow State University
October 24, 2018 16:45
2. The $\epsilon$-complexity of continuous maps and some its Applications
B. S. Darhovsky
Workshop A. Novikov-70 «Stochastic Methods in Finance and Statistics»
December 28, 2015 12:00   
3. Эпсилон-сложность непрерывных функций и её применения
B. S. Darhovsky, A. Piryatinska
Colloquium of the Faculty of Computer Science
February 5, 2015 16:40   
4. Эпсилон-сложность непрерывных функций и новая методология сегментации временных рядов произвольной природы
B. S. Darhovsky
PreMoLab Seminar
November 19, 2014 17:00
5. The epsilon-complexity of continuous functions and novel methodology of time series segmentation
B. S. Darhovsky, A. Piryatinska
Principle Seminar of the Department of Probability Theory, Moscow State University
October 22, 2014 16:45
6. О различении сложных гипотез
B. S. Darkhovsky
Seminar of the Department of Probability Theory "Stochastic Analysis: Theory and Applications", Steklov Mathematical Institute of RAS
November 23, 2006

Organisations
 
  Contact us:
  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024