%0 Journal Article %1 Koparkar:2021:TreeTraversals %A Koparkar, Chaitanya %A Rainey, Mike %A Vollmer, Michael %A Kulkarni, Milind %A Newton, Ryan R. %D 2021 %I ACM %J Proceedings of the ACM on Programming Languages %K AST Interpreters Optimizations Representation %N ICFP %P 1--29 %R 10.1145/3473596 %T Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations %V 5

@article{Koparkar:2021:TreeTraversals, added-at = {2023-04-14T15:32:35.000+0200}, author = {Koparkar, Chaitanya and Rainey, Mike and Vollmer, Michael and Kulkarni, Milind and Newton, Ryan R.}, biburl = {https://www.bibsonomy.org/bibtex/2887c3e5155421e9f1614b75b688e3621/gron}, description = {Efficient tree-traversals: reconciling parallelism and dense data representations | Proceedings of the ACM on Programming Languages}, doi = {10.1145/3473596}, interhash = {5ccf4efaf53015eca1509e2f9a89c427}, intrahash = {887c3e5155421e9f1614b75b688e3621}, journal = {Proceedings of the {ACM} on Programming Languages}, keywords = {AST Interpreters Optimizations Representation}, month = aug, number = {{ICFP}}, pages = {1--29}, publisher = {{ACM}}, timestamp = {2023-04-14T15:32:35.000+0200}, title = {{Efficient Tree-Traversals: Reconciling Parallelism and Dense Data Representations}}, volume = 5, year = 2021 }