On the public citation graph
Efficient tree-traversals: reconciling parallelism and dense data representations
0 signed · 54 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1006/inco.1996.2613openalex-snapshot
Region-Based Memory Management
inferredcites →https://doi.org/10.1016/0021-9991(90)90231-oopenalex-snapshot
Vectorization of a treecode
inferredcites →https://doi.org/10.1023/b:lisp.0000029446.78563.a4openalex-snapshot
A Retrospective on Region-Based Memory Management
inferredcites →https://doi.org/10.1109/99.660313openalex-snapshot
OpenMP: an industry standard API for shared-memory programming
inferredcites →https://doi.org/10.1145/1016848.1016878openalex-snapshot
A nanopass infrastructure for compiler education
inferredcites →https://doi.org/10.1145/1016850.1016878openalex-snapshot
A nanopass infrastructure for compiler education
inferredcites →https://doi.org/10.1145/1291151.1291192openalex-snapshot
Feedback directed implicit parallelism
inferredcites →https://doi.org/10.1145/1375634.1375637openalex-snapshot
Parallel generational-copying garbage collection with a block-structured heap
inferredcites →https://doi.org/10.1145/1596550.1596563openalex-snapshot
Runtime support for multicore Haskell
inferredcites →https://doi.org/10.1145/1926354.1926358openalex-snapshot
Accelerating Haskell array codes with multicore GPUs
inferredcites →https://doi.org/10.1145/2034675.2034685openalex-snapshot
A monad for deterministic parallelism
inferredcites →https://doi.org/10.1145/2096148.2034685openalex-snapshot
A monad for deterministic parallelism
inferredcites →https://doi.org/10.1145/2442516.2442525openalex-snapshot
Data-only flattening for nested data parallelism
inferredcites →https://doi.org/10.1145/2503210.2503223openalex-snapshot
General transformations for GPU execution of tree traversals
inferredcites →https://doi.org/10.1145/2594291.2594312openalex-snapshot
Taming the parallel effect zoo
inferredcites →https://doi.org/10.1145/2784731.2784735openalex-snapshot
Efficient communication and collection with compact normal forms
inferredcites →https://doi.org/10.1145/2784731.2784741openalex-snapshot
An optimizing compiler for a purely functional web-application language
inferredcites →https://doi.org/10.1145/2951913.2951935openalex-snapshot
Hierarchical memory management for parallel programs
inferredcites →https://doi.org/10.1145/2951913.2951944openalex-snapshot
A fully concurrent garbage collector for functional programs on multicore processors
inferredcites →https://doi.org/10.1145/3022670.2951935openalex-snapshot
Hierarchical memory management for parallel programs
inferredcites →https://doi.org/10.1145/3158093openalex-snapshot
Linear Haskell: practical linearity in a higher-order polymorphic language
inferredcites →https://doi.org/10.1145/3178487.3178494openalex-snapshot
Hierarchical memory management for mutable state
inferredcites →https://doi.org/10.1145/3192366.3192391openalex-snapshot
Heartbeat scheduling: provable efficiency for nested parallelism
inferredcites →https://doi.org/10.1145/3293883.3295725openalex-snapshot
Provably and practically efficient granularity control
inferredcites →https://doi.org/10.1145/3314221.3314631openalex-snapshot
LoCal: a language for programs operating on serialized data
inferredcites →https://doi.org/10.1145/3371115openalex-snapshot
Disentanglement in nested-parallel programs
inferredcites →https://doi.org/10.1145/3453483.3460969openalex-snapshot
Task parallel assembly language for uncompromising parallelism
inferredcites →https://doi.org/10.1145/3473596openalex-snapshot
Efficient tree-traversals: reconciling parallelism and dense data representations
inferredcites →https://doi.org/10.1145/355744.355745openalex-snapshot
An Algorithm for Finding Best Matches in Logarithmic Expected Time
inferredcites →https://doi.org/10.1145/4472.4478openalex-snapshot
MULTILISP: a language for concurrent symbolic computation
inferredcites →https://doi.org/10.1145/69558.69562openalex-snapshot
I-structures: data structures for parallel computing
inferredcites →https://doi.org/10.17863/cam.56842openalex-snapshot
Retrofitting parallelism onto OCaml.
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.26openalex-snapshot
Compiling Tree Transforms to Operate on Packed Representations
inferredcites →https://doi.org/10.4230/lipics.ecoop.2017.4openalex-snapshot
Julia: A Fast Dynamic Language for Technical Computing
inferredcites →https://doi.org/10.48550/arxiv.1912.01703openalex-snapshot
PyTorch: An Imperative Style, High-Performance Deep Learning Library
inferredcites →https://doi.org/10.5555/1921479.1921492openalex-snapshot
Parallel SAH k-D tree construction
inferredcites →https://doi.org/10.7551/mitpress/2319.001.0001openalex-snapshot
The Definition of Standard ML
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1109/iccc54389.2021.9674251openalex-snapshot
Graphical System Design of Test Cases in Flight Control System
inferred← citeshttps://doi.org/10.1109/ipdps65963.2026.00043openalex-snapshot
DSTree: Data-Driven Synchronous Traversals for Decision Forests on GPUs
inferred← citeshttps://doi.org/10.1145/3495272openalex-snapshot
Making GHC whole again or, how to perform whole-program analysis within GHC
inferred← citeshttps://doi.org/10.1145/3591284openalex-snapshot
Efficient Parallel Functional Programming with Effects
inferred← citeshttps://doi.org/10.1145/3607858openalex-snapshot
Bit-Stealing Made Legal: Compilation for Custom Memory Representations of Algebraic Data Types
inferred← citeshttps://doi.org/10.1145/3622808openalex-snapshot
AST vs. Bytecode: Interpreters in the Age of Meta-Compilation
inferred← citeshttps://doi.org/10.1145/3674628openalex-snapshot
Double-Ended Bit-Stealing for Algebraic Data Types
inferred← citeshttps://doi.org/10.1145/3828688openalex-snapshot
LoCalMem: Type-Directed Adaptive Serialization for Location- and Content-Addressable Memory
inferred← citeshttps://doi.org/10.70675/43bc0670zd709z4cffza0e2z2455449e95d0openalex-snapshot
Compiling Trees : Combining Data Layouts and the Polyhedral Model
inferred← citeshttps://doi.org/10.70675/7bb9b51ezf689z4cb5z8d80z794397b5f052openalex-snapshot
Algebraic Data Types for High-Performance Computing
showing the first 10 of 11 · page through all 11
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.