On the public citation graph
RegTT: Accelerating Tree Traversals on GPUs by Exploiting Regularities
0 signed · 38 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/jpdc.1995.1077openalex-snapshot
Load Balancing and Data Locality in Adaptive Hierarchical N-Body Methods: Barnes-Hut, Fast Multipole, and Radiosity
inferredcites →https://doi.org/10.1007/978-1-4615-4337-4openalex-snapshot
Loop Tiling for Parallelism
inferredcites →https://doi.org/10.1007/978-3-642-23397-5_40openalex-snapshot
Model-Driven Tile Size Selection for DOACROSS Loops on GPUs
inferredcites →https://doi.org/10.1016/b978-0-12-384988-5.00006-1openalex-snapshot
An Efficient CUDA Implementation of the Tree-Based Barnes Hut n-Body Algorithm
inferredcites →https://doi.org/10.1016/j.parco.2012.03.004openalex-snapshot
Parallelizing SOR for GPGPUs using alternate loop tiling
inferredcites →https://doi.org/10.1038/324446a0openalex-snapshot
A hierarchical O(N log N) force-calculation algorithm
inferredcites →https://doi.org/10.1109/cgo.2013.6494989openalex-snapshot
SIMD parallelization of applications that traverse irregular data structures
inferredcites →https://doi.org/10.1109/icpp.2012.19openalex-snapshot
Automatic Parallelization of Tiled Loop Nests with Enhanced Fine-Grained Parallelism on GPUs
inferredcites →https://doi.org/10.1109/ipdps.2012.100openalex-snapshot
A Highly Parallel Reuse Distance Analysis Algorithm on GPUs
inferredcites →https://doi.org/10.1109/sc.2010.36openalex-snapshot
OpenMPC: Extended OpenMP Programming and Tuning for GPUs
inferredcites →https://doi.org/10.1109/tpds.2015.2397933openalex-snapshot
An Efficient GPU Implementation of Inclusion-Based Pointer Analysis
inferredcites →https://doi.org/10.1111/j.1467-8659.2007.01064.xopenalex-snapshot
Stackless KD‐Tree Traversal for High Performance GPU Ray Tracing
inferredcites →https://doi.org/10.1145/1071866.1071869openalex-snapshot
KD-tree acceleration structures for a GPU raytracer
inferredcites →https://doi.org/10.1145/1409060.1409079openalex-snapshot
Real-time KD-tree construction on graphics hardware
inferredcites →https://doi.org/10.1145/1950365.1950408openalex-snapshot
On-the-fly elimination of dynamic irregularities for GPU computing
inferredcites →https://doi.org/10.1145/2048066.2048104openalex-snapshot
Enhancing locality for recursive traversals of recursive structures
inferredcites →https://doi.org/10.1145/2384616.2384643openalex-snapshot
Automatically enhancing locality for tree traversals with traversal splicing
inferredcites →https://doi.org/10.1145/2503210.2503223openalex-snapshot
General transformations for GPU execution of tree traversals
inferredcites →https://doi.org/10.1145/253262.253345openalex-snapshot
Distance-based indexing for high-dimensional metric spaces
inferredcites →https://doi.org/10.1145/2737924.2738004openalex-snapshot
Efficient execution of recursive programs on commodity vector hardware
inferredcites →https://doi.org/10.1145/361002.361007openalex-snapshot
Multidimensional binary search trees used for associative searching
inferredcites →https://doi.org/10.5555/2523721.2523770openalex-snapshot
Automatic vectorization of tree traversals
inferredcites →https://doi.org/10.5555/313559.313789openalex-snapshot
Data structures and algorithms for nearest neighbor search in general metric spaces
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1109/access.2020.2982227openalex-snapshot
Hybrid CPU-GPU Community Detection in Weighted Networks
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9006541openalex-snapshot
Fast Frequent Pattern Mining without Candidate Generations on GPU by Low Latency Memory Allocation
inferred← citeshttps://doi.org/10.1109/hipc62374.2024.00021openalex-snapshot
GDBOD: Density-Based Outlier Detection Exploiting Efficient Tree Traversals on the GPU
inferred← citeshttps://doi.org/10.1109/icpads.2017.00082openalex-snapshot
An Analytical Study of Recursive Tree Traversal Patterns on Multi- and Many-Core Platforms
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.1109/micro61859.2024.00080openalex-snapshot
Generalizing Ray Tracing Accelerators for Tree Traversals on GPUs
inferred← citeshttps://doi.org/10.1145/3168808openalex-snapshot
Poker: permutation-based SIMD execution of intensive tree search by path encoding
inferred← citeshttps://doi.org/10.1145/3179541.3168808openalex-snapshot
Poker: permutation-based SIMD execution of intensive tree search by path encoding
inferred← citeshttps://doi.org/10.1145/3365663openalex-snapshot
Extracting SIMD Parallelism from Recursive Task-Parallel Programs
inferred← citeshttps://doi.org/10.1145/3570638openalex-snapshot
Optimization Techniques for GPU Programming
inferred← citeshttps://doi.org/10.17694/bajece.1061910openalex-snapshot
A New Anonymization Model for Privacy Preserving Data Publishing: CANON
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.