On the public citation graph
Solving boolean satisfiability with dynamic hardware configurations
0 signed · 41 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-63465-7_250openalex-snapshot
Satisfiability on reconfigurable hardware
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/fpga.1998.707896openalex-snapshot
Accelerating Boolean satisfiability with configurable hardware
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/277044.277098openalex-snapshot
Using reconfigurable computing techniques to accelerate problems in the CAD domain
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/3-540-44614-1_50openalex-snapshot
A Parallel Pipelined SAT Solver for FPGA’s
inferred← citeshttps://doi.org/10.1007/3-540-44687-7_33openalex-snapshot
Run-Time Performance Optimization of an FPGA-Based Deduction Engine for 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-45234-8_46openalex-snapshot
Reconfigurable Hardware SAT Solvers: A Survey of Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-71431-6_32openalex-snapshot
A Hardware SAT Solver Using Non-chronological Backtracking and Clause Recording Without Overheads
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/b978-012170960-0/50029-3openalex-snapshot
Configurable Computing
inferred← citeshttps://doi.org/10.1016/b978-012370522-8.50038-8openalex-snapshot
Boolean Satisfiability
inferred← citeshttps://doi.org/10.1023/a:1006310219368openalex-snapshot
A SAT Solver Using Reconfigurable Hardware and Virtual Logic
inferred← citeshttps://doi.org/10.1049/ip-cdt:20000486openalex-snapshot
Framework and tools for run-time reconfigurable designs
inferred← citeshttps://doi.org/10.1109/43.766733openalex-snapshot
Using configurable computing to accelerate Boolean satisfiability
inferred← citeshttps://doi.org/10.1109/92.920826openalex-snapshot
Solving satisfiability problems using reconfigurable computing
inferred← citeshttps://doi.org/10.1109/aiccsa.2008.4493521openalex-snapshot
Hardware based algorithm for conflict diagnosis in SAT solver
inferred← citeshttps://doi.org/10.1109/fccm.2001.3openalex-snapshot
A Configurable Hardware/Software Approach to SAT Solving
inferred← citeshttps://doi.org/10.1109/fpga.1999.803708openalex-snapshot
A virtual logic algorithm for solving satisfiability problems using reconfigurable hardware
inferred← citeshttps://doi.org/10.1109/fpga.2000.903388openalex-snapshot
A scalable, loadable custom programmable logic device for solving Boolean satisfiability problems
inferred← citeshttps://doi.org/10.1109/fpt.2009.5377610openalex-snapshot
Demonstration of hardware-accelerated formal verification
inferred← citeshttps://doi.org/10.1109/hicss.1999.772883openalex-snapshot
Dynamic circuit generation for Boolean satisfiability in an object-oriented design environment
inferred← citeshttps://doi.org/10.1109/iccd.2001.955064openalex-snapshot
Matching architecture to application via configurable processors: a case study with boolean satisfiability problem
inferred← citeshttps://doi.org/10.1109/icces.2006.320437openalex-snapshot
A Hardware Accelerator for SAT Solving
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/jproc.2002.801446openalex-snapshot
Reconfigurable computing systems
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/1177352.1177354openalex-snapshot
Propositional Satisfiability and Constraint Programming
inferred← citeshttps://doi.org/10.1145/1391469.1391669openalex-snapshot
A practical reconfigurable hardware accelerator for Boolean satisfiability solvers
inferred← citeshttps://doi.org/10.1145/1497561.1497576openalex-snapshot
FPGA-based hardware acceleration for Boolean satisfiability
inferred← citeshttps://doi.org/10.1145/500001.500059openalex-snapshot
Accelerating boolean satisfiability through application specific processing
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.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
inferred← citeshttps://doi.org/10.7936/k7fq9tncopenalex-snapshot
Parallelization of dynamic programming recurrences in computational biology
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.