282 citations · 531 across the 15 of their papers we have counts for
Showing 2009Show all
3 papers · 1 filter
cs.CC2009★ 282 cited
Minimizing Communication in Linear Algebra
Grey Ballard, James Demmel, Olga Holtz +1
In 1981 Hong and Kung proved a lower bound on the amount of communication needed to perform dense, matrix-multiplication using the conventional algorithm, where the input…
cs.CG2009
Colorful Strips
G. Aloupis, J. Cardinal, S. Collette +6
Given a planar point set and an integer , we wish to color the points with colors so that any axis-aligned strip containing enough points contains all colors. The goal is to…
math.NA2009★ 30 cited
Communication-optimal Parallel and Sequential Cholesky Decomposition
Grey Ballard, James Demmel, Olga Holtz +1
Numerical algorithms have two kinds of costs: arithmetic and communication, by which we mean either moving data between levels of a memory hierarchy (in the sequential case) or ove…