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]
@article{KoparkarRVKN21,
title = {Efficient tree-traversals: reconciling parallelism and dense data representations},
author = {Chaitanya Koparkar and Mike Rainey and Michael Vollmer 0003 and Milind Kulkarni 0001 and Ryan R. Newton},
year = {2021},
doi = {10.1145/3473596},
url = {https://doi.org/10.1145/3473596},
researchr = {https://researchr.org/publication/KoparkarRVKN21},
cites = {0},
citedby = {0},
journal = {Proceedings of the ACM on Programming Languages},
volume = {5},
number = {ICFP},
pages = {1-29},
}