{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:37Z","timestamp":1750306837805,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T00:00:00Z","timestamp":1402358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1115771"],"award-info":[{"award-number":["1115771"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-13-1-0213"],"award-info":[{"award-number":["FA9550-13-1-0213"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,10]]},"DOI":"10.1145\/2597652.2597669","type":"proceedings-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:50:25Z","timestamp":1402404625000},"page":"93-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Input-adaptive parallel sparse fast fourier transform for stream processing"],"prefix":"10.1145","author":[{"given":"Shuo","family":"Chen","sequence":"first","affiliation":[{"name":"University of Delaware, Newark, DE, USA"}]},{"given":"Xiaoming","family":"Li","sequence":"additional","affiliation":[{"name":"University of Delaware, Newark, DE, USA"}]}],"member":"320","published-online":{"date-parts":[[2014,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"381","volume-title":"The 23rd Conference on Learning Theory","author":"Akavia A.","year":"2010","unstructured":"A. Akavia . Deterministic sparse fourier approximation via fooling arithmetic progressions . In The 23rd Conference on Learning Theory , pages 381 -- 393 , 2010 . A. Akavia. Deterministic sparse fourier approximation via fooling arithmetic progressions. In The 23rd Conference on Learning Theory, pages 381--393, 2010."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946355"},{"issue":"4","key":"e_1_3_2_1_3_1","first-page":"451","article-title":"A linear filtering approach to the computation of discrete Fourier transform. Audio and Electroacoustics","volume":"18","author":"Bluestein L.","year":"1970","unstructured":"L. Bluestein . A linear filtering approach to the computation of discrete Fourier transform. Audio and Electroacoustics , IEEE Transactions on , 18 ( 4 ): 451 -- 455 , 1970 . L. Bluestein. A linear filtering approach to the computation of discrete Fourier transform. Audio and Electroacoustics, IEEE Transactions on, 18(4):451--455, 1970.","journal-title":"IEEE Transactions on"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-1684(90)90158-U"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.840301"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509933"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1117\/12.615931"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1958.tb00300.x"},{"key":"e_1_3_2_1_9_1","first-page":"1183","volume-title":"Proceedings of the 23th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Katabi H. H., I. P., D.","year":"2012","unstructured":"H. H., I. P., D. Katabi , and P. E. Simple and practical algorithm for sparse fourier transform . In Proceedings of the 23th Annual ACM-SIAM Symposium on Discrete Algorithms , pages 1183 -- 1194 . ACM, 2012 . H. H., I. P., D. Katabi, and P. E. Simple and practical algorithm for sparse fourier transform. In Proceedings of the 23th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1183--1194. ACM, 2012."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2214029"},{"key":"e_1_3_2_1_11_1","unstructured":"M. Iwen. AAFFT (Ann Arbor Fast Fourier Transform) http:\/\/sourceforge.net\/projects\/aafftannarborfa\/ 2008.  M. Iwen. AAFFT (Ann Arbor Fast Fourier Transform) http:\/\/sourceforge.net\/projects\/aafftannarborfa\/ 2008."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9057-1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/646246.684842"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103466"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1968.6477"}],"event":{"name":"ICS'14: 2014 International Conference on Supercomputing","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Munich Germany","acronym":"ICS'14"},"container-title":["Proceedings of the 28th ACM international conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2597652.2597669","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2597652.2597669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:09:58Z","timestamp":1750234198000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2597652.2597669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,10]]},"references-count":15,"alternative-id":["10.1145\/2597652.2597669","10.1145\/2597652"],"URL":"https:\/\/doi.org\/10.1145\/2597652.2597669","relation":{},"subject":[],"published":{"date-parts":[[2014,6,10]]},"assertion":[{"value":"2014-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}