Discover open access scientific publications

Search, annotate, share and cite publications

Publications by Arturs Backurs

Nearly-Optimal Bounds for Sparse Recovery in Generic Norms, With Applications to K-Median Sketching

English

Related publications

(Nearly) Sample-Optimal Sparse Fourier Transform

English

Sublinear Time, Measurement-Optimal, Sparse Recovery for All

English

Bounds for Nearly Best Approximations

Proceedings of the American Mathematical Society

Applied Mathematics

English

Geometric Median in Nearly Linear Time

English

Conditioning of Random Block Subdictionaries With Applications to Block-Sparse Recovery and Regression

IEEE Transactions on Information Theory

Computer Science Applications

Information Systems

Information Sciences

English

Nearly Tight Bounds for Testing Function Isomorphism

English

Linear Time Bounds for Median Computations

English

Efficient Software Implementation of the Nearly Optimal Sparse Fast Fourier Transform for the Noisy Case

Ingeniería y Ciencia

English

Nearly Sharp Complexity Bounds for Multiprocessor Algebraic Computations

Journal of Complexity

Numerical Analysis

Applied Mathematics

English