@InProceedings{blelloch_et_al:LIPIcs.ESA.2016.14,
author = {Blelloch, Guy E. and Fineman, Jeremy T. and Gibbons, Phillip B. and Gu, Yan and Shun, Julian},
title = {{Efficient Algorithms with Asymmetric Read and Write Costs}},
booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)},
pages = {14:1--14:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-015-6},
ISSN = {1868-8969},
year = {2016},
volume = {57},
editor = {Sankowski, Piotr and Zaroliagis, Christos},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.14},
URN = {urn:nbn:de:0030-drops-63656},
doi = {10.4230/LIPIcs.ESA.2016.14},
annote = {Keywords: Computational Model, Lower Bounds, Shortest-paths, Non-Volatile Memory, Sorting Networks, Fast Fourier Transform, Diamond DAG, Minimum Spanning Tree}
}