- V. Temlyakov, 177, Mathematical Analysis, Probability and Applications – Plenary Lectures, 2016, 183
- Rensuo Li, Yongping Liu, “The Best m-Term One-Sided Approximation of Besov Classes by the Trigonometric Polynomials”, APM, 02, no. 03, 2012, 183
- Feng Dai, “An extrapolation theorem for nonlinear approximation and its applications”, Journal of Approximation Theory, 143, no. 2, 2006, 135
- Mark Kon, Leszek Plaskota, “Complexity of Neural Network Approximation with Limited Information: A Worst Case Approach”, Journal of Complexity, 17, no. 2, 2001, 345
- Naoki Saito, Jean-François Remy, “The polyharmonic local sine transform: A new tool for local image analysis and synthesis without edge effect”, Applied and Computational Harmonic Analysis, 20, no. 1, 2006, 41
- G. Akishev, “Trigonometric Widths of the Nikol’skii–Besov Classes in the Lebesgue Space with Mixed Norm”, Ukr Math J, 66, no. 6, 2014, 807
- Thomas Jahn, Tino Ullrich, Felix Voigtlaender, “Sampling numbers of smoothness classes via ℓ1-minimization”, Journal of Complexity, 79, 2023, 101786
- A. F. Konohrai, S. A. Stasyuk, “Best M-term trigonometric approximations of the classes $ B^{\Omega }_{{p,{\text{ $ \theta $ }}}} $ of periodic functions of many variables in the space L q”, Ukr Math J, 60, no. 9, 2008, 1396
- V. Kurkova, M. Sanguineti, “Bounds on rates of variable-basis and neural-network approximation”, IEEE Trans. Inform. Theory, 47, no. 6, 2001, 2659
- D. Leviatan, V. N. Temlyakov, “Simultaneous approximation by greedy algorithms”, Adv Comput Math, 25, no. 1-3, 2006, 73