| Article Details | ||
|---|---|---|
| Title: | Nearly work-efficient parallel algorithm for digraph reachability | |
| Article URLs: | ||
| Alternative Article URLs: | ||
| Authors: | Jeremy T. Fineman |
|
| Sharing: | Unknown | |
| Verification: | Author has not verified information | |
| Artifact Evaluation Badge: | none | |
| Artifact URLs: |
|
|
| Artifact Correspondence Email Addresses: |
|
|
| NSF Award Numbers: | 1718700, 1617727, 1314633 | |
| DBLP Key: | conf/stoc/Fineman18 | |
| Author Comments: | ||