Iwen M.A., “Compressed Sensing With Sparse Binary Matrices: Instance Optimal Error Guarantees in Near-Optimal Time”, J. Complex., 30:1 (2014), 1–15
Livshitz E.D., “on the Optimality of the Orthogonal Greedy Algorithm For Mu-Coherent Dictionaries”, J. Approx. Theory, 164:5 (2012), 668–681
Nelson J.L., Temlyakov V.N., “on the Size of Incoherent Systems”, J. Approx. Theory, 163:9 (2011), 1238–1245
Bourgain J., Dilworth S., Ford K., Konyagin S., Kutzarova D., “Explicit Constructions of Rip Matrices and Related Problems”, Duke Math. J., 159:1 (2011), 145–185
Bourgain J., Dilworth S.J., Ford K., Konyagin S.V., Kutzarova D., “Breaking the K(2) Barrier For Explicit Rip Matrices”, Stoc 11: Proceedings of the 43rd Acm Symposium on Theory of Computing, Annual Acm Symposium on Theory of Computing, Assoc Computing Machinery, 2011, 637–644
Vybiral J., “Widths of Embeddings in Function Spaces”, J. Complex., 24:4 (2008), 545–570
Konovalov V. Leviatan D., “Shape-Preserving Widths of Weighted Sobolev-Type Classes of Positive, Monotone, and Convex Functions on a Finite Interval”, Constr. Approx., 19:1 (2003), 23–58
Konovalov V. Leviatan D., “Kolmogorov and Linear Widths of Weighted Sobolev-Type Classes on a Finite Interval, II”, J. Approx. Theory, 113:2 (2001), 266–297
Gluskin E., Tomczakjaegermann N., Tzafriri L., “Subspaces of Lpn of Small Codimension”, Isr. J. Math., 79:2-3 (1992), 173–192
Martins J., “Approximation Numbers of Maps on Besov Sequence-Spaces”, J. Lond. Math. Soc.-Second Ser., 40:1 (1989), 120–136