Stable recovery of sparse overcomplete representations in the presence of noise DL Donoho, M Elad, VN Temlyakov IEEE Transactions on information theory 52 (1), 6-18, 2005 | 2853 | 2005 |

Some remarks on greedy algorithms RA DeVore, VN Temlyakov Advances in computational Mathematics 5 (1), 173-187, 1996 | 730 | 1996 |

Approximations of functions with bounded mixed derivative VN Temlyakov Trudy Matematicheskogo Instituta imeni VA Steklova 178, 3-113, 1986 | 468 | 1986 |

Nonlinear methods of approximation Temlyakov Foundations of Computational Mathematics 3, 33-107, 2003 | 413 | 2003 |

Greedy approximation V Temlyakov Cambridge University Press, 2011 | 361 | 2011 |

A remark on greedy approximation in Banach spaces SV Konyagin, VN Temlyakov East J. Approx 5 (3), 365-379, 1999 | 334 | 1999 |

Weak greedy algorithms [*] This research was supported by National Science Foundation Grant DMS 9970326 and by ONR Grant N00014‐96‐1‐1003. VN Temlyakov Advances in Computational Mathematics 12 (2), 213-227, 2000 | 329 | 2000 |

Hyperbolic cross approximation D Dũng, V Temlyakov, T Ullrich Springer, 2018 | 313* | 2018 |

Greedy approximation VN Temlyakov Acta Numerica 17, 235-409, 2008 | 285 | 2008 |

The best m-term approximation and greedy algorithms VN Temlyakov Advances in Computational Mathematics 8 (3), 249-265, 1998 | 254 | 1998 |

The orthogonal super greedy algorithm and applications in compressed sensing E Liu, VN Temlyakov IEEE Transactions on Information Theory 58 (4), 2040-2047, 2011 | 252 | 2011 |

Hyperbolic wavelet approximation RA DeVore, SV Konyagin, VN Temlyakov Constructive Approximation 14 (1), 1-26, 1998 | 208 | 1998 |

The thresholding greedy algorithm, greedy bases, and duality SJ Dilworth, NJ Kalton, D Kutzarova, VN Temlyakov Constructive approximation 19 (4), 575-597, 2003 | 199 | 2003 |

Multivariate approximation V Temlyakov Cambridge University Press, 2018 | 153 | 2018 |

A remark on compressed sensing BS Kashin, VN Temlyakov Mathematical notes 82, 748-755, 2007 | 151 | 2007 |

Nonlinear approximation by trigonometric sums RA DeVore, VN Temlyakov Journal of Fourier Analysis and Applications 2 (1), 29-48, 1995 | 149 | 1995 |

Greedy Algorithm and *m* -Term Trigonometric ApproximationVN Temlyakov Constructive approximation 14 (4), 569-587, 1998 | 143 | 1998 |

Universal algorithms for learning theory part i: Piecewise constant functions. P Binev, A Cohen, W Dahmen, R DeVore, V Temlyakov, P Bartlett Journal of Machine Learning Research 6 (9), 2005 | 129 | 2005 |

Greedy algorithms andm-term approximation with regard to redundant dictionaries VN Temlyakov Journal of Approximation Theory 98 (1), 117-145, 1999 | 124 | 1999 |

Estimates for the asymptotic characteristics of classes of functions with bounded mixed derivative or difference VN Temlyakov Trudy Matematicheskogo Instituta imeni VA Steklova 189, 138-168, 1989 | 112 | 1989 |