@InProceedings{ashida_et_al:LIPIcs.SoCG.2018.5,
author = {Ashida, Ryo and Nakagawa, Kotaro},
title = {{O\textasciitilde(n^\{1/3\})-Space Algorithm for the Grid Graph Reachability Problem}},
booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)},
pages = {5:1--5:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-066-8},
ISSN = {1868-8969},
year = {2018},
volume = {99},
editor = {Speckmann, Bettina and T\'{o}th, Csaba D.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.5},
URN = {urn:nbn:de:0030-drops-87182},
doi = {10.4230/LIPIcs.SoCG.2018.5},
annote = {Keywords: graph reachability, grid graph, graph algorithm, sublinear space algorithm}
}