Recent Publication at SPAA’26

A big shout out to Dr. Grey Ballard’s research group!

The paper, entitled “Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices,” is a collaborative work between CS faculty member, postdoctoral researcher, and recent & former CS MS graduate. The work has been accepted to the 38th ACM Symposium on Parallelism in Algorithms and Applications (SPAA’26).

This impressive work showcases the strength of our collaborative environment, as it was co-authored with our CS Faculty.

To read more, please visit HERE. Congratulations!