# Where is randomness needed to break the square-root bottleneck?

### BibTeX Reference

Warning: This BibTeX entry is automatically generated from the database. As there is no one-to-one match between the database fields and the BibTeX format, there may be errors in the entry. Regard the BibTeX feature as experimental for now. Use with care and correct errors and omissions manually.
 @conference{isit2010KDB,     author = {Kuppinger, Patrick and Durisi, Giuseppe and Bölcskei, Helmut},     title = {Where is randomness needed to break the square-root bottleneck?},     booktitle = {Proc. of IEEE International Symposium on Information Theory (ISIT), Austin, TX},     pages = {1578--1582},     month = jun,     year = 2010,     keywords = {Compressed sensing, square-root bottleneck, probabilistic sampling},     url = {http://www.nari.ee.ethz.ch/pubs/p/isit2010KDB} } 
 \bibitem{isit2010KDB} P. Kuppinger, G. Durisi, and H. Bölcskei, Where is randomness needed to break the square-root bottleneck?,'' \emph{Proc. of IEEE International Symposium on Information Theory (ISIT), Austin, TX}, pp. 1578-1582, June 2010. 
 P. Kuppinger, G. Durisi, and H. Bölcskei, "Where is randomness needed to break the square-root bottleneck?," Proc. of IEEE International Symposium on Information Theory (ISIT), Austin, TX, pp. 1578-1582, June 2010.