Citáce podľa APA (7th ed.)

Ko, S., Yu, D., & Won, J. (2019). Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration. Journal of computational and graphical statistics, 28(4), 821-833. https://doi.org/10.1080/10618600.2019.1592757

Citácia podle Chicago (17th ed.)

Ko, Seyoon, Donghyeon Yu, a Joong-Ho Won. "Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration." Journal of Computational and Graphical Statistics 28, no. 4 (2019): 821-833. https://doi.org/10.1080/10618600.2019.1592757.

Citácia podľa MLA (8th ed.)

Ko, Seyoon, et al. "Easily Parallelizable and Distributable Class of Algorithms for Structured Sparsity, with Optimal Acceleration." Journal of Computational and Graphical Statistics, vol. 28, no. 4, 2019, pp. 821-833, https://doi.org/10.1080/10618600.2019.1592757.

Upozornenie: Tieto citáce sú generované automaticky. Nemusia byť úplne správne podľa citačných pravidiel..