**Research:**

1. A. Milovanov,*Some properties of antistochastic strings.*

CSR 2015, LNCS 9139, pp. 1-11, 2015. http://arxiv.org/abs/1410.0310

2. A. Milovanov, *Algorithmic statistics, prediction and machine learning.* http://arxiv.org/abs/1509.05473

3. A. Milovanov, *Bounds of some parameters of elliptic curve on finite field.* http://arxiv.org/abs/1307.0648

4. A. Milovanov, *Algorithmic statistics: normal objects and universal models.* http://arxiv.org/abs/1512.04510

5. A. Milovanov, *#P-completeness of counting roots of a sparse polynomial*. http://arxiv.org/abs/1608.07564

6. A. Milovanov, *On algorithmic statistics for space-bounded algorithms.* http://arxiv.org/abs/1702.08084

7. A. Milovanov, N. Vereshchagin, *Stochastity in Algorithmic Statistics for Polynomial Time. *https://eccc.weizmann.ac.il/report/2017/043/