- Pedro J. Catuogno, Sebastian E. Ferrando, Alfredo L. Gonzalez, “Adaptive Martingale Approximations”, J Fourier Anal Appl, 14, no. 5-6, 2008, 712
- A. Çivril, “A note on the hardness of sparse approximation”, Information Processing Letters, 113, no. 14-16, 2013, 543
- Boris N. Khoromskij, “On tensor approximation of Green iterations for Kohn-Sham equations”, Comput. Visual Sci., 11, no. 4-6, 2008, 259
- Volker Michel, Lectures on Constructive Approximation, 2013, 289
- Michael Elad, Sparse and Redundant Representations, 2010, 79
- Volker Michel, Lectures on Constructive Approximation, 2013, 85
- M. Andrle, L. Rebollo-Neira, E. Sagianos, “Backward-Optimized Orthogonal Matching Pursuit Approach”, IEEE Signal Process. Lett., 11, no. 9, 2004, 705
- Laura Rebollo-Neira, Miroslav Rozložník, Pradip Sasmal, “Analysis of the self projected matching pursuit algorithm”, Journal of the Franklin Institute, 357, no. 13, 2020, 8980
- A. Çivril, “Sparse approximation is provably hard under coherent dictionaries”, Journal of Computer and System Sciences, 84, 2017, 32
- Miroslav Andrle, Laura Rebollo-Neira, “A swapping-based refinement of orthogonal matching pursuit strategies”, Signal Processing, 86, no. 3, 2006, 480