|
|
|
Publications in Math-Net.Ru |
Citations |
|
2024 |
| 1. |
K. S. Vishnevetskiy, “Comparison of Purely Greedy and Orthogonal Greedy Algorithm”, Mat. Zametki, 115:1 (2024), 43–50   ; Math. Notes, 115:1 (2024), 37–43  |
2
|
|
2022 |
| 2. |
K. S. Vishnevetskiy, “On the Coincidence of Pure Greedy and Best $m$-Term Approximations”, Mat. Zametki, 111:2 (2022), 202–210 ; Math. Notes, 111:2 (2022), 204–210  |
2
|
| 3. |
K. S. Vishnevetskiy, “Condition of coincidence between greedy approximations and $m$-term ones”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2022, no. 2, 18–23  ; Moscow University Mathematics Bulletin, 77:2 (2022), 67–72 |
|
| Presentations in Math-Net.Ru |
|
|
| Organisations |
|
|
