"Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable."

Laxman Dhulipala, Guy E. Blelloch, Julian Shun (2021)

> Home

Details and statistics

DOI: 10.1145/3434393

access: closed

type: Journal Article

metadata version: 2021-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/topc/DhulipalaBS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/topc/DhulipalaBS21
Laxman Dhulipala, Guy E. Blelloch, Julian Shun:
Theoretically Efficient Parallel Graph Algorithms Can Be Fast and Scalable. ACM Trans. Parallel Comput. 8(1): 4:1-4:70 (2021)

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.