Login / Signup

Communication optimal parallel multiplication of sparse random matrices.

Grey BallardAydin BuluçJames DemmelLaura GrigoriBenjamin LipshitzOded SchwartzSivan Toledo
Published in: SPAA (2013)
Keyphrases
  • sparse matrix
  • high dimensional
  • coefficient matrix
  • optimal solution
  • dynamic programming
  • sparse data
  • matrix multiplication
  • binary matrices
  • worst case
  • packet switched