Login / Signup
Nearly work-efficient parallel algorithm for digraph reachability.
Jeremy T. Fineman
Published in:
STOC (2018)
Keyphrases
</>
parallel algorithm
parallel computation
shared memory
parallel computers
graphics processors
cluster of workstations
discovery of association rules