- Wolfgang Dahmen, Sampling Theory, a Renaissance, 2015, 403

- Maxim Aleksandrovich Valov, “Конический жадный алгоритм”, Математические заметки, 112, no. 2, 2022, 163

- Bernhard Stankewitz, “Early stopping for L2-boosting in high-dimensional linear models”, Ann. Statist., 52, no. 2, 2024

- Alessandro Oliaro, Luca Tomatis, Albert R. Valiullin, Artur R. Valiullin, “Greedy Expansions with Prescribed Coefficients in Hilbert Spaces for Special Classes of Dictionaries”, Constr Approx, 2024

- Xianhe Wang, Xu Xu, Peixin Ye, Wenhui Zhang, “Approximation properties of some vector weak biorthogonal greedy algorithms”, Int. J. Wavelets Multiresolut Inf. Process., 22, no. 06, 2024, 2450033

- D. V. Gorbachev, A. P. Solodov, “New Conditions for the Convergence of a Weak Greedy Algorithm”, Math Notes, 116, no. 3-4, 2024, 566

- Zihang Zhang, Yang Liu, Lei Bo, Shangqing Yang, Yanwen Wang, “Optimized path planning for underground coal mine filling: an greedy adaptive directional bidirectional rapidly-exploring random tree”, Meas. Sci. Technol., 36, no. 2, 2025, 026205
