11 citations · 22 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CC2017
Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams
Michael Kapralov, Jelani Nelson, Jakub Pachocki +3
In the communication problem (universal relation) [KRW95], Alice and Bob respectively receive with the promise that . The last player to…
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…