On the public citation graph
Large-scale Boolean matching
0 signed · 30 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.1109/dac.2007.375281openalex-snapshot
A Unified Approach to Canonical Form-based Boolean Matching
inferredcites →https://doi.org/10.1109/date.2006.243959openalex-snapshot
Building a Better Boolean Matcher and Symmetry Detector
inferredcites →https://doi.org/10.1109/iccad.2006.320087openalex-snapshot
Improvements to Combinational Equivalence Checking
inferredcites →https://doi.org/10.1109/iccad.2007.4397270openalex-snapshot
Scalable exploration of functional dependency by interpolation and incremental SAT solving
inferredcites →https://doi.org/10.1145/1065579.1065681openalex-snapshot
A new canonical form for fast boolean matching in logic synthesis and verification
inferredcites →https://doi.org/10.1145/1391469.1391635openalex-snapshot
Signature based Boolean matching in the presence of don't cares
inferredcites →https://doi.org/10.1145/1629911.1630016openalex-snapshot
Simulation and SAT-based Boolean matching for large Boolean networks
inferredcites →https://doi.org/10.1145/264995.264996openalex-snapshot
A survey of Boolean matching techniques for library binding
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1145/368273.368557openalex-snapshot
A machine program for theorem-proving
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-319-40970-2_14openalex-snapshot
Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT
inferred← citeshttps://doi.org/10.1007/978-3-319-49052-6_1openalex-snapshot
SAT-Based Combinational and Sequential Dependency Computation
inferred← citeshttps://doi.org/10.1007/s10710-011-9132-7openalex-snapshot
Formal verification of candidate solutions for post-synthesis evolutionary optimization in evolvable hardware
inferred← citeshttps://doi.org/10.1109/access.2017.2778338openalex-snapshot
A Canonical-Based NPN Boolean Matching Algorithm Utilizing Boolean Difference and Cofactor Signature
inferred← citeshttps://doi.org/10.1109/aspdac.2018.8297387openalex-snapshot
A two-step search engine for large scale boolean matching under NP3 equivalence
inferred← citeshttps://doi.org/10.1109/date.2011.5763326openalex-snapshot
A global postsynthesis optimization method for combinational circuits
inferred← citeshttps://doi.org/10.1109/dsd.2013.65openalex-snapshot
Automatic Hard Block Inference on FPGAs
inferred← citeshttps://doi.org/10.1109/fccm.2015.55openalex-snapshot
Protecting against Cryptographic Trojans in FPGAs
inferred← citeshttps://doi.org/10.1109/icc.2012.6364542openalex-snapshot
Evaluating component hiding techniques in circuit topologies
inferred← citeshttps://doi.org/10.1109/iccad.2010.5654215openalex-snapshot
Boolean matching of function vectors with strengthened learning
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323797openalex-snapshot
Invited Paper: 2023 ICCAD CAD Contest Problem A: Multi-Bit Large-Scale Boolean Matching
inferred← citeshttps://doi.org/10.1109/iscas.2017.8050970openalex-snapshot
Search space reduction for the non-exact projective NPNP Boolean matching problem
inferred← citeshttps://doi.org/10.1109/tcad.2025.3628790openalex-snapshot
BoolSkeleton : Boolean Network Skeletonization via Homogeneous Pattern Reduction
inferred← citeshttps://doi.org/10.1109/tnnls.2015.2442593openalex-snapshot
Control of Large-Scale Boolean Networks via Network Aggregation
inferred← citeshttps://doi.org/10.1109/tqe.2025.3595275openalex-snapshot
A Grover-Meets-Simon Approach to Match Vector Boolean Functions
inferred← citeshttps://doi.org/10.1134/s1063739721070131openalex-snapshot
Boolean Satisfiability Methods for Modern Computer-Aided Design Problems in Microelectronics
inferred← citeshttps://doi.org/10.1587/transfun.e99.a.1355openalex-snapshot
Fast and Efficient Signature-Based Sub-Circuit Matching
inferred← citeshttps://doi.org/10.23919/fmcad.2019.8894294openalex-snapshot
Input Elimination Transformations for Scalable Verification and Trace Reconstruction
inferred← citeshttps://doi.org/10.3390/sym11010027openalex-snapshot
A New Pairwise NPN Boolean Matching Algorithm Based on Structural Difference Signature
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.