On the public citation graph
Fasater: Fpga Based Sat Acceleration with Asynchronous Chain Circuits
0 signed · 26 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/978-3-030-51074-9_4openalex-extracted
The Resolution of Keller’s Conjecture
inferredcites →https://doi.org/10.1007/978-3-319-69404-7_5openalex-extracted
A GRASP for the Minimum Cost SAT Problem
inferredcites →https://doi.org/10.1007/978-3-642-04962-0_28openalex-extracted
Solving SAT Problem Based on Hybrid Differential Evolution Algorithm
inferredcites →https://doi.org/10.1007/s11390-016-1613-yopenalex-extracted
Modular Timing Constraints for Delay-Insensitive Systems
inferredcites →https://doi.org/10.1007/s42979-021-00476-0openalex-extracted
An Efficient Local Search SAT Solver with Effective Preprocessing for Structured Instances
inferredcites →https://doi.org/10.1049/cje.2021.08.001openalex-extracted
An Parallel FPGA SAT Solver Based on Multi‐Thread and Pipeline
inferredcites →https://doi.org/10.1109/access.2020.2980008openalex-extracted
FPGA-Based Hardware/Software Co-Design of a Bio-Inspired SAT Solver
inferredcites →https://doi.org/10.1109/async.2010.11openalex-extracted
Click Elements: An Implementation Style for Data-Driven Compilation
inferredcites →https://doi.org/10.1109/cec55065.2022.9870262openalex-extracted
Asynchronous Evolutionary Algorithm for Finding Backdoors in Boolean Satisfiability
inferredcites →https://doi.org/10.1109/dac.2001.935565openalex-extracted
Chaff: engineering an efficient SAT solver
inferredcites →https://doi.org/10.1109/date.2002.998262openalex-extracted
BerkMin: A fast and robust SAT-solver
inferredcites →https://doi.org/10.1109/fpga.1998.707896openalex-extracted
Accelerating Boolean satisfiability with configurable hardware
inferredcites →https://doi.org/10.1109/iccad.2015.7372575openalex-extracted
SAT solving using FPGA-based heterogeneous computing
inferredcites →https://doi.org/10.1109/icfpt52863.2021.9609882openalex-extracted
Resource-saving FPGA Implementation of the Satisfiability Problem Solver: AmoebaSATslim
inferredcites →https://doi.org/10.1109/qrs-c.2018.00049openalex-extracted
A FPGA Based SAT Solver with High Random and Concurrent Strategies
inferredcites →https://doi.org/10.1109/tcad.2011.2152450openalex-extracted
Efficient Data Structures and Methodologies for SAT-Based ATPG Providing High Fault Coverage in Industrial Application
inferredcites →https://doi.org/10.1109/vtc2020-spring48590.2020.9129464openalex-extracted
Real-Time Routing for Wireless Relay Fronthaul with Vehicle-Mounted Radio Units
inferredcites →https://doi.org/10.1145/186025.186051openalex-extracted
Model checking and abstraction
inferredcites →https://doi.org/10.1145/3039902.3039909openalex-extracted
An FPGA Solver for Partial MaxSAT Problems Based on Stochastic Local Search
inferredcites →https://doi.org/10.1145/321033.321034openalex-extracted
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/3302509.3313319openalex-extracted
FPGA-Based amoeba-inspired SAT solver for cyber-physical systems
inferredcites →https://doi.org/10.1145/368273.368557openalex-extracted
A machine program for theorem-proving
inferredcites →https://doi.org/10.23919/mipro48935.2020.9245421openalex-extracted
A Different Approach for Clique and Household Analysis in Synthetic Telecom Data Using Propositional Logic
inferredcites →https://doi.org/10.25405/ncl.34122984openalex-extracted
Logic Synthesis for Asynchronous Circuits Based on STG Unfoldings and Incremental SAT
inferredcites →https://doi.org/10.3233/978-1-61499-672-9-810openalex-extracted
Efficient SAT Approach to Multi-Agent Path Finding Under the Sum of Costs Objective
inferredcites →https://doi.org/10.5555/2840819.2840853openalex-extracted
SAT Solving using FPGA-based Heterogeneous Computing
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.