- PeiXin Ye, XiuJie Wei, “Efficiency of weak greedy algorithms for m-term approximations”, Sci. China Math., 59, no. 4, 2016, 697
- Vladimir Nikolaevich Temlyakov, “Rate of convergence of Thresholding Greedy Algorithms”, Sb. Math., 215, no. 2, 2024, 275
- A. Serdyuk, A. Shidlich, “Актуальні проблеми теорії наближень в метриках дискретних просторів на множинах сумовних періодичних та майже періодичних функцій”, Ukr. Mat. Zhurn., 76, no. 11, 2024, 1653
- Iurii Petrovich Svetlov, “Сходимость регуляризованных жадных аппроксимаций”, Известия Российской академии наук. Серия математическая, 89, no. 2, 2025, 114
- V.N. Temlyakov, “Weak greedy algorithms[*]This research was supported by National Science Foundation Grant DMS 9970326 and by ONR Grant N00014‐96‐1‐1003.”, Advances in Computational Mathematics, 12, no. 2-3, 2000, 213
- Iurii Petrovich Svetlov, “Convergence of regularized greedy approximations”, Izv. Math., 89, no. 2, 2025, 328
- Anatolii Serdyuk, Andrii Shidlich, “Actual Problems of the Theory of Approximations in Metrics of Discrete Spaces on the Sets of Summable Periodic and Almost Periodic Functions”, Ukr Math J, 2025
- Daniel Carando, Silvia Lassalle, Leandro Milne, “The Fundamental Functions of the Canonical Basis of Hardy Spaces of Dirichlet Series”, J Fourier Anal Appl, 31, no. 4, 2025, 59
- A. I. Stepanets, “Approximation Characteristics of Spaces
$S_\phi ^p$”, Ukrainian Mathematical Journal, 53, no. 3, 2001, 446