69 citations · 144 across the 20 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017
Nearly Work-Efficient Parallel Algorithm for Digraph Reachability
Jeremy T. Fineman
One of the simplest problems on directed graphs is that of identifying the set of vertices reachable from a designated source vertex. This problem can be solved easily sequentially…
cs.DS2017
Implicit Decomposition for Write-Efficient Connectivity Algorithms
Naama Ben-David, Guy E. Blelloch, Jeremy T. Fineman +4
The future of main memory appears to lie in the direction of new technologies that provide strong capacity-to-performance ratios, but have write operations that are much more expen…