Information theory plays an indispensable role in the development of algorithm-independent
impossibility results, both for communication problems and for seemingly distinct areas such …

In the long-studied problem of combinatorial group testing, one is asked to detect a set of k
defective items out of a population of size n, using m≪ n disjunctive measurements. In the …

The problem of computing the Fourier Transform of a signal whose spectrum is dominated
by a small number k of frequencies quickly and using a small number of samples of the …

Abstract The Discrete Fourier Transform (DFT) is a fundamental computational primitive, and
the fastest known algorithm for computing the DFT is the FFT (Fast Fourier Transform) …

We consider the extensively studied problem of ℓ2/ℓ2 compressed sensing. The main
contribution of our work is an improvement over [Gilbert, Li, Porat and Strauss, STOC 2010] …

In this paper, a deterministic sparse Fourier transform algorithm is presented which breaks
the quadratic-in-sparsity runtime bottleneck for a large class of periodic functions exhibiting …

With the increasing size of datasets in wideband spectrum sensing, high-resolution radar
imaging and high-definition multimedia, real-time computation, and sample storage have …

In group testing, the goal is to identify a subset of defective items within a larger set of items
based on tests whose outcomes indicate whether at least one defective item is present. This …

The ability to resolve detail in the object that is being imaged, named by resolution, is the
core parameter of an imaging system. Super-resolution is a class of techniques that can …

We consider the problem of finding the Discrete Fourier Transform (DFT) of N-length signals
with known frequency support of size k. When N is a power of 2 and the frequency support is …