Go to the corresponding LIPIcs Volume Portal 
Jain, Rahul ; Tewari, Raghunath
pdfformat: 

@InProceedings{jain_et_al:LIPIcs:2019:11581, author = {Rahul Jain and Raghunath Tewari}, 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:119:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771313}, ISSN = {18688969}, year = {2019}, volume = {150}, editor = {Arkadev Chattopadhyay and Paul Gastin}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2019/11581}, URN = {urn:nbn:de:0030drops115813}, doi = {10.4230/LIPIcs.FSTTCS.2019.19}, annote = {Keywords: graph reachability, grid graph, graph algorithm, sublinear space algorithm} }
Keywords:  graph reachability, grid graph, graph algorithm, sublinear space algorithm  
Seminar:  39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)  
Issue Date:  2019  
Date of publication:  10.12.2019 