- Sheng Zhang, Peixin Ye, 2010 International Conference on Computational Intelligence and Software Engineering, 2010, 1
- Oleg Davydov, 3, Approximation Algorithms for Complex Systems, 2011, 27
- Lasse Borup, Morten Nielsen, “Approximation with brushlet systems”, Journal of Approximation Theory, 123, no. 1, 2003, 25
- Evgenii D Livshits, “The convergence of the greedy algorithm with respect to the Haar system in the spaceLp(0,1)”, Sb. Math., 201, no. 2, 2010, 253
- Miguel Berasategui, Silvia Lassalle, “Weak Greedy Algorithms and the Equivalence Between Semi-greedy and Almost Greedy Markushevich Bases”, J Fourier Anal Appl, 29, no. 2, 2023, 20
- Vladimir Nikolaevich Temlyakov, “Скорость сходимости пороговых жадных алгоритмов”, Математический сборник, 215, no. 2, 2024, 147
- Przemysław Wojtaszczyk, “On left democracy function”, Funct. Approx. Comment. Math., 50, no. 2, 2014
- V. N. Temlyakov, “Greedy approximation”, Acta Numerica, 17, 2008, 235
- Lin Li, Rustam Stolkin, Licheng Jiao, Fang Liu, Shuang Wang, “A compressed sensing approach for efficient ensemble learning”, Pattern Recognition, 47, no. 10, 2014, 3451
- Yoshinori Nakanishi-Ohno, Tomoyuki Obuchi, Masato Okada, Yoshiyuki Kabashima, “Sparse approximation based on a random overcomplete basis”, J. Stat. Mech., 2016, no. 6, 2016, 063302