Skip to content

Nearly work-efficient parallel algorithm for digraph reachability.

Jeremy T. Fineman

VenueA*STOC
Year2018
ProceedingsSTOC

Browse the full STOC paper archive.