Kathryn Rouse

Orcid: 0009-0001-4045-0423

According to our database1, Kathryn Rouse authored at least 7 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Communication Lower Bounds and Optimal Algorithms for Multiple Tensor-Times-Matrix Computation.
SIAM J. Matrix Anal. Appl., March, 2024

2023
Parallel Memory-Independent Communication Bounds for SYRK.
Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures, 2023

2022
Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds.
CoRR, 2022

Brief Announcement: Tight Memory-Independent Parallel Matrix Multiplication Communication Lower Bounds.
Proceedings of the SPAA '22: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11, 2022

2020
General Memory-Independent Lower Bound for MTTKRP.
Proceedings of the 2020 SIAM Conference on Parallel Processing for Scientific Computing, 2020

2018
Communication Lower Bounds for Matricized Tensor Times Khatri-Rao Product.
Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium, 2018

Energy Anomaly Detection with Forecasting and Deep Learning.
Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018


  Loading...