282 citations · 531 across the 15 of their papers we have counts for
1 paper · 2 filters
Grey Ballard, James Demmel, Olga Holtz +1
The communication cost of algorithms (also known as I/O-complexity) is shown to be closely related to the expansion properties of the corresponding computation graphs. We demonstra…