Dense to Sparse matrix multiplication algorithms Are there any algorithms that multiply dense and sparse matrices? 
I've currently got 2 large matrices currently stored as dense matrices, one of the two is actually quite sparse (2/3rds 0's, and potentially even more sparse). The other is fully populated (e.g. dense).
Are there any speed efficiencies that can be gained by by doing dense x sparse multiplication (I'm unconcerned with space)? Are there any algorithms that handle it?

Here is a distributed algorithm, but it works on a single processor machine as well: http://ieeexplore.ieee.org/document/7516081/
Code: http://people.eecs.berkeley.edu/~penpornk/spdm3/index.html
What is your application? I have been curious of other applications where this sparse x dense matrix multiplication algorithm would be useful
