@InProceedings{jain_et_al:LIPIcs.FSTTCS.2019.19,
author = {Jain, Rahul and Tewari, Raghunath},
title = {{An O(n^(1/4 +epsilon)) Space and Polynomial Algorithm for Grid Graph Reachability}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {19:1--19:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.19},
URN = {urn:nbn:de:0030-drops-115813},
doi = {10.4230/LIPIcs.FSTTCS.2019.19},
annote = {Keywords: graph reachability, grid graph, graph algorithm, sublinear space algorithm}
}