@InProceedings{ngo_et_al:LIPIcs.STACS.2012.230,
author = {Ngo, Hung Q. and Porat, Ely and Rudra, Atri},
title = {{Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion}},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science (STACS 2012)},
pages = {230--241},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-35-4},
ISSN = {1868-8969},
year = {2012},
volume = {14},
editor = {D\"{u}rr, Christoph and Wilke, Thomas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2012.230},
URN = {urn:nbn:de:0030-drops-34011},
doi = {10.4230/LIPIcs.STACS.2012.230},
annote = {Keywords: Compressed Sensing, Sub-Linear Time Decoding, List-Recoverable Codes}
}