On the public citation graph

Building a Better Boolean Matcher and Symmetry Detector

0 signed · 77 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-56922-7_38openalex-snapshot
Symmetry and model checking
inferredcites →https://doi.org/10.1007/bf00625970openalex-snapshot
Symmetry and model checking
inferredcites →https://doi.org/10.1016/0165-1684(85)90052-0openalex-snapshot
Spectral techniques in digital logic
inferredcites →https://doi.org/10.1109/aspdac.1995.486356openalex-snapshot
Limits of using signatures for permutation independent Boolean comparison
inferredcites →https://doi.org/10.1109/aspdac.2004.1337660openalex-snapshot
Efficient computation of canonical form for boolean matching in large libraries
inferredcites →https://doi.org/10.1109/dac.2005.193838openalex-snapshot
A new canonical form for fast Boolean matching in logic synthesis and verification
inferredcites →https://doi.org/10.1109/edac.1990.136647openalex-snapshot
Technology mapping using Boolean matching and don't care sets
inferredcites →https://doi.org/10.1109/edac.1993.386495openalex-snapshot
Permutation and phase independent Boolean comparison
inferredcites →https://doi.org/10.1109/iccad.1992.279337openalex-snapshot
Efficient Boolean function matching
inferredcites →https://doi.org/10.1109/iccd.1992.276313openalex-snapshot
Boolean matching using binary decision diagrams with applications to logic synthesis and verification
inferredcites →https://doi.org/10.1109/iccd.1994.331849openalex-snapshot
Efficient Boolean matching algorithm for cell libraries
inferredcites →https://doi.org/10.1109/tcad.2003.810744openalex-snapshot
Efficient canonical form for boolean matching of complex functions in large libraries
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/157485.164569openalex-snapshot
Spectral transforms for large boolean functions with applications to technology mapping
inferredcites →https://doi.org/10.1145/224818.224955openalex-snapshot
Limits of using signatures for permutation independent Boolean comparison
inferredcites →https://doi.org/10.1145/277044.277100openalex-snapshot
Boolean matching for large libraries
inferredcites →https://doi.org/10.1145/296399.296425openalex-snapshot
Cut ranking and pruning
inferredcites →https://doi.org/10.1145/320986.320995openalex-snapshot
Logic Matrices and the Truth Function Problem
inferredcites →https://doi.org/10.1145/996566.996712openalex-snapshot
Exploiting structure in symmetry detection for CNF
inferredcites →https://doi.org/10.5555/1015090.1015251openalex-snapshot
Efficient computation of canonical form for Boolean matching in large libraries
inferredcites →https://doi.org/10.5555/949970.950018openalex-snapshot
Technology mapping using Boolean matching and don't care sets

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-1-4419-7518-8_13openalex-snapshot
Large-Scale Boolean Matching
inferred← citeshttps://doi.org/10.1007/978-3-642-02652-2_22openalex-snapshot
Automatic Discovery of Transition Symmetry in Multithreaded Programs Using Dynamic Analysis
inferred← citeshttps://doi.org/10.1007/978-981-96-8935-4_6openalex-snapshot
New Devices
inferred← citeshttps://doi.org/10.1007/s10586-018-1787-xopenalex-snapshot
An efficient NPN Boolean matching algorithm based on structural signature and Shannon expansion
inferred← citeshttps://doi.org/10.1049/iet-cdt.2009.0008openalex-snapshot
Power minimisation during field programmable gate array placement
inferred← citeshttps://doi.org/10.1109/3dic.2012.6263022openalex-snapshot
A novel reconfigurable logic device base on 3D stack technology
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/date.2010.5456949openalex-snapshot
Large-scale Boolean matching
inferred← citeshttps://doi.org/10.1109/fpl.2010.105openalex-snapshot
Efficient FPGA Resynthesis Using Precomputed LUT Structures
inferred← citeshttps://doi.org/10.1109/fpl.2010.68openalex-snapshot
COGRE: A Configuration Memory Reduced Reconfigurable Logic Cell Architecture for Area Minimization
inferred← citeshttps://doi.org/10.1109/fpl.2014.6927460openalex-snapshot
A logic cell architecture exploiting the shannon expansion for the reduction of configuration memory
inferred← citeshttps://doi.org/10.1109/fpl.2014.6927504openalex-snapshot
Towards dark silicon era in FPGAs using complementary hard logic design
inferred← citeshttps://doi.org/10.1109/fpl.2015.7293953openalex-snapshot
An efficient reconfigurable architecture by characterizing most frequent logic functions
inferred← citeshttps://doi.org/10.1109/fpl.2016.7577306openalex-snapshot
Fast hierarchical NPN classification
inferred← citeshttps://doi.org/10.1109/fpl.2018.00008openalex-snapshot
Fast Adjustable NPN Classification using Generalized Symmetries
inferred← citeshttps://doi.org/10.1109/fpt.2010.5681775openalex-snapshot
A robust reconfigurable logic device based on less configuration memory logic cell
inferred← citeshttps://doi.org/10.1109/fpt.2013.6718374openalex-snapshot
Fast Boolean matching based on NPN classification
inferred← citeshttps://doi.org/10.1109/iccad.2006.320078openalex-snapshot
Factor Cuts
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397264openalex-snapshot
Design, synthesis and evaluation of heterogeneous FPGA with mixed LUTs and macro-gates
inferred← citeshttps://doi.org/10.1109/iccad.2008.4681549openalex-snapshot
Boolean factoring and decomposition of logic networks
inferred← citeshttps://doi.org/10.1109/iccad51958.2021.9643587openalex-snapshot
Enhanced Fast Boolean Matching based on Sensitivity Signatures Pruning
inferred← citeshttps://doi.org/10.1109/iccad57390.2023.10323783openalex-snapshot
Fast Exact NPN Classification with Influence-Aided Canonical Form
inferred← citeshttps://doi.org/10.1109/iccd.2011.6081434openalex-snapshot
AIG rewriting using 5-input cuts
inferred← citeshttps://doi.org/10.1109/infoman.2017.7950421openalex-snapshot
Cofactor-based NPN boolean matching algorithm
inferred← citeshttps://doi.org/10.1109/intellect.2017.8277632openalex-snapshot
Logic algebra for exploiting shared SRAM-table based FPGAs for large LUT inputs
inferred← citeshttps://doi.org/10.1109/iscas.2014.6865094openalex-snapshot
A new VLSI IC design automation methodology with reduced NRE costs and time-to-market using the NPN class Representation and functional symmetry
inferred← citeshttps://doi.org/10.1109/ised.2014.31openalex-snapshot
A New Dynamic Library Based IC Design Automation Methodology Using Functional Symmetry with NPN Class Representation Approach to Reduce NRE Costs and Time-to-Market
inferred← citeshttps://doi.org/10.1109/ised.2014.35openalex-snapshot
Effect of Constant One and Zero, Shared and Non-decomposed Nodes on Runtime and Graph Size of the Shannon Factor Graph (SFG)
inferred← citeshttps://doi.org/10.1109/isqed.2006.65openalex-snapshot
Fast Boolean Matching with Don’t Cares
inferred← citeshttps://doi.org/10.1109/jproc.2015.2484299openalex-snapshot
Technology-Dependent Logic Optimization
inferred← citeshttps://doi.org/10.1109/les.2013.2280582openalex-snapshot
Fast Filter-Based Boolean Matchers
inferred← citeshttps://doi.org/10.1109/tc.2016.2636141openalex-snapshot
PEAF: A Power-Efficient Architecture for SRAM-Based FPGAs Using Reconfigurable Hard Logic Design in Dark Silicon Era
inferred← citeshttps://doi.org/10.1109/tc.2020.2971466openalex-snapshot
Fast Exact NPN Classification by Co-Designing Canonical Form and Its Computation Algorithm
inferred← citeshttps://doi.org/10.1109/tcad.2008.923256openalex-snapshot
Symmetry Detection and Boolean Matching Utilizing a Signature-Based Canonical Form of Boolean Functions
inferred← citeshttps://doi.org/10.1109/tcad.2009.2014001openalex-snapshot
Design and Synthesis of Programmable Logic Block With Mixed LUT and Macrogate
inferred← citeshttps://doi.org/10.1109/tcad.2009.2016547openalex-snapshot
A Transform-Parametric Approach to Boolean Matching
inferred← citeshttps://doi.org/10.1109/tcad.2018.2812118openalex-snapshot
An Efficient SRAM-Based Reconfigurable Architecture for Embedded Processors
inferred← citeshttps://doi.org/10.1109/tcsii.2016.2551555openalex-snapshot
A Hybrid Logic Block Architecture in FPGA for Holistic Efficiency
inferred← citeshttps://doi.org/10.1109/tencon.2010.5686014openalex-snapshot
A less configuration memory reconfigurable logic device with error detect and correct circuit
inferred← citeshttps://doi.org/10.1145/1233501.1233531openalex-snapshot
Factor cuts
inferred← citeshttps://doi.org/10.1145/1255456.1255469openalex-snapshot
Postplacement rewiring by exhaustive search for functional symmetries
inferred← citeshttps://doi.org/10.1145/1278480.1278689openalex-snapshot
A unified approach to canonical form-based Boolean matching
inferred← citeshttps://doi.org/10.1145/1391469.1391509openalex-snapshot
Faster symmetry discovery using sparsity of symmetries
inferred← citeshttps://doi.org/10.1145/1508128.1508151openalex-snapshot
FPGA technology mapping with encoded libraries andstaged priority cuts
inferred← citeshttps://doi.org/10.1145/1514932.1514955openalex-snapshot
Physical optimization for FPGAs using post-placement topology rewriting
inferred← citeshttps://doi.org/10.1145/1723112.1723145openalex-snapshot
Building a faster boolean matcher using bloom filter
inferred← citeshttps://doi.org/10.1145/1973009.1973095openalex-snapshot
Integrated logic synthesis using simulated annealing
inferred← citeshttps://doi.org/10.1145/2068716.2068721openalex-snapshot
FPGA technology mapping with encoded libraries and staged priority cuts
inferred← citeshttps://doi.org/10.1145/2429384.2429513openalex-snapshot
Lazy man's logic synthesis
inferred← citeshttps://doi.org/10.1587/transfun.2022vlp0008openalex-snapshot
An eFPGA Generation Suite with Customizable Architecture and IDE
inferred← citeshttps://doi.org/10.1587/transfun.e99.a.2500openalex-snapshot
SLM: A Scalable Logic Module Architecture with Less Configuration Memory
inferred← citeshttps://doi.org/10.1587/transinf.e95.d.294openalex-snapshot
COGRE: A Novel Compact Logic Cell Architecture for Area Minimization
inferred← citeshttps://doi.org/10.23919/date56975.2023.10136889openalex-snapshot
Rethinking NPN Classification from Face and Point Characteristics of Boolean Functions
inferred← citeshttps://doi.org/10.23919/date69613.2026.11539588openalex-snapshot
Compacted-LUT: Fine-Grained Customizable LUT Architecture via SRAM-MUX Co-Optimization
inferred← citeshttps://doi.org/10.5555/1509456.1509477openalex-snapshot
Boolean factoring and decomposition of logic networks
inferred← citeshttps://doi.org/10.5555/1870926.1871111openalex-snapshot
Large-scale Boolean matching
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.