Kaba, Mustafa D., Zhao, Mengnan, Vidal, Rene, Robinson, Daniel P., and Mallada, Enrique. What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?. Retrieved from https://par.nsf.gov/biblio/10314978. IEEE Transactions on Information Theory 67.5 Web. doi:10.1109/TIT.2021.3067280.

Kaba, Mustafa D., Zhao, Mengnan, Vidal, Rene, Robinson, Daniel P., & Mallada, Enrique. What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?. IEEE Transactions on Information Theory, 67 (5). Retrieved from https://par.nsf.gov/biblio/10314978. https://doi.org/10.1109/TIT.2021.3067280

Kaba, Mustafa D., Zhao, Mengnan, Vidal, Rene, Robinson, Daniel P., and Mallada, Enrique. "What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?". IEEE Transactions on Information Theory 67 (5). Country unknown/Code not available. https://doi.org/10.1109/TIT.2021.3067280. https://par.nsf.gov/biblio/10314978.

@article{osti_10314978,
place = {Country unknown/Code not available}, title = {What is the Largest Sparsity Pattern That Can Be Recovered by 1-Norm Minimization?}, url = {https://par.nsf.gov/biblio/10314978}, DOI = {10.1109/TIT.2021.3067280}, abstractNote = {}, journal = {IEEE Transactions on Information Theory}, volume = {67}, number = {5}, author = {Kaba, Mustafa D. and Zhao, Mengnan and Vidal, Rene and Robinson, Daniel P. and Mallada, Enrique}, }