- Александр Юрьевич Кудрявцев, Alexander Yurjevich Kudryavtsev, “О скорости сходимости орторекурсивных разложений по неортогональным всплескам”, Изв. РАН. Сер. матем., 76, № 4, 2012, 49
- Yonina C. Eldar, Patrick Kuppinger, Helmut Bolcskei, “Block-Sparse Signals: Uncertainty Relations and Efficient Recovery”, IEEE Trans. Signal Process., 58, № 6, 2010, 3042
- V.N. Temlyakov, “Greedy Algorithms andM-Term Approximation with Regard to Redundant Dictionaries”, Journal of Approximation Theory, 98, № 1, 1999, 117
- Michael Elad, Sparse and Redundant Representations, 2010, 35
- Александр Владимирович Сильниченко, A V Sil'nichenko, “О скорости сходимости жадных алгоритмов”, Матем. заметки, 76, № 4, 2004, 628
- Yan Zhou, Heming Zhao, Tao Liu, 2012 IEEE 11th International Conference on Signal Processing, 2012, 489
- R.A. DeVore, V.N. Temlyakov, “Nonlinear Approximation in Finite-Dimensional Spaces”, Journal of Complexity, 13, № 4, 1997, 489
- Scott Shaobing Chen, David L. Donoho, Michael A. Saunders, “Atomic Decomposition by Basis Pursuit”, SIAM J. Sci. Comput., 20, № 1, 1998, 33
- Wen Mi, 2013 IEEE International Conference on Information and Automation (ICIA), 2013, 751
- Lisandro Lovisolo, Eduardo A.B. da Silva, Allan Freitas da Silva, Signal Processing and Machine Learning Theory, 2024, 651