J. A. Tropp, Greed is Good: Algorithmic Results for Sparse Approximation, IEEE Transactions on Information Theory, vol.50, issue.10, pp.2231-2242, 2004.
DOI : 10.1109/TIT.2004.834793
URL : http://authors.library.caltech.edu/9035/1/TROieeetit04a.pdf

J. A. Tropp, Just relax: Convex programming methods for subset selection and sparse approximation, IEEE Trans. Information Theory, vol.51, issue.3, pp.1030-1051, 2006.
DOI : 10.1109/tit.2005.864420
URL : http://authors.library.caltech.edu/9040/1/TROieeetit06.pdf

D. Donoho, M. Elad, and V. Temlyakov, Stable recovery of sparse overcomplete representations in the presence of noise, IEEE Transactions on Information Theory, vol.52, issue.1, 2006.
DOI : 10.1109/TIT.2005.860430

Z. Luo, M. Gaspar, J. Liu, and A. Swami, Distributed signal processing in sensor networks, IEEE Signal processing magazine, vol.23, issue.4, pp.14-15, 2006.

D. Baron, M. F. Duarte, S. Sarvotham, M. B. Wakin, and R. G. Baraniuk, An information-theoretic approach to distributed compressed sensing, Proc. 45rd Conference on Communication , Control, and Computing, 2005.

J. A. Tropp, A. C. Gilbert, and M. J. Strauss, Algorithms for simultaneous sparse approximations. Part I: Greedy pursuit Signal Processing, special issue " Sparse approximations in signal and image processing, pp.572-588, 2006.

K. Schnass and P. Vandergheynst, Deterministic measurement ensembles for greedy algorithms, Submitted to IEEE Transactions on Signal Processing, 2006.

R. Gribonval, M. Nielsen, and P. Vandergheynst, Towards an adaptive computational strategy for sparse signal approximation, IRISA preprint, 2006.

R. Gribonval, H. Rauhut, K. Schnass, and P. Vandergheynst, Average case analysis of multichannel thresholding and greedy algorithms

M. Ledoux, The Concentration of Measure Phenomenon, 2001.
DOI : 10.1090/surv/089