Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations

Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations Paper DOI: 10.1145/3473596 Presented at None, part of ICFP 2021 By Chaitanya Koparkar, Mike Rainey, Michael Vollmer, Milind Kulkarni, Ryan R. Newton