- David L. Donoho, Michael Elad, “On the stability of the basis pursuit in the presence of noise”, Signal Processing, 86, no. 3, 2006, 511
- Volker Michel, Lectures on Constructive Approximation, 2013, 239
- D.L. Donoho, M. Elad, V.N. Temlyakov, “On Lebesgue-type inequalities for greedy approximation”, Journal of Approximation Theory, 147, no. 2, 2007, 185
- V. N. Temlyakov, “Convergence and rate of convergence of some greedy algorithms in convex optimization”, Proc. Steklov Inst. Math., 293, no. 1, 2016, 325
- Entao Liu, Vladimir N. Temlyakov, “Super greedy type algorithms”, Adv Comput Math, 37, no. 4, 2012, 493
- Volker Michel, Lectures on Constructive Approximation, 2013, 249
- A.N. Omara, Abdullah Shawan Alotaibi, “GLOBE: A novel pruning-based sparse modeling with application to time series data representation”, Journal of King Saud University - Computer and Information Sciences, 35, no. 10, 2023, 101800
- Vesselin Vatchev, Robert Sharpley, “Decomposition of functions into pairs of intrinsic mode functions”, Proc. R. Soc. A., 464, no. 2097, 2008, 2265
- Volker Michel, Lectures on Constructive Approximation, 2013, 265
- R. Gribonval, P. Vandergheynst, “On the exponential convergence of matching pursuits in quasi-incoherent dictionaries”, IEEE Trans. Inform. Theory, 52, no. 1, 2006, 255