{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:12:31Z","timestamp":1750306351673,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,19]],"date-time":"2016-06-19T00:00:00Z","timestamp":1466294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,6,19]]},"DOI":"10.1145\/2897518.2897650","type":"proceedings-article","created":{"date-parts":[[2016,6,10]],"date-time":"2016-06-10T13:04:07Z","timestamp":1465563847000},"page":"264-277","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["Sparse fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time"],"prefix":"10.1145","author":[{"given":"Michael","family":"Kapralov","sequence":"first","affiliation":[{"name":"EPFL, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,6,19]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"146","article-title":"Proving hard-core predicates using list decoding","volume":"44","author":"Akavia A.","year":"2003","unstructured":"{AGS03} A. Akavia , S. Goldwasser , and S. Safra . Proving hard-core predicates using list decoding . FOCS , 44 : 146 \u2013 159 , 2003 . {AGS03} A. Akavia, S. Goldwasser, and S. Safra. Proving hard-core predicates using list decoding. FOCS, 44:146\u2013159, 2003.","journal-title":"FOCS"},{"key":"e_1_3_2_1_2_1","first-page":"393","volume-title":"COLT","author":"Akavia A.","year":"2010","unstructured":"{Aka10} A. Akavia . Deterministic sparse Fourier approximation via fooling arithmetic progressions . COLT , pages 381\u2013 393 , 2010 . {Aka10} A. Akavia. Deterministic sparse Fourier approximation via fooling arithmetic progressions. COLT, pages 381\u2013393, 2010."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32512-0_6"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-09477-9_5"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646255.684566"},{"key":"e_1_3_2_1_6_1","volume-title":"SODA","author":"Cheraghchi M.","year":"2012","unstructured":"{CGV12} M. Cheraghchi , V. Guruswami , and A. Velingker . Restricted isometry of Fourier matrices and list decodability of random linear codes . SODA , 2012 . {CGV12} M. Cheraghchi, V. Guruswami, and A. Velingker. Restricted isometry of Fourier matrices and list decodability of random linear codes. SODA, 2012."},{"key":"e_1_3_2_1_7_1","volume-title":"The Best of the 20th Century: Editors","author":"Cipra B. A.","year":"2000","unstructured":"{Cip00} B. A. Cipra . The Best of the 20th Century: Editors Name Top 10 Algorithms. SIAM News , 33, 2000 . {Cip00} B. A. Cipra. The Best of the 20th Century: Editors Name Top 10 Algorithms. SIAM News, 33, 2000."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161794"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"e_1_3_2_1_10_1","volume-title":"SODA","author":"Do Ba K.","year":"2010","unstructured":"{DIPW10} K. Do Ba , P. Indyk , E. Price , and D. Woodruff . Lower Bounds for Sparse Recovery . SODA , 2010 . {DIPW10} K. Do Ba, P. Indyk, E. Price, and D. Woodruff. Lower Bounds for Sparse Recovery. SODA, 2010."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509933"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736670"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806755"},{"key":"e_1_3_2_1_16_1","volume-title":"SPIE Conference","author":"Gilbert A.","year":"2005","unstructured":"{GMS05} A. Gilbert , M. Muthukrishnan , and M. Strauss . Improved time bounds for near-optimal space Fourier representations . SPIE Conference , Wavelets , 2005 . {GMS05} A. Gilbert, M. Muthukrishnan, and M. Strauss. Improved time bounds for near-optimal space Fourier representations. SPIE Conference, Wavelets, 2005."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348543.2348587"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214029"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095209"},{"key":"e_1_3_2_1_20_1","volume-title":"SAMPTA","author":"Heider S.","year":"2013","unstructured":"{HKPV13} S. Heider , S. Kunis , D. Potts , and M. Veit . A sparse Prony FFT . SAMPTA , 2013 . {HKPV13} S. Heider, S. Kunis, D. Potts, and M. Veit. A sparse Prony FFT. SAMPTA, 2013."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch22"},{"key":"e_1_3_2_1_22_1","volume-title":"FOCS","author":"Indyk P.","year":"2014","unstructured":"{IK14} P. Indyk and M. Kapralov . Sample-optimal Fourier sampling in any fixed dimension . FOCS , 2014 . {IK14} P. Indyk and M. Kapralov. Sample-optimal Fourier sampling in any fixed dimension. FOCS, 2014."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.36"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/3115488.3115864"},{"key":"e_1_3_2_1_25_1","volume-title":"Applied And Computational Harmonic Analysis","author":"Iwen M.A.","year":"2012","unstructured":"{Iwe12} M.A. Iwen . Improved approximation guarantees for sublinear-time Fourier algorithms . Applied And Computational Harmonic Analysis , 2012 . {Iwe12} M.A. Iwen. Improved approximation guarantees for sublinear-time Fourier algorithms. Applied And Computational Harmonic Analysis, 2012."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"{Kap16} M. Kapralov. Sparse Fourier Transform in any constant dimension with nearly-optimal sample complexity in sublinear time. http:\/\/ arxiv.org\/ abs\/ 1604.00845 2016.  {Kap16} M. Kapralov. Sparse Fourier Transform in any constant dimension with nearly-optimal sample complexity in sublinear time. http:\/\/ arxiv.org\/ abs\/ 1604.00845 2016.","DOI":"10.1145\/2897518.2897650"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103466"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914728"},{"key":"e_1_3_2_1_29_1","volume-title":"ICALP","author":"Mansour Y.","year":"1992","unstructured":"{Man92} Y. Mansour . Randomized interpolation and approximation of sparse polynomials . ICALP , 1992 . {Man92} Y. Mansour. Randomized interpolation and approximation of sparse polynomials. ICALP, 1992."},{"key":"e_1_3_2_1_30_1","volume-title":"ISIT","author":"Pawar S.","year":"2013","unstructured":"{PR13} S. Pawar and K. Ramchandran . Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(klogk) complexity . ISIT , 2013 . {PR13} S. Pawar and K. Ramchandran. Computing a k-sparse n-length Discrete Fourier Transform using at most 4k samples and O(klogk) complexity. ISIT, 2013."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.42"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20227"},{"volume-title":"Conference on Mathematics of Medical Imaging","year":"2011","key":"e_1_3_2_1_33_1","unstructured":"{Sid11} Emil Sidky. What does compressive sensing mean for X-ray CT and comparisons with its MRI application . In Conference on Mathematics of Medical Imaging , 2011 . {Sid11} Emil Sidky. What does compressive sensing mean for X-ray CT and comparisons with its MRI application. In Conference on Mathematics of Medical Imaging, 2011."}],"event":{"name":"STOC '16: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Cambridge MA USA","acronym":"STOC '16"},"container-title":["Proceedings of the forty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897650","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2897518.2897650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:58Z","timestamp":1750222558000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2897518.2897650"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,19]]},"references-count":33,"alternative-id":["10.1145\/2897518.2897650","10.1145\/2897518"],"URL":"https:\/\/doi.org\/10.1145\/2897518.2897650","relation":{},"subject":[],"published":{"date-parts":[[2016,6,19]]},"assertion":[{"value":"2016-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}