
Fast and Simple Modular Subset Sum
We revisit the Subset Sum problem over the finite cyclic group ℤ_m for s...
read it

Combinatorial Group Testing and Sparse Recovery Schemes with NearOptimal Decoding Time
In the longstudied problem of combinatorial group testing, one is asked...
read it

(Nearly) SampleOptimal Sparse Fourier Transform in Any Dimension; RIPless and Filterless
In this paper, we consider the extensively studied problem of computing ...
read it

Stronger L2/L2 Compressed Sensing; Without Iterating
We consider the extensively studied problem of ℓ_2/ℓ_2 compressed sensin...
read it

Deterministic Sparse Fourier Transform with an ell_infty Guarantee
In this paper we revisit the deterministic version of the Sparse Fourier...
read it

Nearly Optimal Sparse Polynomial Multiplication
In the sparse polynomial multiplication problem, one is asked to multipl...
read it

Improved Algorithms for Adaptive Compressed Sensing
In the problem of adaptive compressed sensing, one wants to estimate an ...
read it

Deterministic Heavy Hitters with Sublinear Query Time
This paper studies the classic problem of finding heavy hitters in the t...
read it

OneBit ExpanderSketch for OneBit Compressed Sensing
Is it possible to obliviously construct a set of hyperplanes H such that...
read it

Predicting Positive and Negative Links with Noisy Queries: Theory & Practice
Social networks and interactions in social media involve both positive a...
read it
Vasileios Nakos
is this you? claim profile