Theory Seminar

Nearly Work-Efficient Parallel Algorithm for Digraph Reachability

Seth Pettie

Assoc. Prof.
University of Michigan
Friday, February 09, 2018
10:30am - 11:30am
BBB 3725

Add to Google Calendar

About the Event

In this talk I'll present a new paper from Jeremy Fineman on parallel algorithms for directed graph reachability. (arXiv:1711.01700). This paper reopens the "transitive closure bottleneck" question that bedeviled parallel algorithms researchers in the 1980s and 90s.

Additional Information

Sponsor(s): CSE

Open to: Public

Web Page: http://web.eecs.umich.edu/~pettie