{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:08:30Z","timestamp":1750306110265,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T00:00:00Z","timestamp":1497830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["ERC 279735, Horizon2020 665667"],"award-info":[{"award-number":["ERC 279735, Horizon2020 665667"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Swiss National Science Foundation","award":["200021-146750, CRSII2-147633"],"award-info":[{"award-number":["200021-146750, CRSII2-147633"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,6,19]]},"DOI":"10.1145\/3055399.3055462","type":"proceedings-article","created":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T20:27:45Z","timestamp":1497558465000},"page":"702-715","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["An adaptive sublinear-time block sparse fourier transform"],"prefix":"10.1145","author":[{"given":"Volkan","family":"Cevher","sequence":"first","affiliation":[{"name":"EPFL, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Kapralov","sequence":"additional","affiliation":[{"name":"EPFL, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Scarlett","sequence":"additional","affiliation":[{"name":"EPFL, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Zandieh","sequence":"additional","affiliation":[{"name":"EPFL, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,6,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946355"},{"key":"e_1_3_2_2_2_1","first-page":"393","volume-title":"Conf. Learn. Theory (COLT)","author":"Akavia A.","year":"2010","unstructured":"{Aka10} A. Akavia , \u201cDeterministic sparse Fourier approximation via fooling arithmetic progressions ,\u201d Conf. Learn. Theory (COLT) , pp. 381\u2013 393 , 2010 . {Aka10} A. Akavia, \u201cDeterministic sparse Fourier approximation via fooling arithmetic progressions,\u201d Conf. Learn. Theory (COLT), pp. 381\u2013393, 2010."},{"key":"e_1_3_2_2_3_1","first-page":"118","article-title":"Structured sparsity-inducing norms through submodular functions","author":"Bach F. R.","year":"2010","unstructured":"{Bac10} F. R. Bach , \u201c Structured sparsity-inducing norms through submodular functions ,\u201d in Adv. Neur. Inf. Proc. Sys. (NIPS) , 2010 , pp. 118 \u2013 126 . {Bac10} F. R. Bach, \u201cStructured sparsity-inducing norms through submodular functions,\u201d in Adv. Neur. Inf. Proc. Sys. (NIPS), 2010, pp. 118\u2013126.","journal-title":"Adv. Neur. Inf. Proc. Sys. (NIPS)"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634186"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2602222"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2040894"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32512-0_6"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2038076"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.21236\/ADA520218"},{"key":"e_1_3_2_2_10_1","unstructured":"{CKSZ} V. Cevher M. Kapralov J. Scarlett and A. Zandieh \u201cAn adaptive sublineartime block sparse Fourier transform \u201d http:\/\/arxiv.org\/abs\/1702.01286.  {CKSZ} V. Cevher M. Kapralov J. Scarlett and A. Zandieh \u201cAn adaptive sublineartime block sparse Fourier transform \u201d http:\/\/arxiv.org\/abs\/1702.01286."},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.885507"},{"key":"e_1_3_2_2_12_1","volume-title":"Elements of Information Theory","author":"Cover T. M.","year":"2006","unstructured":"{CT06b} T. M. Cover and J. A. Thomas , Elements of Information Theory . John Wiley & amp; Sons, Inc., 2006 . {CT06b} T. M. Cover and J. A. Thomas, Elements of Information Theory. John Wiley & Sons, Inc., 2006."},{"key":"e_1_3_2_2_13_1","volume-title":"ACM-SIAM Symp. Disc. Alg. (SODA)","author":"Do Ba K.","year":"2010","unstructured":"{DIPW10} K. Do Ba , P. Indyk , E. Price , and D. P. Woodruff , \u201c Lower bounds for sparse recovery ,\u201d ACM-SIAM Symp. Disc. Alg. (SODA) , 2010 . {DIPW10} K. Do Ba, P. Indyk, E. Price, and D. P. Woodruff, \u201cLower bounds for sparse recovery,\u201d ACM-SIAM Symp. Disc. Alg. (SODA), 2010."},{"key":"e_1_3_2_2_14_1","volume-title":"Int. Conf. Art. Intel. Stats. (AISTATS)","author":"El Halabi M.","year":"2015","unstructured":"{EHC15} M. El Halabi and V. Cevher , \u201cA totally unimodular view of structured sparsity ,\u201d in Int. Conf. Art. Intel. Stats. (AISTATS) , May 2015 . {EHC15} M. El Halabi and V. Cevher, \u201cA totally unimodular view of structured sparsity,\u201d in Int. Conf. Art. Intel. Stats. (AISTATS), May 2015."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2526243"},{"key":"e_1_3_2_2_16_1","unstructured":"{GGI + } A. Gilbert S. Guha P. Indyk M. Muthukrishnan and M. Strauss \u201cNearoptimal sparse Fourier representations via sampling.\u201d  {GGI + } A. Gilbert S. Guha P. Indyk M. Muthukrishnan and M. Strauss \u201cNearoptimal sparse Fourier representations via sampling.\u201d"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2329131"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_2_19_1","volume-title":"SPIE Conference","author":"Gilbert A.","year":"2005","unstructured":"{GMS05} A. Gilbert , M. Muthukrishnan , and M. Strauss , \u201c Improved time bounds for near-optimal space Fourier representations ,\u201d SPIE Conference , Wavelets , 2005 . {GMS05} A. Gilbert, M. Muthukrishnan, and M. Strauss, \u201cImproved time bounds for near-optimal space Fourier representations,\u201d SPIE Conference, Wavelets, 2005."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.915000"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348543.2348587"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214029"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095209"},{"key":"e_1_3_2_2_24_1","volume-title":"Samp. Theory Apps. (SAMPTA)","author":"Heider S.","year":"2013","unstructured":"{HKPV13} S. Heider , S. Kunis , D. Potts , and M. Veit , \u201c A sparse Prony FFT ,\u201d Samp. Theory Apps. (SAMPTA) , 2013 . {HKPV13} S. Heider, S. Kunis, D. Potts, and M. Veit, \u201cA sparse Prony FFT,\u201d Samp. Theory Apps. (SAMPTA), 2013."},{"key":"e_1_3_2_2_25_1","first-page":"253","article-title":"Maintaining discrete probability distributions optimally","author":"Hagerup T.","year":"1993","unstructured":"{HMM93} T. Hagerup , K. Mehlhorn , and J. I. Munro , \u201c Maintaining discrete probability distributions optimally ,\u201d in Int. Coll.. Auto., Lang., and Prog. (ICALP) , 1993 , pp. 253 \u2013 264 . {HMM93} T. Hagerup, K. Mehlhorn, and J. I. Munro, \u201cMaintaining discrete probability distributions optimally,\u201d in Int. Coll.. Auto., Lang., and Prog. (ICALP), 1993, pp. 253\u2013264.","journal-title":"Int. Coll.. Auto., Lang., and Prog. (ICALP)"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.61"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634110"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-39206-1_48"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/3115488.3115864"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897650"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103466"},{"key":"e_1_3_2_2_32_1","volume-title":"Adaptive sub-linear time Fourier algorithms","author":"Lawlor D.","year":"2012","unstructured":"{LWC12} D. Lawlor , Y. Wang , and A. Christlieb , \u201c Adaptive sub-linear time Fourier algorithms ,\u201d 2012 , http:\/\/arxiv.org\/abs\/1207.6368. {LWC12} D. Lawlor, Y. Wang, and A. Christlieb, \u201cAdaptive sub-linear time Fourier algorithms,\u201d 2012, http:\/\/arxiv.org\/abs\/1207.6368."},{"key":"e_1_3_2_2_33_1","volume-title":"Int. Coll. Auto., Lang., and Prog. (ICALP)","author":"Mansour Y.","year":"1992","unstructured":"{Man92} Y. Mansour , \u201c Randomized interpolation and approximation of sparse polynomials ,\u201d Int. Coll. Auto., Lang., and Prog. (ICALP) , 1992 . {Man92} Y. Mansour, \u201cRandomized interpolation and approximation of sparse polynomials,\u201d Int. Coll. Auto., Lang., and Prog. (ICALP), 1992."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620269"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.42"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.92"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20227"}],"event":{"name":"STOC '17: Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Montreal Canada","acronym":"STOC '17"},"container-title":["Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055462","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3055399.3055462","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:19Z","timestamp":1750217779000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3055399.3055462"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,19]]},"references-count":37,"alternative-id":["10.1145\/3055399.3055462","10.1145\/3055399"],"URL":"https:\/\/doi.org\/10.1145\/3055399.3055462","relation":{},"subject":[],"published":{"date-parts":[[2017,6,19]]},"assertion":[{"value":"2017-06-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}