default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBoris S. Darkhovsky
Person information
- affiliation: Russian Academy of Sciences, Moscow, Russia
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j10]Yu. A. Dubnov, Alexey Y. Popkov, Boris S. Darkhovsky:
Estimating the Hölder Exponents Based on the ε-Complexity of Continuous Functions: An Experimental Analysis of the Algorithm. Autom. Remote. Control. 84(4): 337-347 (2023)- 2022
- [j9]Boris S. Darkhovsky, Alexandra Piryatinska:
Model-free classification of panel data via the ϵ-complexity theory. Commun. Stat. Simul. Comput. 51(7): 4073-4086 (2022) - 2021
- [j8]Alexandra Piryatinska, Boris S. Darkhovsky
:
Retrospective Change-Points Detection for Multidimensional Time Series of Arbitrary Nature: Model-Free Technology Based on the ϵ-Complexity Theory. Entropy 23(12): 1626 (2021)
2010 – 2019
- 2018
- [j7]Boris S. Darkhovsky, Yuri S. Popkov, Alexey Yu. Popkov, A. S. Aliev:
A Method of Generating Random Vectors with a Given Probability Density Function. Autom. Remote. Control. 79(9): 1569-1581 (2018) - 2017
- [j6]Alexey Yu. Popkov, Boris S. Darkhovsky, Yuri S. Popkov:
Iterative MC-algorithm to solve the global optimization problems. Autom. Remote. Control. 78(2): 261-275 (2017) - [j5]Alexandra Piryatinska, Boris S. Darkhovsky, Alexander Ya. Kaplan:
Binary classification of multichannel-EEG records based on the ϵ-complexity of continuous vector functions. Comput. Methods Programs Biomed. 152: 131-139 (2017) - 2015
- [j4]Boris S. Darkhovskiy, Yuri S. Popkov, Alexey Yu. Popkov:
Monte Carlo method of batch iterations: Probabilistic characteristics. Autom. Remote. Control. 76(5): 776-785 (2015) - 2013
- [i1]Boris S. Darkhovsky, Alexandra Piryatinska:
Epsilon-complexity of continuous functions. CoRR abs/1303.1777 (2013) - 2012
- [j3]Boris S. Darkhovskiy:
Non Asymptotic Minimax Estimation of Functionals with Noisy Observations. Commun. Stat. Simul. Comput. 41(6): 787-803 (2012)
2000 – 2009
- 2008
- [j2]Boris S. Darkhovsky:
Stochastic recovery problem. Probl. Inf. Transm. 44(4): 303-314 (2008) - 2005
- [j1]Alexander Ya. Kaplan, Andrew A. Fingelkurts, Alexander A. Fingelkurts, Sergei V. Borisov, Boris S. Darkhovsky:
Nonstationary nature of the brain activity as revealed by EEG/MEG: Methodological, practical and conceptual challenges. Signal Process. 85(11): 2190-2212 (2005) - [c1]Boris Brodsky, Boris S. Darkhovsky:
Asymptotically Optimal Sequential Change-Point Detection under Composite Hypotheses. CDC/ECC 2005: 7347-7351
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
