- A.A. Khartov, M. Zani, “Approximation complexity of sums of random processes”, Journal of Complexity, 54, 2019, 101399
![https://doi.org/10.1016/j.jco.2019.02.002 crossref](/refsvg/svg/crossref.svg)
- A.A. Khartov, “Asymptotic analysis of average case approximation complexity of Hilbert space valued random elements”, Journal of Complexity, 31, no. 6, 2015, 835
![https://doi.org/10.1016/j.jco.2015.06.004 crossref](/refsvg/svg/crossref.svg)
- Konrad Abramowicz, Oleg Seleznjev, “Piecewise-Multilinear Interpolation of a Random Field”, Advances in Applied Probability, 45, no. 4, 2013, 945
![https://doi.org/10.1239/aap/1386857852 crossref](/refsvg/svg/crossref.svg)
- Mikhail Lifshits, Marguerite Zani, “Approximation of additive random fields based on standard information: Average case and probabilistic settings”, Journal of Complexity, 31, no. 5, 2015, 659
![https://doi.org/10.1016/j.jco.2015.05.002 crossref](/refsvg/svg/crossref.svg)
- M. Zani, A. A. Khartov, “Decomposition of Additive Random Fields”, Vestnik St.Petersb. Univ.Math., 53, no. 1, 2020, 29
![https://doi.org/10.1134/S1063454120010124 crossref](/refsvg/svg/crossref.svg)
- M.A. Lifshits, A. Papageorgiou, H. Woźniakowski, “Average case tractability of non-homogeneous tensor product problems”, Journal of Complexity, 28, no. 5-6, 2012, 539
![https://doi.org/10.1016/j.jco.2012.05.003 crossref](/refsvg/svg/crossref.svg)
- Henryk Woźniakowski, “ABC on IBC”, Journal of Complexity, 52, 2019, 2
![https://doi.org/10.1016/j.jco.2018.05.001 crossref](/refsvg/svg/crossref.svg)
- A.A. Khartov, M. Zani, “Asymptotic analysis of average case approximation complexity of additive random fields”, Journal of Complexity, 52, 2019, 24
![https://doi.org/10.1016/j.jco.2018.04.001 crossref](/refsvg/svg/crossref.svg)
- Abdollah Arasteh, Seyyed Gholamreza Jalali Naini, Alireza Aliahmadi, “Considering the game-theoretic approach and ultra combinative costs on scheduling”, Int J Adv Manuf Technol, 70, no. 5-8, 2014, 1473
![https://doi.org/10.1007/s00170-013-5388-9 crossref](/refsvg/svg/crossref.svg)
- A.A. Khartov, “A simplified criterion for quasi-polynomial tractability of approximation of random elements and its applications”, Journal of Complexity, 34, 2016, 30
![https://doi.org/10.1016/j.jco.2015.11.004 crossref](/refsvg/svg/crossref.svg)