Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Nearly work-efficient parallel algorithm for digraph reachability."

Jeremy T. Fineman (2018)

> Home

Details and statistics

DOI: 10.1145/3188745.3188926

access: closed

type: Conference or Workshop Paper

metadata version: 2018-11-21

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/Fineman18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/Fineman18
Jeremy T. Fineman:
Nearly work-efficient parallel algorithm for digraph reachability. STOC 2018: 457-470

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.