{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T16:33:50Z","timestamp":1764002030360,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2015,8,11]],"date-time":"2015-08-11T00:00:00Z","timestamp":1439251200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft (DE)","doi-asserted-by":"publisher","award":["PL 170\/16-1"],"award-info":[{"award-number":["PL 170\/16-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Numer Algor"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s11075-015-0028-0","type":"journal-article","created":{"date-parts":[[2015,8,9]],"date-time":"2015-08-09T21:36:56Z","timestamp":1439156216000},"page":"889-905","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["A deterministic sparse FFT algorithm for vectors with small support"],"prefix":"10.1007","volume":"71","author":[{"given":"Gerlind","family":"Plonka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katrin","family":"Wannenwetsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"key":"28_CR1","unstructured":"Akavia, A.: Deterministic sparse Fourier approximation via fooling arithmetic progressions. In: Proc. 23rd COLT, pp. 381\u2013393 (2010)"},{"issue":"3","key":"28_CR2","doi-asserted-by":"crossref","first-page":"1733","DOI":"10.1109\/TIT.2013.2290027","volume":"60","author":"A Akavia","year":"2014","unstructured":"Akavia, A.: Deterministic sparse Fourier approximation via approximating arithmetic progressions. IEEE Trans. Inform. Theory 60(3), 1733\u20131741 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"5","key":"28_CR3","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/MSP.2014.2329131","volume":"31","author":"A Gilbert","year":"2014","unstructured":"Gilbert, A., Indyk, P., Iwen, M.A., Schmidt, L.: Recent developments in the sparse Fourier transform. IEEE Signal Process. Mag. 31(5), 91\u2013100 (2014)","journal-title":"IEEE Signal Process. Mag."},{"issue":"4","key":"28_CR4","doi-asserted-by":"crossref","first-page":"1022","DOI":"10.1137\/S0036142997331335","volume":"36","author":"JJ Green","year":"1999","unstructured":"Green, J.J.: Calculating the maximum modulus of a polynomial using Ste\u010dkin\u2019s Lemma, SIAM. J. Numer. Anal 36(4), 1022\u20131029 (1999)","journal-title":"J. Numer. Anal"},{"key":"28_CR5","doi-asserted-by":"crossref","unstructured":"Hassanieh, H., Indyk, P., Katabi, D., Price, E.: Near-optimal algorithm for sparse Fourier transform. In: Proceedings 44th annual ACM symposium on Theory of Computing, pp. 563\u2013578 (2012)","DOI":"10.1145\/2213977.2214029"},{"key":"28_CR6","doi-asserted-by":"crossref","unstructured":"Hassanieh, H., Indyk, P., Katabi, D., Price, E.: Simple and practical algorithm for sparse Fourier transform. In: Proceedings 23th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201912), pp. 1183\u20131194 (2012)","DOI":"10.1137\/1.9781611973099.93"},{"key":"28_CR7","unstructured":"Heider, S., Kunis, S., Potts, D., Veit, M.: A sparse Prony FFT. In: Proceedings 10th International Conference on Sampling Theory and Applications (SAMPTA), pp. 572\u2013575 (2013)"},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Indyk, P., Kapralov, M., Price, E.: (Nearly) sample-optimal Fourier transform. In: Proceedings 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 14), pp. 480\u2013499 (2014)","DOI":"10.1137\/1.9781611973402.36"},{"key":"28_CR9","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10208-009-9057-1","volume":"10","author":"MA Iwen","year":"2010","unstructured":"Iwen, M.A.: Combinatorial sublinear-time Fourier algorithms. Found. Comput. Math 10, 303\u2013338 (2010)","journal-title":"Found. Comput. Math"},{"key":"28_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.acha.2012.03.007","volume":"34","author":"MA Iwen","year":"2013","unstructured":"Iwen, M.A.: Improved approximation guarantees for sublinear-time Fourier algorithms. Appl. Comput. Harmon. Anal 34, 57\u201382 (2013)","journal-title":"Appl. Comput. Harmon. Anal"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Lawlor, D., Wang, Y., Christlieb, A.: Adaptive sub-linear time Fourier algorithms, Advances in Adaptive Data Analysis 5(1), 1350003 (25 pages) (2013)","DOI":"10.1142\/S1793536913500039"},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Pawar, S., Ramchandran, K.: Computing a k-sparse N-length discrete Fourier transform using at most 4k samples and O ( k log k ) ${\\mathcal O}(k \\log k)$ complexity. IEEE International Symposium on Information Theory, pp. 464\u2013468 (2013)","DOI":"10.1109\/ISIT.2013.6620269"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"Potts, D., Steidl, G., Tasche, M.: Fast Fourier transforms for nonequispaced data: A tutorial. In: Benedetto, J.J., Ferreira, P.J.S.G. (eds.) In Modern Sampling Theory: Mathematics and Applications, pp. 247\u2013270. Birkh\u00e4user, Boston, MA (2001)","DOI":"10.1007\/978-1-4612-0143-4_12"},{"issue":"2","key":"28_CR14","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1002\/gamm.201410011","volume":"37","author":"G Plonka","year":"2014","unstructured":"Plonka, G., Tasche, M.: Prony methods for recovery of structured functions. GAMM-Mitt 37(2), 239\u2013258 (2014)","journal-title":"GAMM-Mitt"},{"key":"28_CR15","volume-title":"High performance sparse fast Fourier transform, Master Thesis, Computer Science","author":"J Schumacher","year":"2013","unstructured":"Schumacher, J.: High performance sparse fast Fourier transform, Master Thesis, Computer Science. ETH Z\u00fcrich, Switzerland (2013)"}],"container-title":["Numerical Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-015-0028-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11075-015-0028-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11075-015-0028-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,29]],"date-time":"2019-08-29T01:37:59Z","timestamp":1567042679000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11075-015-0028-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,11]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["28"],"URL":"https:\/\/doi.org\/10.1007\/s11075-015-0028-0","relation":{},"ISSN":["1017-1398","1572-9265"],"issn-type":[{"type":"print","value":"1017-1398"},{"type":"electronic","value":"1572-9265"}],"subject":[],"published":{"date-parts":[[2015,8,11]]}}}