- Volker Michel, Lectures on Constructive Approximation, 2013, 145

- Miroslav Andrle, Laura Rebollo-Neira, “Cardinal B-spline dictionaries on a compact interval”, Applied and Computational Harmonic Analysis, 18, no. 3, 2005, 336

- R. A. DeVore, V. N. Temlyakov, “Convex Optimization on Banach Spaces”, Found Comput Math, 16, no. 2, 2016, 369

- D. Leviatan, V. N. Temlyakov, “Simultaneous approximation by greedy algorithms”, Adv Comput Math, 25, no. 1-3, 2006, 73

- Michael Elad, Sparse and Redundant Representations, 2010, 35

- Volker Michel, Lectures on Constructive Approximation, 2013, 31

- V. N. Temlyakov, “Greedy approximation”, Acta Numerica, 17, 2008, 235

- Peter Oswald, “Greedy algorithms and bestm-term approximation with respect to biorthogonal systems”, The Journal of Fourier Analysis and Applications, 7, no. 4, 2001, 325

- Volker Michel, Lectures on Constructive Approximation, 2013, 303

- Michael Elad, “Sparse Representations Are Most Likely to Be the Sparsest Possible”, EURASIP J. Adv. Signal Process., 2006, no. 1, 2006, 096247
