Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Michael Kapralov. Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time. In Daniel Wichs, Yishay Mansour, editors, Proceedings of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016, Cambridge, MA, USA, June 18-21, 2016. pages 264-277, ACM, 2016. [doi]

The following publications are possibly variants of this publication:

Sample-Optimal Fourier Sampling in Any Constant DimensionPiotr Indyk, Michael Kapralov. focs 2014: 514-523 [doi]

(Nearly) Sample-Optimal Sparse Fourier TransformPiotr Indyk, Michael Kapralov, Eric Price. soda 2014: 480-499 [doi]

An adaptive sublinear-time block sparse fourier transformVolkan Cevher, Michael Kapralov, Jonathan Scarlett, Amir Zandieh. stoc 2017: 702-715 [doi]

runs on WebDSL