{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T02:41:43Z","timestamp":1781923303173,"version":"3.54.5"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540354741","type":"print"},{"value":"9783540354758","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11780823_22","type":"book-chapter","created":{"date-parts":[[2006,6,23]],"date-time":"2006-06-23T10:45:59Z","timestamp":1151059559000},"page":"280-294","source":"Crossref","is-referenced-by-count":44,"title":["Combinatorial Algorithms for Compressed Sensing"],"prefix":"10.1007","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Akavia, A., Goldwasser, S., Safra, S.: Proving hard-core predicates by list decoding. In: FOCS, pp. 146\u2013157 (2003)","DOI":"10.1109\/SFCS.2003.1238189"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E., Romberg, J., Tao, T.: Stable signals recovery from incomplete and inaccurate measurements (unpublished manuscript, 2005)","DOI":"10.1117\/12.620143"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Cand\u00e8s, E., Rudelson, M., Tao, T., Vershynin, R.: Error correction via linear programming. In: FOCS (2005)","DOI":"10.1109\/SFCS.2005.5464411"},{"key":"22_CR4","unstructured":"Cand\u00e8s, E., Tao, T.: Near optimal signal recovery from random projections and universal encoding strategies (2004), http:\/\/arxiv.org\/abs\/math.CA\/0410542"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: SODA (2001)","DOI":"10.1145\/383962.384040"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: Tracking most frequent items dynamically. In: ACM PODS (2003)","DOI":"10.1145\/773153.773182"},{"key":"22_CR7","unstructured":"Cormode, G., Muthukrishnan, S.: Towards an algorithmic theory of compressed sensing. DIMACS Tech Report 2005-25 (2005)"},{"key":"22_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02888-9","volume-title":"Constructive Approximation","author":"R. Devore","year":"1993","unstructured":"Devore, R., Lorentz, G.G.: Constructive Approximation, vol.\u00a0303. Springer, Grundlehren (1993)"},{"key":"22_CR9","unstructured":"Donoho, D.: Compressed sensing (unpublished manuscript, 2004)"},{"key":"22_CR10","series-title":"Series on Applied Mathematics","doi-asserted-by":"publisher","DOI":"10.1142\/9789812798183","volume-title":"Combinatorial Group Testing and Its Applications","author":"D.-Z. Du","year":"1993","unstructured":"Du, D.-Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. Series on Applied Mathematics, vol.\u00a03. World Scientific, Singapore (1993)"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Gilbert, A., Guha, S., Indyk, P., Kotidis, Y., Muthukrishnan, S., Strauss, M.: Fast, small-space algorithms for approximate histogram maintenance. In: STOC (2002)","DOI":"10.1145\/509907.509966"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Gilbert, A., Guha, S., Indyk, P., Muthukrishnan, S., Strauss, M.: Near-optimal sparse Fourier representation via sampling. In: STOC (2002)","DOI":"10.1145\/509907.509933"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Gilbert, A., Muthukrishnan, S., Strauss, M.: Improved time bounds for near-optimal sparse Fourier representations. In: SPIE Conference on Wavelets (2005)","DOI":"10.1117\/12.615931"},{"key":"22_CR14","unstructured":"Haupt, J., Nowak, R.: Signal reconstruction from noisy random projections, (unpublished manuscript, 2005)"},{"key":"22_CR15","unstructured":"IEEE International Conference on Acoustics, Speech, and Signal Processing (2005)"},{"key":"22_CR16","unstructured":"Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: SODA (2002)"},{"key":"22_CR17","unstructured":"Indyk, P.: Personal communication (2005)"},{"key":"22_CR18","unstructured":"Integration of Sensing and Processing, Workshop at IMA (2005)"},{"key":"22_CR19","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"W.H. Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.R.: Nonrandom binary superimposed codes. IEEE Transactions on on Information Theory\u00a010, 363\u2013377 (1964)","journal-title":"IEEE Transactions on on Information Theory"},{"issue":"6","key":"22_CR20","doi-asserted-by":"publisher","first-page":"1331","DOI":"10.1137\/0222080","volume":"22","author":"E. Kushilevitz","year":"1993","unstructured":"Kushilevitz, E., Mansour, Y.: Learning decision trees using the fourier spectrum. SIAM Journal on Computing\u00a022(6), 1331\u20131348 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Mansour, Y.: Randomized interpoloation and approximation of sparse polynomials. SIAM Journal of Computing\u00a024(2) (1995)","DOI":"10.1137\/S0097539792239291"},{"key":"22_CR22","unstructured":"Compressed sensing website, http:\/\/www.dsp.ece.rice.edu\/CS\/"},{"key":"22_CR23","unstructured":"Rudelson, M., Vershynin, R.: Geometric approach to error correcting codes and reconstruction of signals (unpublished manuscript, 2005)"},{"key":"22_CR24","unstructured":"Tropp, J., Gilbert, A.: Signal recovery from partial information via orthogonal matching pursuit (unpublished manuscript, 2005)"},{"key":"22_CR25","unstructured":"Tsaig, Y., Donoho, D.: Extensions of compressed sensing (unpublished manuscript, 2004)"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11780823_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:17:12Z","timestamp":1619493432000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11780823_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354741","9783540354758"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11780823_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}