{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,21]],"date-time":"2025-10-21T15:37:59Z","timestamp":1761061079904},"reference-count":65,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T00:00:00Z","timestamp":1592956800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s10208-020-09462-z","type":"journal-article","created":{"date-parts":[[2020,6,24]],"date-time":"2020-06-24T21:11:56Z","timestamp":1593033116000},"page":"275-329","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables"],"prefix":"10.1007","volume":"21","author":[{"given":"Bosu","family":"Choi","sequence":"first","affiliation":[]},{"given":"Mark A.","family":"Iwen","sequence":"additional","affiliation":[]},{"given":"Felix","family":"Krahmer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,24]]},"reference":[{"issue":"3","key":"9462_CR1","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s00365-017-9369-3","volume":"45","author":"B Adcock","year":"2017","unstructured":"B. Adcock. Infinite-dimensional $$\\ell ^{1}$$ minimization and function approximation from pointwise data. Constr. Approx., 45(3):345\u2013390, 2017.","journal-title":"Constr. Approx."},{"key":"9462_CR2","first-page":"93","volume-title":"Compressed Sensing Approaches for Polynomial Approximation of High-Dimensional Functions","author":"B. Adcock","year":"2017","unstructured":"B. Adcock, S. Brugiapaglia, and C. G. Webster. Compressed Sensing Approaches for Polynomial Approximation of High-Dimensional Functions, pages 93\u2013124. Springer International Publishing, Cham, 2017."},{"issue":"1","key":"9462_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0092-8240(89)80052-7","volume":"51","author":"R Arratia","year":"1989","unstructured":"R. Arratia and L. Gordon. Tutorial on large deviations for the binomial distribution. Bull. Math. Biol., 51(1):125\u2013131, 1989.","journal-title":"Bull. Math. Biol."},{"issue":"1","key":"9462_CR4","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1137\/110835864","volume":"33","author":"J Bailey","year":"2012","unstructured":"J. Bailey, M. A. Iwen, and C. V. Spencer. On the design of deterministic matrices for fast recovery of Fourier compressible functions. SIAM J. Matrix Anal. Appl., 33(1):263\u2013289, 2012.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"9462_CR5","unstructured":"S. Bittens, R. Zhang, and M. A. Iwen. A deterministic sparse FFT for functions with structured Fourier sparsity. Adv. Comput. Math., to appear."},{"key":"9462_CR6","unstructured":"J.-L. Bouchot, H. Rauhut, and C. Schwab. Multi-level Compressed Sensing Petrov-Galerkin discretization of high-dimensional parametric PDEs. ArXiv e-prints, Jan. 2017."},{"key":"9462_CR7","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1017\/S0962492904000182","volume":"13","author":"H-J Bungartz","year":"2004","unstructured":"H.-J. Bungartz and M. Griebel. Sparse grids. Acta Numer., 13:147\u2013269, 2004.","journal-title":"Acta Numer."},{"key":"9462_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0962492900002804","volume":"7","author":"RE Caflisch","year":"1998","unstructured":"R. E. Caflisch. Monte Carlo and quasi-Monte Carlo methods. Acta Numer., 7:1\u201349, 1998.","journal-title":"Acta Numer."},{"key":"9462_CR9","doi-asserted-by":"publisher","first-page":"1207","DOI":"10.1002\/cpa.20124","volume":"59","author":"EJ Cande\u00e8s","year":"2006","unstructured":"E. J. Cande\u00e8s, J. Romberg, and T. Tao. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math., 59:1207\u20131223, 2006.","journal-title":"Comm. Pure Appl. Math."},{"key":"9462_CR10","unstructured":"A. Chkifa, N. Dexter, H. Tran, and C. G. Webster. Polynomial approximation via compressed sensing of high-dimensional functions on lower sets. arXiv preprintarXiv:1602.05823, 2016."},{"key":"9462_CR11","doi-asserted-by":"crossref","unstructured":"B. Choi, A. Christlieb, and Y. Wang. High-dimensional sublinear sparse Fourier algorithm. Numer. Algorithms, to appear, 2020.","DOI":"10.1007\/s11075-020-00962-1"},{"key":"9462_CR12","doi-asserted-by":"crossref","unstructured":"B. Choi, A. Christlieb, and Y. Wang. Multiscale high-dimensional sparse Fourier algorithms for noisy data. Mathematics, Computation and Geometry of Data, to appear, 2020.","DOI":"10.4310\/MCGD.2020.v1.n1.a2"},{"key":"9462_CR13","unstructured":"B. Choi and M. Iwen. SHT: Sparse harmonic transforms for learning functions of many variables. https:\/\/math.msu.edu\/markiwen\/Code.html, Aug. 2018."},{"key":"9462_CR14","unstructured":"B. Choi, M. Iwen, and T. Volkmer. Sparse harmonic transforms II: Best $$s$$-term approximation guarantees for bounded orthonormal product bases in sublinear time. arXiv:1909.09564, 2019."},{"key":"9462_CR15","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.acha.2015.04.002","volume":"40","author":"A Christlieb","year":"2016","unstructured":"A. Christlieb, D. Lawlor, and Y. Wang. A multiscale sub-linear time Fourier algorithm for noisy data. Appl. Comput. Harmon. Anal., 40:553\u2013574, 2016.","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"9462_CR16","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1090\/S0894-0347-08-00610-3","volume":"22","author":"A Cohen","year":"2009","unstructured":"A. Cohen, W. Dahmen, and R. DeVore. Compressed sensing and best $$k$$-term approximation. J. Amer. Math. Soc., 22(1):211\u2013231, 2009.","journal-title":"J. Amer. Math. Soc."},{"key":"9462_CR17","volume-title":"Numerical Methods in Scientific Computing:","author":"G Dahlquist","year":"2008","unstructured":"G. Dahlquist and \u00c5. Bj\u00f6rck. Numerical Methods in Scientific Computing: Volume 1. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2008."},{"issue":"11","key":"9462_CR18","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"I. Daubechies, M. Defrise, and C. De Mol. An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Comm. Pure Appl. Math., 57(11):1413\u20131457, 2004.","journal-title":"Comm. Pure Appl. Math."},{"issue":"1","key":"9462_CR19","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s00365-010-9105-8","volume":"33","author":"R DeVore","year":"2011","unstructured":"R. DeVore, G. Petrova, and P. Wojtaszczyk. Approximation of functions of few variables in high dimensions. Constr. Approx., 33(1):125\u2013143, 2011.","journal-title":"Constr. Approx."},{"issue":"4","key":"9462_CR20","doi-asserted-by":"publisher","first-page":"1289","DOI":"10.1109\/TIT.2006.871582","volume":"52","author":"DL Donoho","year":"2006","unstructured":"D. L. Donoho. Compressed sensing. IEEE Trans. Inform. Theory, 52(4):1289\u20131306, 2006.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9462_CR21","unstructured":"D. D\u0169ng, V. N. Temlyakov, and T. Ullrich. Hyperbolic cross approximation. arXiv preprintarXiv:1601.03978, 2016."},{"issue":"6","key":"9462_CR22","doi-asserted-by":"publisher","first-page":"2543","DOI":"10.1137\/100806278","volume":"49","author":"S Foucart","year":"2011","unstructured":"S. Foucart. Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J. Numer. Anal., 49(6):2543\u20132563, 2011.","journal-title":"SIAM J. Numer. Anal."},{"key":"9462_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-8176-4948-7","volume-title":"A mathematical introduction to compressive sensing","author":"S Foucart","year":"2013","unstructured":"S. Foucart and H. Rauhut. A mathematical introduction to compressive sensing. Springer, Berlin, 2013."},{"issue":"2","key":"9462_CR24","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1137\/100816705","volume":"41","author":"A Gilbert","year":"2012","unstructured":"A. Gilbert, Y. Li, E. Porat, and M. Strauss. Approximate sparse recovery: Optimizing time and measurements. SIAM J. Comput., 41(2):436\u2013453, 2012.","journal-title":"SIAM J. Comput."},{"key":"9462_CR25","doi-asserted-by":"crossref","unstructured":"A. Gilbert, M. Strauss, J. Tropp, and R. Vershynin. Sublinear approximation of compressible signals. Proc. SPIE Intell. Integrated Microsystems (IIM), page 623, 2006.","DOI":"10.1117\/12.669596"},{"issue":"5","key":"9462_CR26","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/MSP.2014.2329131","volume":"31","author":"AC Gilbert","year":"2014","unstructured":"A. C. Gilbert, P. Indyk, M. Iwen, and L. Schmidt. Recent developments in the sparse Fourier transform: a compressed Fourier transform for big data. IEEE Signal Processing Magazine, 31(5):91\u2013100, 2014.","journal-title":"IEEE Signal Processing Magazine"},{"key":"9462_CR27","doi-asserted-by":"crossref","unstructured":"A. C. Gilbert, M. A. Iwen, and M. J. Strauss. Group testing and sparse signal recovery. In 42nd Asilomar Conference on Signals, Systems, and Computers, 2008.","DOI":"10.1109\/ACSSC.2008.5074574"},{"issue":"3","key":"9462_CR28","doi-asserted-by":"publisher","first-page":"32:1","DOI":"10.1145\/3039872","volume":"13","author":"AC Gilbert","year":"2017","unstructured":"A. C. Gilbert, Y. Li, E. Porat, and M. J. Strauss. For-all sparse recovery in near-optimal time. ACM Trans. Algorithms, 13(3):32:1\u201332:26, Mar. 2017.","journal-title":"ACM Trans. Algorithms"},{"key":"9462_CR29","doi-asserted-by":"crossref","unstructured":"A. C. Gilbert, S. Muthukrishnan, and M. Strauss. Improved time bounds for near-optimal sparse Fourier representations. In Proceedings of SPIE, volume 5914, page 59141A, 2005.","DOI":"10.1117\/12.615931"},{"key":"9462_CR30","doi-asserted-by":"crossref","unstructured":"A. C. Gilbert, M. J. Strauss, J. A. Tropp, and R. Vershynin. One sketch for all: Fast algorithms for compressed sensing. In Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing, STOC \u201907, pages 237\u2013246, New York, NY, USA, 2007. ACM.","DOI":"10.1145\/1250790.1250824"},{"issue":"3","key":"9462_CR31","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1137\/S003614450343200X","volume":"46","author":"L Greengard","year":"2004","unstructured":"L. Greengard and J.-Y. Lee. Accelerating the nonuniform fast Fourier transform. SIAM Rev., 46(3):443\u2013454, 2004.","journal-title":"SIAM Rev."},{"key":"9462_CR32","unstructured":"C. Gross, M. A. Iwen, L. K\u00e4mmerer, and T. Volkmer. A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size. arXiv:2003.09753, 2020."},{"key":"9462_CR33","doi-asserted-by":"crossref","unstructured":"H. Hassanieh, P. Indyk, D. Katabi, and E. Price. Simple and practical algorithm for sparse Fourier transform. In Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms, pages 1183\u20131194. Society for Industrial and Applied Mathematics, 2012.","DOI":"10.1137\/1.9781611973099.93"},{"issue":"290","key":"9462_CR34","doi-asserted-by":"publisher","first-page":"2853","DOI":"10.1090\/S0025-5718-2014-02855-X","volume":"83","author":"A Hinrichs","year":"2014","unstructured":"A. Hinrichs, E. Novak, M. Ullrich, and H. Wo\u017aniakowski. The curse of dimensionality for numerical integration of smooth functions. Math. Comp., 83(290):2853\u20132863, 2014.","journal-title":"Math. Comp."},{"key":"9462_CR35","doi-asserted-by":"crossref","unstructured":"X. Hu, M. Iwen, and H. Kim. Rapidly computing sparse Legendre expansions via sparse Fourier transforms. Numer. Algorithms, pages 1\u201331, 2015.","DOI":"10.1007\/s11075-016-0184-x"},{"key":"9462_CR36","doi-asserted-by":"crossref","unstructured":"P. Indyk and M. Kapralov. Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time. 2014.","DOI":"10.1109\/FOCS.2014.61"},{"issue":"4","key":"9462_CR37","doi-asserted-by":"publisher","first-page":"981","DOI":"10.4310\/CMS.2007.v5.n4.a13","volume":"5","author":"M Iwen","year":"2007","unstructured":"M. Iwen, A. Gilbert, and M. Strauss. Empirical evaluation of a sub-linear time sparse DFT algorithm. Commun. Math. Sci., 5(4):981\u2013998, 2007.","journal-title":"Commun. Math. Sci."},{"key":"9462_CR38","unstructured":"M. A. Iwen. A deterministic sub-linear time sparse Fourier algorithm via non-adaptive compressed sensing methods. In Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, pages 20\u201329. Society for Industrial and Applied Mathematics, 2008."},{"issue":"3","key":"9462_CR39","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10208-009-9057-1","volume":"10","author":"MA Iwen","year":"2010","unstructured":"M. A. Iwen. Combinatorial sublinear-time Fourier algorithms. Found. Comput. Math., 10(3):303\u2013338, 2010.","journal-title":"Found. Comput. Math."},{"issue":"1","key":"9462_CR40","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.acha.2012.03.007","volume":"34","author":"MA Iwen","year":"2013","unstructured":"M. A. Iwen. Improved approximation guarantees for sublinear-time Fourier algorithms. Appl. Comput. Harmon. Anal., 34(1):57\u201382, 2013.","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"1","key":"9462_CR41","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jco.2013.08.001","volume":"30","author":"MA Iwen","year":"2014","unstructured":"M. A. Iwen. Compressed sensing with sparse binary matrices: Instance optimal error guarantees in near-optimal time. J. Complexity, 30(1):1\u201315, 2014.","journal-title":"J. Complexity"},{"key":"9462_CR42","unstructured":"L. K\u00e4mmerer, D. Potts, and T. Volkmer. High-dimensional sparse FFT based on sampling along multiple rank-1 lattices. arXiv preprintarXiv:1711.05152, 2017."},{"key":"9462_CR43","doi-asserted-by":"crossref","unstructured":"M. Kapralov. Sparse Fourier transform in any constant dimension with nearly-optimal sample complexity in sublinear time. arXiv 1604.00845, 2016.","DOI":"10.1145\/2897518.2897650"},{"issue":"2","key":"9462_CR44","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1109\/TIP.2013.2288004","volume":"23","author":"F Krahmer","year":"2014","unstructured":"F. Krahmer and R. Ward. Stable and robust sampling strategies for compressive imaging. IEEE Trans. Image Process., 23(2):612\u2013622, 2014.","journal-title":"IEEE Trans. Image Process."},{"key":"9462_CR45","unstructured":"F. Y. Kuo, G. Migliorati, F. Nobile, and D. Nuyens. Function integration, reconstruction and approximation using rank-1 lattices. arXiv:1908.01178, 2019."},{"key":"9462_CR46","doi-asserted-by":"crossref","unstructured":"G. Leobacher and F. Pillichshammer. Introduction to Quasi-Monte Carlo Integration and Applications. Compact Textbooks in Mathematics. Springer International Publishing, 2014.","DOI":"10.1007\/978-3-319-03425-6"},{"key":"9462_CR47","doi-asserted-by":"crossref","unstructured":"S. Merhi, R. Zhang, M. A. Iwen, and A. Christlieb. A new class of fully discrete sparse Fourier transforms: Faster stable implementations with guarantees. J. Fourier Anal. Appl., https:\/\/doi.org\/10.1007\/s00041-018-9616-4, 2018.","DOI":"10.1007\/s00041-018-9616-4"},{"issue":"2","key":"9462_CR48","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1016\/j.acha.2016.06.001","volume":"43","author":"L Morotti","year":"2017","unstructured":"L. Morotti. Explicit universal sampling sets in finite vector spaces. Appl. Comput. Harmon. Anal., 43(2):354\u2013369, 2017.","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"9462_CR49","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R Motwani","year":"1995","unstructured":"R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, 1995."},{"issue":"3","key":"9462_CR50","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.acha.2008.07.002","volume":"26","author":"D Needell","year":"2009","unstructured":"D. Needell and J. A. Tropp. CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal., 26(3):301\u2013321, 2009.","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"2","key":"9462_CR51","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1109\/JSTSP.2010.2042412","volume":"4","author":"D Needell","year":"2010","unstructured":"D. Needell and R. Vershynin. Signal recovery from incomplete and inaccurate measurements via regularized orthogonal matching pursuit. IEEE Journal of selected topics in signal processing, 4(2):310\u2013316, 2010.","journal-title":"IEEE Journal of selected topics in signal processing"},{"issue":"3","key":"9462_CR52","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1016\/j.acha.2015.05.002","volume":"41","author":"D Potts","year":"2016","unstructured":"D. Potts and T. Volkmer. Sparse high-dimensional FFT based on rank-1 lattice sampling. Appl. Comput. Harmon. Anal., 41(3):713\u2013748, 2016.","journal-title":"Appl. Comput. Harmon. Anal."},{"key":"9462_CR53","doi-asserted-by":"crossref","unstructured":"D. Potts and T. Volkmer. Multivariate sparse FFT based on rank-1 Chebyshev lattice sampling. In Sampling Theory and Applications (SampTA), 2017 International Conference on, pages 504\u2013508. IEEE, 2017.","DOI":"10.1109\/SAMPTA.2017.8024341"},{"issue":"1","key":"9462_CR54","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.acha.2006.05.002","volume":"22","author":"H Rauhut","year":"2007","unstructured":"H. Rauhut. Random sampling of sparse trigonometric polynomials. Appl. Comput. Harmon. Anal., 22(1):16\u201342, 2007.","journal-title":"Appl. Comput. Harmon. Anal."},{"issue":"304","key":"9462_CR55","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1090\/mcom\/3113","volume":"86","author":"H Rauhut","year":"2017","unstructured":"H. Rauhut and C. Schwab. Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations. Math. Comp., 86(304):661\u2013700, 2017.","journal-title":"Math. Comp."},{"issue":"5","key":"9462_CR56","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1016\/j.jat.2012.01.008","volume":"164","author":"H Rauhut","year":"2012","unstructured":"H. Rauhut and R. Ward. Sparse Legendre expansions via $$\\ell _1$$-minimization. J. Approx. Theory, 164(5):517\u2013533, 2012.","journal-title":"J. Approx. Theory"},{"key":"9462_CR57","doi-asserted-by":"crossref","unstructured":"C. Schwab and R. A. Todor. Karhunen\u2013Lo\u00e8ve approximation of random fields by generalized fast multipole methods. J. Comput. Phys., 217(1):100\u2013122, 2006.","DOI":"10.1016\/j.jcp.2006.01.048"},{"key":"9462_CR58","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s11075-012-9621-7","volume":"63","author":"I Segal","year":"2013","unstructured":"I. Segal and M. Iwen. Improved sparse Fourier approximation results: Faster implementations and stronger guarantees. Numer. Algorithms, 63:239\u2013263, 2013.","journal-title":"Numer. Algorithms"},{"issue":"3","key":"9462_CR59","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1137\/090765547","volume":"48","author":"J Shen","year":"2010","unstructured":"J. Shen and L.-L. Wang. Sparse spectral approximations of high-dimensional problems based on hyperbolic cross. SIAM J. Numer. Anal., 48(3):1087\u20131109, 2010.","journal-title":"SIAM J. Numer. Anal."},{"key":"9462_CR60","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973228","volume-title":"Uncertainty Quantification: Theory, Implementation, and Applications","author":"RC Smith","year":"2013","unstructured":"R. C. Smith. Uncertainty Quantification: Theory, Implementation, and Applications. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2013."},{"key":"9462_CR61","doi-asserted-by":"crossref","unstructured":"R. Vershynin. Introduction to the non-asymptotic analysis of random matrices. arXiv:1011.3027v7, 2011.","DOI":"10.1017\/CBO9780511794308.006"},{"key":"9462_CR62","unstructured":"T. Volkmer. Multivariate approximation and high-dimensional sparse FFT based on rank-1 lattice sampling. Dissertation (PhD thesis), Faculty of Mathematics, Technische Universit\u00e4t Chemnitz (Chemnitz University of Technology), 2017."},{"key":"9462_CR63","doi-asserted-by":"publisher","DOI":"10.2307\/j.ctv7h0skv","volume-title":"Numerical Methods for Stochastic Computations: A Spectral Method Approach","author":"D Xiu","year":"2010","unstructured":"D. Xiu. Numerical Methods for Stochastic Computations: A Spectral Method Approach. Princeton University Press, Princeton, NJ, USA, 2010."},{"issue":"9","key":"9462_CR64","doi-asserted-by":"publisher","first-page":"6215","DOI":"10.1109\/TIT.2011.2162263","volume":"57","author":"T Zhang","year":"2011","unstructured":"T. Zhang. Sparse recovery with orthogonal matching pursuit under RIP. IEEE Trans. Inform. Theory, 57(9):6215\u20136221, 2011.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"9462_CR65","doi-asserted-by":"crossref","unstructured":"R. Zippel. Probabilistic algorithms for sparse polynomials. In International symposium on symbolic and algebraic manipulation, pages 216\u2013226. Springer, 1979.","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-020-09462-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10208-020-09462-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-020-09462-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,2]],"date-time":"2023-10-02T22:15:40Z","timestamp":1696284940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10208-020-09462-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,24]]},"references-count":65,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9462"],"URL":"https:\/\/doi.org\/10.1007\/s10208-020-09462-z","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,6,24]]},"assertion":[{"value":"15 August 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2020","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}