Efficient tree-traversals: reconciling parallelism and dense data representations

Chaitanya Koparkar, Mike Rainey, Michael Vollmer 0003, Milind Kulkarni 0001, Ryan R. Newton. Efficient tree-traversals: reconciling parallelism and dense data representations. Proceedings of the ACM on Programming Languages, 5(ICFP):1-29, 2021. [doi]

Abstract

Abstract is missing.