"Efficient tree-traversals: reconciling parallelism and dense data ..."

Chaitanya Koparkar et al. (2021)

> Home

Details and statistics

DOI: 10.1145/3473596

access: open

type: Journal Article

metadata version: 2022-01-08

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/pacmpl/KoparkarRVKN21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/pacmpl/KoparkarRVKN21
Chaitanya Koparkar, Mike Rainey, Michael Vollmer, Milind Kulkarni, Ryan R. Newton:
Efficient tree-traversals: reconciling parallelism and dense data representations. Proc. ACM Program. Lang. 5(ICFP): 1-29 (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.