22 citations to https://www.mathnet.ru/eng/smpol1
  1. F. Albiac, J.L. Ansorena, S.J. Dilworth, Denka Kutzarova, “Building highly conditional almost greedy and quasi-greedy bases in Banach spaces”, Journal of Functional Analysis, 276:6 (2019), 1893  crossref
  2. T. Oikhberg, “Greedy algorithm with gaps”, Journal of Approximation Theory, 225 (2018), 176  crossref
  3. Pablo M. Berná, Oscar Blasco, Gustavo Garrigós, Eugenio Hernández, Timur Oikhberg, “Embeddings and Lebesgue-Type Inequalities for the Greedy Algorithm in Banach Spaces”, Constr Approx, 48:3 (2018), 415  crossref
  4. Pablo M. Berná, Óscar Blasco, Gustavo Garrigós, “Lebesgue inequalities for the greedy algorithm in general bases”, Rev Mat Complut, 30:2 (2017), 369  crossref
  5. Fernando Albiac, Nigel J. Kalton, Graduate Texts in Mathematics, 233, Topics in Banach Space Theory, 2016, 259  crossref
  6. F. Albiac, J. L. Ansorena, “Lorentz Spaces and Embeddings Induced by Almost Greedy Bases in Banach Spaces”, Constr Approx, 43:2 (2016), 197  crossref
  7. PeiXin Ye, XiuJie Wei, “Efficiency of weak greedy algorithms for m-term approximations”, Sci. China Math., 59:4 (2016), 697  crossref
  8. Vladimir Temlyakov, Applied and Numerical Harmonic Analysis, New Trends in Applied Harmonic Analysis, 2016, 107  crossref
  9. V. N. Temlyakov, “Sparse approximation by greedy algorithm”, Springer Proc. Math. Statist., 177 (2016), 183–215  mathnet  crossref  isi  scopus
  10. S. J. Dilworth, D. Kutzarova, T. Oikhberg, “Lebesgue constants for the weak greedy algorithm”, Rev Mat Complut, 28:2 (2015), 393  crossref
Previous
1
2
3
Next