%0 Conference Paper %1 conf/stoc/Fineman18 %A Fineman, Jeremy T. %B STOC %D 2018 %E Diakonikolas, Ilias %E Kempe, David %E Henzinger, Monika %I ACM %K dblp %P 457-470 %T Nearly work-efficient parallel algorithm for digraph reachability. %U http://dblp.uni-trier.de/db/conf/stoc/stoc2018.html#Fineman18

@inproceedings{conf/stoc/Fineman18, added-at = {2018-11-21T00:00:00.000+0100}, author = {Fineman, Jeremy T.}, biburl = {https://www.bibsonomy.org/bibtex/25543ee0672c2d81eea2266eed42c558d/dblp}, booktitle = {STOC}, crossref = {conf/stoc/2018}, editor = {Diakonikolas, Ilias and Kempe, David and Henzinger, Monika}, ee = {https://doi.org/10.1145/3188745.3188926}, interhash = {4cc55d1ed2a7d4cd50a68032bc167b88}, intrahash = {5543ee0672c2d81eea2266eed42c558d}, keywords = {dblp}, pages = {457-470}, publisher = {ACM}, timestamp = {2018-11-22T11:58:23.000+0100}, title = {Nearly work-efficient parallel algorithm for digraph reachability.}, url = {http://dblp.uni-trier.de/db/conf/stoc/stoc2018.html#Fineman18}, year = 2018 }