{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T14:14:54Z","timestamp":1778336094574,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,5,19]],"date-time":"2012-05-19T00:00:00Z","timestamp":1337385600000},"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":[[2012,5,19]]},"DOI":"10.1145\/2213977.2214029","type":"proceedings-article","created":{"date-parts":[[2012,5,21]],"date-time":"2012-05-21T15:20:35Z","timestamp":1337613635000},"page":"563-578","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":193,"title":["Nearly optimal sparse fourier transform"],"prefix":"10.1145","author":[{"given":"Haitham","family":"Hassanieh","sequence":"first","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"given":"Piotr","family":"Indyk","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"given":"Dina","family":"Katabi","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]},{"given":"Eric","family":"Price","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,5,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/645415.652239"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946355"},{"key":"e_1_3_2_2_3_1","first-page":"381","volume-title":"COLT","author":"Akavia A.","year":"2010"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/252493.252633"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/129837"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/060676258"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509933"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/73007.73010"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806755"},{"key":"e_1_3_2_2_12_1","volume-title":"Wavelets","author":"Gilbert A.","year":"2005"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.915000"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"H. Hassanieh P. Indyk D. Katabi and E. Price. sFFT: Sparse Fast Fourier Transform. http:\/\/groups.csail.mit.edu\/netmit\/sFFT\/ 2012.  H. Hassanieh P. Indyk D. Katabi and E. Price. sFFT: Sparse Fast Fourier Transform. http:\/\/groups.csail.mit.edu\/netmit\/sFFT\/ 2012.","DOI":"10.1145\/2213977.2214029"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095209"},{"key":"e_1_3_2_2_16_1","volume-title":"Sams","author":"Heiskala Juha","year":"2001"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.83"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9057-1"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1988.21923"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103466"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/174130.174138"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-008-0329-9"},{"key":"e_1_3_2_2_23_1","volume-title":"ICALP","author":"Mansour Y.","year":"1992"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.18637\/jss.v011.i04"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807188"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374458"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.92"}],"event":{"name":"STOC'12: Symposium on Theory of Computing","location":"New York New York USA","acronym":"STOC'12","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the forty-fourth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214029","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2213977.2214029","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:20:54Z","timestamp":1750238454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2213977.2214029"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,19]]},"references-count":27,"alternative-id":["10.1145\/2213977.2214029","10.1145\/2213977"],"URL":"https:\/\/doi.org\/10.1145\/2213977.2214029","relation":{},"subject":[],"published":{"date-parts":[[2012,5,19]]},"assertion":[{"value":"2012-05-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}