Efficient tree-traversals: reconciling parallelism and dense data representations (2021)

First Author: Koparkar C

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1145/3473596

Publication URI: http://dx.doi.org/10.1145/3473596

Type: Journal Article/Review

Parent Publication: Proceedings of the ACM on Programming Languages

Issue: ICFP