%0 Conference Paper %1 conf/lata/RamaswamySS17 %A Ramaswamy, Vidhya %A Sarma, Jayalal %A Sunil, K. S. %B LATA %D 2017 %E Drewes, Frank %E Martín-Vide, Carlos %E Truthe, Bianca %K dblp %P 351-363 %T Space Complexity of Reachability Testing in Labelled Graphs. %U http://dblp.uni-trier.de/db/conf/lata/lata2017.html#RamaswamySS17 %V 10168 %@ 978-3-319-53732-0

@inproceedings{conf/lata/RamaswamySS17, added-at = {2017-05-24T00:00:00.000+0200}, author = {Ramaswamy, Vidhya and Sarma, Jayalal and Sunil, K. S.}, biburl = {https://www.bibsonomy.org/bibtex/27efc3a1f8ad3c05e5f0b70162605269c/dblp}, booktitle = {LATA}, crossref = {conf/lata/2017}, editor = {Drewes, Frank and Martín-Vide, Carlos and Truthe, Bianca}, ee = {https://doi.org/10.1007/978-3-319-53733-7_26}, interhash = {c98f6bf32280bbee0cbbae1cfa1aa519}, intrahash = {7efc3a1f8ad3c05e5f0b70162605269c}, isbn = {978-3-319-53732-0}, keywords = {dblp}, pages = {351-363}, series = {Lecture Notes in Computer Science}, timestamp = {2019-09-17T12:16:58.000+0200}, title = {Space Complexity of Reachability Testing in Labelled Graphs.}, url = {http://dblp.uni-trier.de/db/conf/lata/lata2017.html#RamaswamySS17}, volume = 10168, year = 2017 }