On the public citation graph
Using configurable computing to accelerate Boolean satisfiability
0 signed · 57 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-61551-2_65openalex-snapshot
Using CSP look-back techniques to solve exceptionally hard SAT instances
inferredcites →https://doi.org/10.1007/3-540-61730-2_14openalex-snapshot
Solving satisfiability problems on FPGAs
inferredcites →https://doi.org/10.1007/3-540-63465-7_250openalex-snapshot
Satisfiability on reconfigurable hardware
inferredcites →https://doi.org/10.1007/bfb0055234openalex-snapshot
Acceleration of satisfiability algorithms by reconfigurable hardware
inferredcites →https://doi.org/10.1007/bfb0055260openalex-snapshot
Solving boolean satisfiability with dynamic hardware configurations
inferredcites →https://doi.org/10.1109/2.347995openalex-snapshot
Real-time image processing on a custom computing platform
inferredcites →https://doi.org/10.1109/2.67197openalex-snapshot
Building and using a highly parallel programmable logic array
inferredcites →https://doi.org/10.1109/43.108614openalex-snapshot
Test pattern generation using Boolean satisfiability
inferredcites →https://doi.org/10.1109/43.238038openalex-snapshot
A transitive closure algorithm for test generation
inferredcites →https://doi.org/10.1109/43.536723openalex-snapshot
Combinational test generation using satisfiability
inferredcites →https://doi.org/10.1109/92.238418openalex-snapshot
An efficient logic emulation system
inferredcites →https://doi.org/10.1109/fpga.1995.477406openalex-snapshot
Teramac-configurable custom computing
inferredcites →https://doi.org/10.1109/iccad.1996.569607openalex-snapshot
GRASP-A new search algorithm for satisfiability
inferredcites →https://doi.org/10.1109/tc.1981.1675757openalex-snapshot
An Implicit Enumeration Algorithm to Generate Tests for Combinational Logic Circuits
inferredcites →https://doi.org/10.1117/12.221340openalex-snapshot
Teramac configurable custom computer
inferredcites →https://doi.org/10.1145/275107.275133openalex-snapshot
Fast integrated tools for circuit design with FPGAs
inferredcites →https://doi.org/10.1145/275107.275134openalex-snapshot
A fast routability-driven router for FPGAs
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11560548_37openalex-snapshot
FPGA Based Accelerator for 3-SAT Conflict Analysis in SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-0-387-34749-3_17openalex-snapshot
Intelligent Systems Engineering with Reconfigurable Computing
inferred← citeshttps://doi.org/10.1007/978-3-540-30117-2_100openalex-snapshot
Hardware/Software Implementation of FPGA-Targeted Matrix-Oriented SAT Solvers
inferred← citeshttps://doi.org/10.1007/978-3-540-30117-2_36openalex-snapshot
Solving SAT with a Context-Switching Virtual Clause Pipeline and an FPGA Embedded Processor
inferred← citeshttps://doi.org/10.1007/978-3-540-30117-2_53openalex-snapshot
An Instance-Specific Hardware Algorithm for Finding a Maximum Clique
inferred← citeshttps://doi.org/10.1007/978-3-540-45234-8_46openalex-snapshot
Reconfigurable Hardware SAT Solvers: A Survey of Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_6openalex-snapshot
Designing an Efficient Hardware Implication Accelerator for SAT Solving
inferred← citeshttps://doi.org/10.1007/s10766-009-0125-6openalex-snapshot
GPU-based Acceleration of System-level Design Tasks
inferred← citeshttps://doi.org/10.1007/s11265-018-1435-yopenalex-snapshot
An Accelerator for Resolution Proof Checking based on FPGA and Hybrid Memory Cube Technology
inferred← citeshttps://doi.org/10.1016/b978-012370522-8.50038-8openalex-snapshot
Boolean Satisfiability
inferred← citeshttps://doi.org/10.1016/j.jpdc.2016.12.014openalex-snapshot
Hardware accelerated SAT solvers—A survey
inferred← citeshttps://doi.org/10.1016/j.micpro.2006.02.003openalex-snapshot
Stochastic spatial routing for reconfigurable networks
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.920827openalex-snapshot
ATPG for combinational circuits on configurable hardware
inferred← citeshttps://doi.org/10.1109/ccnc08.2007.48openalex-snapshot
Routing and Wavelength Assignment in Optical Networks Using Boolean Satisfiability
inferred← citeshttps://doi.org/10.1109/cscwd.2001.942230openalex-snapshot
Research on cooperative template design
inferred← citeshttps://doi.org/10.1109/dsd.2003.1231947openalex-snapshot
Reconfigurable randomized K-way graph partitioning
inferred← citeshttps://doi.org/10.1109/dsd.2005.45openalex-snapshot
Hardware-Based Implementation of the Common Approximate Substring Algorithm
inferred← citeshttps://doi.org/10.1109/fpga.2002.1106671openalex-snapshot
Custom computing machines for the set covering problem
inferred← citeshttps://doi.org/10.1109/icc.2010.5502338openalex-snapshot
A Multipath Detection Scheme Using Sat
inferred← citeshttps://doi.org/10.1109/iceee.2006.251924openalex-snapshot
Identifying the Shortest Path in Large Networks using Boolean Satisfiability
inferred← citeshttps://doi.org/10.1109/icm.2017.8268894openalex-snapshot
A pure hardware k-SAT solver architecture for FPGA based on generic tree-search
inferred← citeshttps://doi.org/10.1109/iscas.2003.1204997openalex-snapshot
Using FPGAs to solve the Hamiltonian cycle problem
inferred← citeshttps://doi.org/10.1109/iwsoc.2005.40openalex-snapshot
An FPGA based accelerator for SAT based combinational equivalence checking
inferred← citeshttps://doi.org/10.1109/mssc.2018.2822861openalex-snapshot
Recognized as the Best: The ACM\/SIGDA TCFPGA Hall of Fame for FPGAs and Reconfigurable Computing
inferred← citeshttps://doi.org/10.1109/tc.2004.102openalex-snapshot
Reconfigurable hardware SAT solvers: a survey of systems
inferred← citeshttps://doi.org/10.1109/tvlsi.2004.825859openalex-snapshot
A software/reconfigurable hardware SAT solver
inferred← citeshttps://doi.org/10.1109/wcnc.2009.4917909openalex-snapshot
PN Code Acquisition Using Boolean Satisfiability Techniques
inferred← citeshttps://doi.org/10.1145/1150343.1150380openalex-snapshot
A fast SAT solver algorithm best suited to reconfigurable hardware
inferred← citeshttps://doi.org/10.1145/1391469.1391669openalex-snapshot
A practical reconfigurable hardware accelerator for Boolean satisfiability solvers
inferred← citeshttps://doi.org/10.1145/605440.605446openalex-snapshot
Instruction generation for hybrid reconfigurable systems
inferred← citeshttps://doi.org/10.1155/2011/365107openalex-snapshot
Multipath Detection Using Boolean Satisfiability Techniques
inferred← citeshttps://doi.org/10.14236/ewic/vocs2008.8openalex-snapshot
A Hardware Relaxation Paradigm for Solving NP-Hard Problems
inferred← citeshttps://doi.org/10.1587/transcom.e92.b.3102openalex-snapshot
Resource Minimization Method Satisfying Delay Constraint for Replicating Large Contents
inferred← citeshttps://doi.org/10.5555/1998496.1998536openalex-snapshot
Relieving capacity limits on FPGA-based SAT-solvers
inferred← citeshttps://doi.org/10.70675/f3f1f0dbz62f0z44e7z9bedz608c7d549267openalex-snapshot
Conception d'un solveur matériel spécifique pour la résolution rapide du problème SAT appliqué à l'évaluation du risque en génie industriel
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.