Beaumont, Olivier, Langou, Julien, Quach, Willy, and Shilova, Alena. A Makespan Lower Bound for the Tiled Cholesky Factorization Based on ALAP Schedule.. Retrieved from https://par.nsf.gov/biblio/10196276. In: Malawski M., Rzadca K. (eds) Euro-Par 2020: Parallel Processing. Euro-Par 2020. Lecture Notes in Computer Science, vol 12247. Springer, Cham. https://doi.org/10.1007/978-3-030-57675-2_9 . Web. doi:10.1007/978-3-030-57675-2_9.

Beaumont, Olivier, Langou, Julien, Quach, Willy, & Shilova, Alena. A Makespan Lower Bound for the Tiled Cholesky Factorization Based on ALAP Schedule.. In: Malawski M., Rzadca K. (eds) Euro-Par 2020: Parallel Processing. Euro-Par 2020. Lecture Notes in Computer Science, vol 12247. Springer, Cham. https://doi.org/10.1007/978-3-030-57675-2_9, (). Retrieved from https://par.nsf.gov/biblio/10196276. https://doi.org/10.1007/978-3-030-57675-2_9

Beaumont, Olivier, Langou, Julien, Quach, Willy, and Shilova, Alena. "A Makespan Lower Bound for the Tiled Cholesky Factorization Based on ALAP Schedule.". In: Malawski M., Rzadca K. (eds) Euro-Par 2020: Parallel Processing. Euro-Par 2020. Lecture Notes in Computer Science, vol 12247. Springer, Cham. https://doi.org/10.1007/978-3-030-57675-2_9 (). Country unknown/Code not available. https://doi.org/10.1007/978-3-030-57675-2_9. https://par.nsf.gov/biblio/10196276.

@article{osti_10196276,
place = {Country unknown/Code not available}, title = {A Makespan Lower Bound for the Tiled Cholesky Factorization Based on ALAP Schedule.}, url = {https://par.nsf.gov/biblio/10196276}, DOI = {10.1007/978-3-030-57675-2_9}, abstractNote = {}, journal = {In: Malawski M., Rzadca K. (eds) Euro-Par 2020: Parallel Processing. Euro-Par 2020. Lecture Notes in Computer Science, vol 12247. Springer, Cham. https://doi.org/10.1007/978-3-030-57675-2_9}, author = {Beaumont, Olivier and Langou, Julien and Quach, Willy and Shilova, Alena}, }