default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlexey Milovanov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Alexey Milovanov
:
Prediction and MDL for infinite sequences. Theory Comput. Syst. 68(5): 1124-1137 (2024)- [i13]Alexey Milovanov:
On the computational power of C-random strings. CoRR abs/2409.04448 (2024) - [i12]Bruno Loff, Alexey Milovanov:
The hardness of decision tree complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c9]Alexey Milovanov:
Some Games on Turing Machines and Power from Random Strings. CiE 2023: 105-119 - 2022
- [i11]Greg McLellan, Alexey Milovanov:
Some Games on Turing Machines and Power from Random Strings. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [c8]Alexey Milovanov:
Predictions and Algorithmic Statistics for Infinite Sequences. CSR 2021: 283-295 - 2020
- [i10]Alexey Milovanov:
Predictions and algorithmic statistics for infinite sequence. CoRR abs/2005.03467 (2020)
2010 – 2019
- 2019
- [j3]Alexey Milovanov:
#P-completeness of counting roots of a sparse polynomial. Inf. Process. Lett. 142: 77-79 (2019) - [j2]Alexey Milovanov:
On Algorithmic Statistics for Space-bounded Algorithms. Theory Comput. Syst. 63(4): 833-848 (2019) - [i9]Alexey Milovanov:
PIT for depth-$4$ circuits and Sylvester-Gallai conjecture for polynomials. CoRR abs/1902.07201 (2019) - [i8]Alexey Milovanov:
PIT for depth-4 circuits and Sylvester-Gallai theorem for polynomials. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c7]Alexey Milovanov:
Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms. CiE 2018: 287-296 - 2017
- [j1]Alexey Milovanov:
Some Properties of Antistochastic Strings. Theory Comput. Syst. 61(2): 521-535 (2017) - [c6]Alexey Milovanov, Nikolay K. Vereshchagin:
Stochasticity in Algorithmic Statistics for Polynomial Time. CCC 2017: 17:1-17:18 - [c5]Alexey Milovanov:
On Algorithmic Statistics for Space-Bounded Algorithms. CSR 2017: 232-244 - [i7]Alexey Milovanov:
On Algorithmic Statistics for space-bounded algorithms. CoRR abs/1702.08084 (2017) - [i6]Alexey Milovanov, Nikolai K. Vereshchagin:
Stochasticity in Algorithmic Statistics for Polynomial Time. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [c4]Alexey Milovanov:
Algorithmic Statistics: Normal Objects and Universal Models. CSR 2016: 280-293 - [c3]Alexey Milovanov:
Algorithmic Statistics, Prediction and Machine Learning. STACS 2016: 54:1-54:13 - [i5]Alexey Milovanov:
#P- and $\oplus$P- completeness of counting roots of a sparse polynomial. CoRR abs/1608.07564 (2016) - 2015
- [c2]Alexey Milovanov:
Some Properties of Antistochastic Strings. CSR 2015: 339-349 - [i4]Alexey Milovanov:
Algorithmic statistics, prediction and machine learning. CoRR abs/1509.05473 (2015) - [i3]Alexey Milovanov:
Algorithmic statistics: normal objects and universal models. CoRR abs/1512.04510 (2015) - 2014
- [c1]Dongmyoung Shin, Sung Gil Park, Byung Soo Song, Eung Su Kim, Oleg Kupervasser, Denis Pivovartchuk, Ilya Gartseev, Oleg Antipov, Evgeniy Kruchenkov, Alexey Milovanov, Andrey Kochetov, Igor Sazonov, Igor Nogtev, Sun Woo Hyun:
Precision improvement of MEMS gyros for indoor mobile robots with horizontal motion inspired by methods of TRIZ. NEMS 2014: 102-107 - [i2]Alexey Milovanov:
The properties of absolutely non-stochastic strings. CoRR abs/1410.0310 (2014) - 2013
- [i1]Dongmyoung Shin, Sung Gil Park, Byung Soo Song, Eung Su Kim, Oleg Kupervasser, Denis Pivovartchuk, Ilya Gartseev, Oleg Antipov, Evgeniy Kruchenkov, Alexey Milovanov, Andrey Kochetov, Igor Sazonov, Igor Nogtev, Sun Woo Hyun:
Precision improvement of MEMS gyros for indoor mobile robots with horizontal motion inspired by methods of TRIZ. CoRR abs/1311.3979 (2013)
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-12-10 21:40 CET 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:
