{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T08:24:54Z","timestamp":1775031894405,"version":"3.50.1"},"reference-count":41,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1109\/allerton.2008.4797639","type":"proceedings-article","created":{"date-parts":[[2009,3,9]],"date-time":"2009-03-09T15:05:03Z","timestamp":1236611103000},"page":"798-805","source":"Crossref","is-referenced-by-count":228,"title":["Combining geometry and combinatorics: A unified approach to sparse signal recovery"],"prefix":"10.1109","author":[{"given":"R.","family":"Berinde","sequence":"first","affiliation":[]},{"given":"A. C.","family":"Gilbert","sequence":"additional","affiliation":[]},{"given":"P.","family":"Indyk","sequence":"additional","affiliation":[]},{"given":"H.","family":"Karloff","sequence":"additional","affiliation":[]},{"given":"M. J.","family":"Strauss","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/859716.859719"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2027773"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286462"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261573"},{"key":"18","article-title":"fast reconstruction of piecewise smooth signals from random projections","author":"duarte","year":"2005","journal-title":"Proc SPARS"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"34","author":"needell","year":"2007","journal-title":"Uniform uncertainty principle and signal recovery via Regularized Orthogonal Matching Pursuit"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-005-1220-0"},{"key":"39","year":"0"},{"key":"13","article-title":"subspace pursuit for compressive sensing: closing the gap between performance and complexity","author":"dai","year":"2008","journal-title":"Arxiv 0803 0811"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250804"},{"key":"37","year":"0"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2007.914730"},{"key":"38","doi-asserted-by":"publisher","DOI":"10.1007\/s102080010029"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1016\/j.jco.2007.04.002"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509966"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509933"},{"key":"41","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2007.4313110"},{"key":"40","article-title":"a new compressive imaging camera architecture using optical-domain compression","author":"takhar","year":"2006","journal-title":"Proc IS&T\/SPIE Symposium on Electronic Imaging"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2003.1198389"},{"key":"23","article-title":"almost euclidean subspaces of l1 via expander codes","author":"guruswami","year":"2008","journal-title":"SODA"},{"key":"24","year":"0","journal-title":"Compressed Sensing Resources"},{"key":"25","article-title":"algorithmic linear dimension reduction in the l1 norm for sparse vectors","author":"gilbert","year":"2006"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250824"},{"key":"27","year":"0"},{"key":"28","article-title":"explicit constructions for compressed sensing of sparse signals","author":"indyk","year":"2008","journal-title":"SODA"},{"key":"29","article-title":"fast and effective sparse recovery using sparse random matrices","author":"indyk","year":"2008"},{"key":"3","article-title":"sparse recovery using sparse random matrices","author":"berinde","year":"2008","journal-title":"MIT-CSAIL Technical Report"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797639"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510003"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1545"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1134\/S0001434607110193"},{"key":"7","year":"0"},{"key":"6","article-title":"a negative result concerning explicit matrices with the restricted isometry property","author":"chandar","year":"2008"},{"key":"32","year":"0"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1090\/S0894-0347-08-00610-3"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792239291"},{"key":"4","author":"charikar","year":"2002","journal-title":"Finding frequent items in data streamsiICALP"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2006.286461"}],"event":{"name":"2008 46th Annual Allerton Conference on Communication, Control, and Computing","location":"Monticello, IL, USA","start":{"date-parts":[[2008,9,23]]},"end":{"date-parts":[[2008,9,26]]}},"container-title":["2008 46th Annual Allerton Conference on Communication, Control, and Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/4786970\/4797526\/04797639.pdf?arnumber=4797639","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T14:05:16Z","timestamp":1489759516000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/4797639\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,9]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/allerton.2008.4797639","relation":{},"subject":[],"published":{"date-parts":[[2008,9]]}}}