| Communication lower bounds for matricized tensor times Khatri-Rao product G Ballard, N Knight, K Rouse 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS …, 2018 | 44 | 2018 |
| General memory-independent lower bound for MTTKRP G Ballard, K Rouse Proceedings of the 2020 SIAM Conference on Parallel Processing for …, 2020 | 13 | 2020 |
| Brief Announcement: Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds H Al Daas, G Ballard, L Grigori, S Kumar, K Rouse Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and …, 2022 | 5 | 2022 |
| Communication lower bounds and optimal algorithms for multiple tensor-times-matrix computation H Al Daas, G Ballard, L Grigori, S Kumar, K Rouse SIAM Journal on Matrix Analysis and Applications 45 (1), 450-477, 2024 | 2 | 2024 |
| Parallel Memory-Independent Communication Bounds for SYRK H Al Daas, G Ballard, L Grigori, S Kumar, K Rouse Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and …, 2023 | 1 | 2023 |
| On the Efficiency of Algorithms for Tensor Decompositions and Their Applications K Rouse Wake Forest University, 2018 | 1 | 2018 |
| Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations HA Daas, G Ballard, L Grigori, S Kumar, K Rouse, M Verite arXiv preprint arXiv:2409.11304, 2024 | | 2024 |
| Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product K Rouse, G Ballard, N Knight arXiv preprint arXiv:1708.07401, 2017 | | 2017 |
Grey BallardWake Forest UniversityE-mail confirmado em wfu.edu