- V. Temlyakov, 177, Mathematical Analysis, Probability and Applications – Plenary Lectures, 2016, 183
- Vladimir Temlyakov, New Trends in Applied Harmonic Analysis, 2016, 107
- Xu Xu, Jinyu Guo, Peixin Ye, Wenhui Zhang, “Approximation Properties of the Vector Weak Rescaled Pure Greedy Algorithm”, Mathematics, 11, № 9, 2023, 2020
- PeiXin Ye, XiuJie Wei, “Efficiency of weak greedy algorithms for m-term approximations”, Sci. China Math., 59, № 4, 2016, 697
- S. J. Dilworth, D. Kutzarova, T. Oikhberg, “Lebesgue constants for the weak greedy algorithm”, Rev Mat Complut, 28, № 2, 2015, 393
- Gustavo Garrigós, Eugenio Hernández, Timur Oikhberg, “Lebesgue-Type Inequalities for Quasi-greedy Bases”, Constr Approx, 38, № 3, 2013, 447
- V. N. TEMLYAKOV, “SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES”, Forum math. Sigma, 2, 2014, e12
- Fernando Albiac, José L. Ansorena, Pablo M. Berná, “New parameters and Lebesgue-type estimates in greedy approximation”, Forum of Mathematics, Sigma, 10, 2022, e113
- Vladimir Nikolaevich Temlyakov, “Скорость сходимости пороговых жадных алгоритмов”, Математический сборник, 215, № 2, 2024, 147
- Fernando Albiac, José L. Ansorena, Przemysław Wojtaszczyk, “Conditional Quasi-Greedy Bases in Non-superreflexive Banach Spaces”, Constr Approx, 49, № 1, 2019, 103