Saachi Jain, Matei Zaharia. Spectral Lower Bounds on the I/O Complexity of Computation Graphs. In Christian Scheideler, Michael Spear, editors, SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020. pages 329-338, ACM, 2020. [doi]
@inproceedings{JainZ20,
title = {Spectral Lower Bounds on the I/O Complexity of Computation Graphs},
author = {Saachi Jain and Matei Zaharia},
year = {2020},
doi = {10.1145/3350755.3400210},
url = {https://doi.org/10.1145/3350755.3400210},
researchr = {https://researchr.org/publication/JainZ20},
cites = {0},
citedby = {0},
pages = {329-338},
booktitle = {SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual Event, USA, July 15-17, 2020},
editor = {Christian Scheideler and Michael Spear},
publisher = {ACM},
isbn = {978-1-4503-6935-0},
}