@InProceedings{demaine_et_al:LIPIcs.ITCS.2018.34,
author = {Demaine, Erik D. and Lincoln, Andrea and Liu, Quanquan C. and Lynch, Jayson and Vassilevska Williams, Virginia},
title = {{Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy}},
booktitle = {9th Innovations in Theoretical Computer Science Conference (ITCS 2018)},
pages = {34:1--34:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-060-6},
ISSN = {1868-8969},
year = {2018},
volume = {94},
editor = {Karlin, Anna R.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2018.34},
URN = {urn:nbn:de:0030-drops-83335},
doi = {10.4230/LIPIcs.ITCS.2018.34},
annote = {Keywords: IO model, Fine-grained Complexity, Algorithms}
}