On the public citation graph
Domain specific mapping for solving graph problems on reconfigurable devices
0 signed · 32 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/3-540-63465-7_224openalex-snapshot
Exploiting reconfigurability through domain-specific systems
inferredcites →https://doi.org/10.1016/0010-4485(85)90134-4openalex-snapshot
Computational aspects of VLSI
inferredcites →https://doi.org/10.1109/fpga.1998.707896openalex-snapshot
Accelerating Boolean satisfiability with configurable hardware
inferredcites →https://doi.org/10.1109/fpga.1998.707897openalex-snapshot
Dynamic circuit generation for solving specific problem instances of Boolean satisfiability
inferredcites →https://doi.org/10.1117/12.255820openalex-snapshot
Solving graph problems with dynamic computation structures
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-44614-1_47openalex-snapshot
Efficient Self-Reconfigurable Implementations Using On-chip Memory
inferred← citeshttps://doi.org/10.1007/3-540-45591-4_125openalex-snapshot
Loop Pipelining and Optimization for Run Time Reconfiguration
inferred← citeshttps://doi.org/10.1007/3-540-46117-5_94openalex-snapshot
HAGAR: Efficient Multi-context Graph Processors
inferred← citeshttps://doi.org/10.1007/978-3-540-46239-2_4openalex-snapshot
Register Based Genetic Programming on FPGA Computing Platforms
inferred← citeshttps://doi.org/10.1016/s1383-7621(03)00067-5openalex-snapshot
The design and implementation of a reconfigurable processor for problems of combinatorial computation
inferred← citeshttps://doi.org/10.1023/a:1024443416592openalex-snapshot
Instance-Specific Accelerators for Minimum Covering
inferred← citeshttps://doi.org/10.1109/92.924037openalex-snapshot
Reconfigurable parallel inner product processor architectures
inferred← citeshttps://doi.org/10.1109/asap.2012.30openalex-snapshot
A Reconfigurable Computing Approach for Efficient and Scalable Parallel Graph Exploration
inferred← citeshttps://doi.org/10.1109/fpga.2000.903400openalex-snapshot
An adaptive cryptographic engine for IPSec architectures
inferred← citeshttps://doi.org/10.1109/fpl.2015.7293939openalex-snapshot
Hybrid breadth-first search on a single-chip FPGA-CPU heterogeneous platform
inferred← citeshttps://doi.org/10.1109/fpt.2011.6132667openalex-snapshot
A framework for FPGA acceleration of large graph problems: Graphlet counting case study
inferred← citeshttps://doi.org/10.1109/iccit.2009.302openalex-snapshot
Implementation of Graph Algorithms in Reconfigurable Hardware (FPGAs) to Speeding Up the Execution
inferred← citeshttps://doi.org/10.1109/ipdpsw.2015.130openalex-snapshot
Accelerating Large-Scale Single-Source Shortest Path on FPGA
inferred← citeshttps://doi.org/10.1109/ithings-greencom-cpscom-smartdata.2016.159openalex-snapshot
The Communication Analysis of Implementation in Breadth First Search Algorithm
inferred← citeshttps://doi.org/10.1109/jproc.2002.801446openalex-snapshot
Reconfigurable computing systems
inferred← citeshttps://doi.org/10.1109/tcsii.2015.2505998openalex-snapshot
An FPGA Implementation for Solving the Large Single-Source-Shortest-Path Problem
inferred← citeshttps://doi.org/10.1109/tpds.2018.2885745openalex-snapshot
Exploring GPU-Accelerated Routing for FPGAs
inferred← citeshttps://doi.org/10.1145/1013948.1013952openalex-snapshot
An adaptive cryptographic engine for internet protocol security architectures
inferred← citeshttps://doi.org/10.1145/329166.329190openalex-snapshot
A representation for dynamic graphs in reconfigurable hardware and its application to fundamental graph algorithms
inferred← citeshttps://doi.org/10.1145/3466752.3480133openalex-snapshot
SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systems
inferred← citeshttps://doi.org/10.1145/3568990openalex-snapshot
Non-relational Databases on FPGAs: Survey, Design Decisions, Challenges
inferred← citeshttps://doi.org/10.1145/605440.605444openalex-snapshot
Run-time performance optimization of an FPGA-based deduction engine for SAT solvers
inferred← citeshttps://doi.org/10.1587/elex.11.20130987openalex-snapshot
Parallel graph traversal for FPGA
inferred← citeshttps://doi.org/10.3390/jlpea12030039openalex-snapshot
Efficiency of Priority Queue Architectures in FPGA
inferred← citeshttps://doi.org/10.48550/arxiv.1903.06697openalex-snapshot
Graph Processing on FPGAs: Taxonomy, Survey, Challenges
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.