{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:09:28Z","timestamp":1761059368678},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642325113"},{"type":"electronic","value":"9783642325120"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32512-0_6","type":"book-chapter","created":{"date-parts":[[2012,7,20]],"date-time":"2012-07-20T22:21:08Z","timestamp":1342822868000},"page":"61-72","source":"Crossref","is-referenced-by-count":19,"title":["What\u2019s the Frequency, Kenneth?: Sublinear Fourier Sampling Off the Grid"],"prefix":"10.1007","author":[{"given":"Petros","family":"Boufounos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volkan","family":"Cevher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anna C.","family":"Gilbert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yi","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin J.","family":"Strauss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Mansour, Y.: Learning decision trees using the Fourier spectrum. In: STOC, pp. 455\u2013464 (1991)","key":"6_CR1","DOI":"10.1145\/103418.103466"},{"doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Guha, S., Indyk, P., Muthukrishnan, M., Strauss, M.: Near-optimal sparse fourier representations via sampling. In: STOC, pp. 152\u2013161 (2002)","key":"6_CR2","DOI":"10.1145\/509907.509933"},{"doi-asserted-by":"crossref","unstructured":"Gilbert, A.C., Muthukrishnan, S., Strauss, M.: Improved time bounds for near-optimal sparse Fourier representations. In: Proceedings of Wavelets XI Conference (2005)","key":"6_CR3","DOI":"10.1117\/12.615931"},{"issue":"3","key":"6_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-009-9057-1","volume":"10","author":"M. Iwen","year":"2009","unstructured":"Iwen, M.: Combinatorial sublinear-time Fourier algorithms. Foundations of Computational Mathematics\u00a010(3), 303\u2013338 (2009)","journal-title":"Foundations of Computational Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Hassanieh, H., Indyk, P., Katabi, D., Price, E.: Simple and practical algorithm for sparse Fourier transform. In: SODA, pp. 1183\u20131194 (2012)","key":"6_CR5","DOI":"10.1137\/1.9781611973099.93"},{"doi-asserted-by":"crossref","unstructured":"Hassanieh, H., Indyk, P., Katabi, D., Price, E.: Nearly optimal sparse Fourier transform. In: STOC, pp. 563\u2013578 (2012)","key":"6_CR6","DOI":"10.1145\/2213977.2214029"},{"issue":"6","key":"6_CR7","doi-asserted-by":"publisher","first-page":"1417","DOI":"10.1109\/TSP.2002.1003065","volume":"50","author":"M. Vetterli","year":"2002","unstructured":"Vetterli, M., Marziliano, P., Blu, T.: Sampling signals with finite rate of innovation. IEEE Transactions on Signal Processing\u00a050(6), 1417\u20131428 (2002)","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1137\/100816705","volume":"41","author":"A.C. Gilbert","year":"2012","unstructured":"Gilbert, A.C., Li, Y., Porat, E., Strauss, M.: Approximate sparse recovery: Optimizing time and measurements. SIAM J. Comput.\u00a041(2), 436\u2013453 (2012)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"6_CR9","doi-asserted-by":"publisher","first-page":"1920","DOI":"10.1137\/100790094","volume":"33","author":"T. Peter","year":"2011","unstructured":"Peter, T., Potts, D., Tasche, M.: Nonlinear approximation by sums of exponentials and translates. SIAM J. Sci. Comput.\u00a033(4), 1920\u20131947 (2011)","journal-title":"SIAM J. Sci. Comput."}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32512-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:05:42Z","timestamp":1620129942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32512-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642325113","9783642325120"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32512-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}