%0 Conference Paper %1 conf/innovations/DemaineLLLW18 %A Demaine, Erik D. %A Lincoln, Andrea %A Liu, Quanquan C. %A Lynch, Jayson %A Williams, Virginia Vassilevska %B ITCS %D 2018 %E Karlin, Anna R. %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 34:1-34:23 %T Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy. %U http://dblp.uni-trier.de/db/conf/innovations/innovations2018.html#DemaineLLLW18 %V 94 %@ 978-3-95977-060-6

@inproceedings{conf/innovations/DemaineLLLW18, added-at = {2018-08-23T00:00:00.000+0200}, author = {Demaine, Erik D. and Lincoln, Andrea and Liu, Quanquan C. and Lynch, Jayson and Williams, Virginia Vassilevska}, biburl = {https://www.bibsonomy.org/bibtex/22cb77026778f1f5ea94f8f31bc87eb35/dblp}, booktitle = {ITCS}, crossref = {conf/innovations/2018}, editor = {Karlin, Anna R.}, ee = {https://doi.org/10.4230/LIPIcs.ITCS.2018.34}, interhash = {e17136afc759ed458231d3c6ccf2a0d6}, intrahash = {2cb77026778f1f5ea94f8f31bc87eb35}, isbn = {978-3-95977-060-6}, keywords = {dblp}, pages = {34:1-34:23}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2020-02-12T11:44:08.000+0100}, title = {Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy.}, url = {http://dblp.uni-trier.de/db/conf/innovations/innovations2018.html#DemaineLLLW18}, volume = 94, year = 2018 }