On the public citation graph
Algorithmic Techniques for Solving Graph Problems on the Automata Processor
0 signed · 21 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.1109/icosc.2015.7050812openalex-snapshot
Brill tagging on the Micron Automata Processor
inferredcites →https://doi.org/10.1109/ipdps.2014.51openalex-snapshot
Finding Motifs in Biological Sequences Using the Micron Automata Processor
inferredcites →https://doi.org/10.1109/ipdps.2015.101openalex-snapshot
Association Rule Mining with the Micron Automata Processor
inferredcites →https://doi.org/10.1109/tcbb.2015.2430313openalex-snapshot
Discovering Motifs in Biological Sequences Using the Micron Automata Processor
inferredcites →https://doi.org/10.1109/tpds.2014.8openalex-snapshot
An Efficient and Scalable Semiconductor Architecture for Parallel Automata Processing
inferredcites →https://doi.org/10.1145/321850.321854openalex-snapshot
A Search Procedure for Hamilton Paths and Circuits
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1016/j.jpdc.2018.01.010openalex-snapshot
Interval stabbing on the Automata Processor
inferred← citeshttps://doi.org/10.1016/j.sysarc.2019.07.006openalex-snapshot
A survey on applications and architectural-optimizations of Micron’s Automata Processor
inferred← citeshttps://doi.org/10.1109/bigdata.2017.8257936openalex-snapshot
Robotomata: A framework for approximate pattern matching of big data on an automata processor
inferred← citeshttps://doi.org/10.1109/hpca.2018.00069openalex-snapshot
Characterizing and Mitigating Output Reporting Bottlenecks in Spatial Automata Processing Architectures
inferred← citeshttps://doi.org/10.1109/ia3.2016.008openalex-snapshot
Parallel Interval Stabbing on the Automata Processor
inferred← citeshttps://doi.org/10.1109/ipdps47924.2020.00037openalex-snapshot
GPU-Based Static Data-Flow Analysis for Fast and Scalable Android App Vetting
inferred← citeshttps://doi.org/10.1109/micro.2018.00078openalex-snapshot
Architectural Support for Efficient Large-Scale Automata Processing
inferred← citeshttps://doi.org/10.1145/3079079.3079100openalex-snapshot
Demystifying automata processing
inferred← citeshttps://doi.org/10.1145/3297858.3304066openalex-snapshot
Debugging Support for Pattern-Matching Languages and Accelerators
inferred← citeshttps://doi.org/10.1145/3373376.3378503openalex-snapshot
Accelerating Legacy String Kernels via Bounded Automata Learning
inferred← citeshttps://doi.org/10.1145/3556976openalex-snapshot
DynamAP: Architectural Support for Dynamic Graph Traversal on the Automata Processor
inferred← citeshttps://doi.org/10.1145/3617232.3624848openalex-snapshot
ngAP: Non-blocking Large-scale Automata Processing on GPUs
inferred← citeshttps://doi.org/10.1145/3676642.3736126openalex-snapshot
Hopps: Leveraging Sparsity to Accelerate Automata Processing
inferred← citeshttps://doi.org/10.1145/3748646openalex-snapshot
Towards Scalable and Non-blocking Automata Processing on GPUs with ngAP
inferred← citeshttps://doi.org/10.5555/3018843.3018846openalex-snapshot
Parallel interval stabbing on the automata processor
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.