On the public citation graph
A New Data Layout for Set Intersection on GPUs
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.1007/978-3-540-77120-3_64openalex-snapshot
Fast Evaluation of Union-Intersection Expressions
inferredcites →https://doi.org/10.1007/s00778-006-0025-yopenalex-snapshot
Cache-conscious frequent pattern mining on modern and emerging processors
inferredcites →https://doi.org/10.1016/b978-012088469-8.50006-1openalex-snapshot
On the Performance of Bitmap Indices for High Cardinality Attributes
inferredcites →https://doi.org/10.1016/b978-012088469-8/50006-1openalex-snapshot
On the Performance of Bitmap Indices for High Cardinality Attributes1
inferredcites →https://doi.org/10.1023/b:dami.0000005258.31418.83openalex-snapshot
Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach
inferredcites →https://doi.org/10.1109/4434.806975openalex-snapshot
Parallel and distributed association mining: a survey
inferredcites →https://doi.org/10.1109/icde.2006.150openalex-snapshot
Super-Scalar RAM-CPU Cache Compression
inferredcites →https://doi.org/10.1109/sera.2006.6openalex-snapshot
A Parallel Apriori Algorithm for Frequent Itemsets Mining
inferredcites →https://doi.org/10.1111/j.1467-8659.2007.01012.xopenalex-snapshot
A Survey of General‐Purpose Computation on Graphics Hardware
inferredcites →https://doi.org/10.1137/0213027openalex-snapshot
Simulation of Parallel Random Access Machines by Circuits
inferredcites →https://doi.org/10.1145/1133905.1133907openalex-snapshot
An implementation of the FP-growth algorithm
inferredcites →https://doi.org/10.1145/1133905.1133911openalex-snapshot
On benchmarking frequent itemset mining algorithms
inferredcites →https://doi.org/10.1145/1376616.1376670openalex-snapshot
Relational joins on graphics processors
inferredcites →https://doi.org/10.1145/1514894.1514909openalex-snapshot
Faster join-projects and sparse matrix multiplications
inferredcites →https://doi.org/10.1145/1565694.1565702openalex-snapshot
Frequent itemset mining on graphics processors
inferredcites →https://doi.org/10.1145/165231.165246openalex-snapshot
Simple, efficient shared memory simulations
inferredcites →https://doi.org/10.1145/7531.7926openalex-snapshot
How to share memory in a distributed system
inferredcites →https://doi.org/10.5555/338219.338634openalex-snapshot
Adaptive set intersections, unions, and differences
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-78372-7_5openalex-snapshot
Efficient Circuit-Based PSI via Cuckoo Hashing
inferred← citeshttps://doi.org/10.1007/978-3-642-40285-2_14openalex-snapshot
Parallel and Distributed Mining of Probabilistic Frequent Itemsets Using Multiple GPUs
inferred← citeshttps://doi.org/10.1007/s00453-013-9749-4openalex-snapshot
Thresholds for Extreme Orientability
inferred← citeshttps://doi.org/10.1016/j.jpdc.2017.01.026openalex-snapshot
Intersecting two families of sets on the GPU
inferred← citeshttps://doi.org/10.1109/bigdata47090.2019.9005513openalex-snapshot
Finding Mutual X at WeChat-Scale Social Network in Ten Minitues
inferred← citeshttps://doi.org/10.1109/cyberc.2013.95openalex-snapshot
FPGA Acceleration for Intersection Computation in Frequent Itemset Mining
inferred← citeshttps://doi.org/10.1109/dcc47342.2020.00045openalex-snapshot
Higher-Order Count Sketch: Dimensionality Reduction that Retains Efficient Tensor Operations
inferred← citeshttps://doi.org/10.1109/hpcc.and.euc.2013.98openalex-snapshot
Accelerating Intersection Computation in Frequent Itemset Mining with FPGA
inferred← citeshttps://doi.org/10.1109/ipdps.2012.100openalex-snapshot
A Highly Parallel Reuse Distance Analysis Algorithm on GPUs
inferred← citeshttps://doi.org/10.1109/nas.2012.12openalex-snapshot
Implementing the Jacobi Algorithm for Solving Eigenvalues of Symmetric Matrices with CUDA
inferred← citeshttps://doi.org/10.1145/3034786.3056115openalex-snapshot
2-3 Cuckoo Filters for Faster Triangle Listing and Set Intersection
inferred← citeshttps://doi.org/10.14778/3303753.3303755openalex-snapshot
Document reordering for faster intersection
inferred← citeshttps://doi.org/10.1587/transinf.e97.d.779openalex-snapshot
Probabilistic Frequent Itemset Mining on a GPU Cluster
inferred← citeshttps://doi.org/10.26599/bdma.2019.9020006openalex-snapshot
High performance frequent subgraph mining on transaction datasets: A survey and performance comparison
inferred← citeshttps://doi.org/10.48550/arxiv.1901.11261openalex-snapshot
Higher-order Count Sketch: Dimensionality Reduction That Retains Efficient Tensor Operations
inferred← citeshttps://doi.org/10.5121/ijdps.2014.5502openalex-snapshot
Scalable Frequent Itemset Mining Using Heterogeneous Computing : Parapriori Algorithm
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.