On the public citation graph
A Configurable Hardware/Software Approach to SAT Solving
0 signed · 29 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-61730-2_14openalex-snapshot
Solving satisfiability problems on FPGAs
inferredcites →https://doi.org/10.1007/3-540-63104-6_28openalex-snapshot
SATO: An efficient propositional prover
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/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1109/43.108614openalex-snapshot
Test pattern generation using Boolean satisfiability
inferredcites →https://doi.org/10.1109/43.402496openalex-snapshot
Asynchronous circuit synthesis with Boolean satisfiability
inferredcites →https://doi.org/10.1109/43.536723openalex-snapshot
Combinational test generation using satisfiability
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.1109/fpga.2000.903388openalex-snapshot
A scalable, loadable custom programmable logic device for solving Boolean satisfiability problems
inferredcites →https://doi.org/10.1109/iccad.1989.76956openalex-snapshot
Optimal layout via Boolean satisfiability
inferredcites →https://doi.org/10.1109/iccad.1991.185225openalex-snapshot
Timing analysis and delay-fault test generation using path-recursive functions
inferredcites →https://doi.org/10.1109/iscas.1998.705250openalex-snapshot
Realistic delay modeling in satisfiability-based timing analysis
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.1145/296399.296450openalex-snapshot
Satisfiability-based layout revisited
inferredcites →https://doi.org/10.1145/337292.337611openalex-snapshot
Boolean satisfiability in electronic design automation
inferredcites →https://doi.org/10.1145/800157.805047openalex-snapshot
The complexity of theorem-proving procedures
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-540-79719-7_6openalex-snapshot
Designing an Efficient Hardware Implication Accelerator for SAT Solving
inferred← citeshttps://doi.org/10.1016/s1383-7621(02)00067-xopenalex-snapshot
Reconfigurable models of finite state machines and their implementation in FPGAs
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.1109/aemcse51986.2021.00234openalex-snapshot
A Framework of SAT Solver Based on the ZYNQ
inferred← citeshttps://doi.org/10.1109/jproc.2014.2386883openalex-snapshot
Reconfigurable Computing Architectures
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.1145/1150343.1150380openalex-snapshot
A fast SAT solver algorithm best suited to reconfigurable hardware
inferred← citeshttps://doi.org/10.5555/1998496.1998536openalex-snapshot
Relieving capacity limits on FPGA-based SAT-solvers
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.