Tight bounds on one- and two-pass MapReduce algorithms for matrix multiplication

Prakash Ramanan, Ashita Nagar. Tight bounds on one- and two-pass MapReduce algorithms for matrix multiplication. In Foto N. Afrati, Jacek Sroka, Jan Hidders, editors, Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, BeyondMR@SIGMOD 2016, San Francisco, CA, USA, July 1, 2016. pages 9, ACM, 2016. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.