133 citations · 803 across the 68 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2020★ 4 cited
Near optimal sparsity-constrained group testing: improved bounds and algorithms
Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk +4
Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the subli…
cs.DS2017
An Adaptive Sublinear-Time Block Sparse Fourier Transform
Volkan Cevher, Michael Kapralov, Jonathan Scarlett +1
The problem of approximately computing the dominant Fourier coefficients of a vector quickly, and using few samples in time domain, is known as the Sparse Fourier Transform…