Erik D. Demaine, Andrea Lincoln, Quanquan C. Liu, Jayson Lynch, Virginia Vassilevska Williams. Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. In Anna R. Karlin, editor, 9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA. Volume 94 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]
@inproceedings{DemaineLLLW18,
title = {Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy},
author = {Erik D. Demaine and Andrea Lincoln and Quanquan C. Liu and Jayson Lynch and Virginia Vassilevska Williams},
year = {2018},
doi = {10.4230/LIPIcs.ITCS.2018.34},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2018.34},
researchr = {https://researchr.org/publication/DemaineLLLW18},
cites = {0},
citedby = {0},
booktitle = {9th Innovations in Theoretical Computer Science Conference, ITCS 2018, January 11-14, 2018, Cambridge, MA, USA},
editor = {Anna R. Karlin},
volume = {94},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-060-6},
}