In joint work with Ballard, Demmel, and Schwartz, we showed the
communication cost of algorithms (also known as I/O-complexity) to
be closely related to the small-set expansion properties of the
corresponding computation graphs. This graph expansion...
Read More