On the public citation graph

DAG-aware AIG rewriting: a fresh look at combinational logic synthesis

0 signed · 96 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.1049/ep.1980.0099openalex-snapshot
Logic Design and Switching Theory
inferredcites →https://doi.org/10.1109/43.273754openalex-snapshot
FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs
inferredcites →https://doi.org/10.1109/5.52213openalex-snapshot
Multilevel logic synthesis
inferredcites →https://doi.org/10.1109/date.2005.264openalex-snapshot
SAT-Based Complete Don't-Care Computation for Network Optimization
inferredcites →https://doi.org/10.1109/iccad.1997.643371openalex-snapshot
The disjunctive decomposition of logic functions
inferredcites →https://doi.org/10.1109/iccad.2004.1382541openalex-snapshot
DAG-aware circuit compression for formal verification
inferredcites →https://doi.org/10.1109/iccad.2005.1560122openalex-snapshot
Reducing structural bias in technology mapping
inferredcites →https://doi.org/10.1109/iccad.2006.320087openalex-snapshot
Improvements to Combinational Equivalence Checking
inferredcites →https://doi.org/10.1109/tcad.2003.811447openalex-snapshot
Timing-driven logic bi-decomposition
inferredcites →https://doi.org/10.1109/tcad.2006.887925openalex-snapshot
Improvements to Technology Mapping for LUT-Based FPGAs
inferredcites →https://doi.org/10.1145/275107.275118openalex-snapshot
A new retiming-based technology mapping algorithm for LUT-based FPGAs
inferredcites →https://doi.org/10.1145/277044.277142openalex-snapshot
Delay-optimal technology mapping by DAG covering

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-030-16670-0_6openalex-snapshot
Towards a Scalable EA-Based Optimization of Digital Circuits
inferred← citeshttps://doi.org/10.1007/978-3-030-89051-3_14openalex-snapshot
Simplifying Alternating Automata for Emptiness Testing
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_17openalex-snapshot
Certifying Phase Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-031-80629-2_3openalex-snapshot
Background
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_24openalex-snapshot
Everything You Always Wanted to Know about Blocked Sets (But Were Afraid to Ask)
inferred← citeshttps://doi.org/10.1007/978-3-319-21690-4_43openalex-snapshot
Fast Interpolating BMC
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-66167-4_9openalex-snapshot
Solving SAT and MaxSAT with a Quantum Annealer: Foundations and a Preliminary Report
inferred← citeshttps://doi.org/10.1007/978-3-319-67522-0_1openalex-snapshot
Introduction
inferred← citeshttps://doi.org/10.1007/978-3-319-67522-0_2openalex-snapshot
Background
inferred← citeshttps://doi.org/10.1007/978-3-319-98965-5_2openalex-snapshot
Preliminaries
inferred← citeshttps://doi.org/10.1007/978-3-319-98965-5_5openalex-snapshot
Synthesis Techniques for Approximation Circuits
inferred← citeshttps://doi.org/10.1007/978-3-642-14295-6_5openalex-snapshot
ABC: An Academic Industrial-Strength Verification Tool
inferred← citeshttps://doi.org/10.1007/978-3-642-39611-3_14openalex-snapshot
Automated Reencoding of Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-981-97-9314-3_27openalex-snapshot
Approximate Computing Architectures
inferred← citeshttps://doi.org/10.1007/978-981-97-9314-3_35openalex-snapshot
Bit-Level Model Checking
inferred← citeshttps://doi.org/10.1007/978-981-99-7755-0_9openalex-snapshot
Logic Synthesis
inferred← citeshttps://doi.org/10.1007/s10766-011-0164-7openalex-snapshot
Speeding Up Cycle Based Logic Simulation Using Graphics Processing Units
inferred← citeshttps://doi.org/10.1007/s10817-011-9239-9openalex-snapshot
Simulating Circuit-Level Simplifications on CNF
inferred← citeshttps://doi.org/10.1007/s11227-020-03430-8openalex-snapshot
A survey on design and synthesis techniques for photonic integrated circuits
inferred← citeshttps://doi.org/10.1007/s11767-014-4090-xopenalex-snapshot
Review of advanced FPGA architectures and technologies
inferred← citeshttps://doi.org/10.1016/j.mejo.2017.08.006openalex-snapshot
Soft error tolerant design of combinational circuits based on a local logic substitution scheme
inferred← citeshttps://doi.org/10.1016/j.micpro.2011.06.004openalex-snapshot
Area and speed oriented synthesis of FSMs for PAL-based CPLDs
inferred← citeshttps://doi.org/10.1016/j.micpro.2025.105199openalex-snapshot
Polynomial formal verification parameterized by cutwidth properties of a circuit using Boolean satisfiability
inferred← citeshttps://doi.org/10.1049/iet-cdt.2017.0097openalex-snapshot
Design and synthesis of improved reversible circuits using AIG‐ and MIG‐based graph data structures
inferred← citeshttps://doi.org/10.1109/aspdac.2014.6742962openalex-snapshot
Synthesis of power- and area-efficient binary machines for incompletely specified sequences
inferred← citeshttps://doi.org/10.1109/async.2013.13openalex-snapshot
Can QDI Combinational Circuits be Implemented without C-elements?
inferred← citeshttps://doi.org/10.1109/dac56929.2023.10247824openalex-snapshot
Design Automation for Cryogenic CMOS Circuits
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11132893openalex-snapshot
ELF: Efficient Logic Synthesis by Pruning Redundancy in Refactoring
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11132969openalex-snapshot
ChatLS: Multimodal Retrieval-Augmented Generation and Chain-of-Thought for Logic Synthesis Script Customization
inferred← citeshttps://doi.org/10.1109/date.2012.6176724openalex-snapshot
Mapping into LUT structures
inferred← citeshttps://doi.org/10.1109/ddecs.2009.5012094openalex-snapshot
Improve clock gating through power-optimal enable function selection
inferred← citeshttps://doi.org/10.1109/dft.2011.46openalex-snapshot
Impact of Synthesis Constraints on Error Propagation Probability of Digital Circuits
inferred← citeshttps://doi.org/10.1109/dsd.2009.156openalex-snapshot
The Case for a Balanced Decomposition Process
inferred← citeshttps://doi.org/10.1109/fmcad.2008.ecp.8openalex-snapshot
Recording Synthesis History for Sequential Verification
inferred← citeshttps://doi.org/10.1109/fpl.2009.5272537openalex-snapshot
Improving logic density through synthesis-inspired architecture
inferred← citeshttps://doi.org/10.1109/fpt.2013.6718328openalex-snapshot
A case for hardened multiplexers in FPGAs
inferred← citeshttps://doi.org/10.1109/iccad.2008.4681549openalex-snapshot
Boolean factoring and decomposition of logic networks
inferred← citeshttps://doi.org/10.1109/iccad.2008.4681580openalex-snapshot
Scalable and scalably-verifiable sequential synthesis
inferred← citeshttps://doi.org/10.1109/iccad.2011.6105357openalex-snapshot
Delay optimization using SOP balancing
inferred← citeshttps://doi.org/10.1109/iccad.2013.6691129openalex-snapshot
ICCAD-2013 CAD contest in technology mapping for macro blocks and benchmark suite
inferred← citeshttps://doi.org/10.1109/iccd.2006.4380826openalex-snapshot
Scalable Sequential Equivalence Checking across Arbitrary Design Transformations
inferred← citeshttps://doi.org/10.1109/iccd.2008.4751840openalex-snapshot
Propositional approximations for bounded model checking of partial circuit designs
inferred← citeshttps://doi.org/10.1109/iccd.2010.5647772openalex-snapshot
Boolean factoring with multi-objective goals
inferred← citeshttps://doi.org/10.1109/iccd.2011.6081434openalex-snapshot
AIG rewriting using 5-input cuts
inferred← citeshttps://doi.org/10.1109/isdcs58735.2023.10153522openalex-snapshot
Towards Polynomial Formal Verification of AI-Generated Arithmetic Circuits
inferred← citeshttps://doi.org/10.1109/iseda59274.2023.10218518openalex-snapshot
An Integrated Logic Function Decomposition Flow for XOR-Majority Graphs
inferred← citeshttps://doi.org/10.1109/isocc.2012.6407071openalex-snapshot
Error Injection & Correction: An efficient formal logic restructuring algorithm
inferred← citeshttps://doi.org/10.1109/isqed.2012.6187500openalex-snapshot
Functional composition: A new paradigm for performing logic synthesis
inferred← citeshttps://doi.org/10.1109/isqed.2014.6783381openalex-snapshot
Automated methods for eliminating X bugs
inferred← citeshttps://doi.org/10.1109/nano61778.2024.10628717openalex-snapshot
Reducing Wire Crossings in Field-Coupled Nanotechnologies
inferred← citeshttps://doi.org/10.1109/nano63165.2025.11113822openalex-snapshot
A Fully Planar Approach to Field-Coupled Nanocomputing: Scalable Placement and Routing Without Wire Crossings
inferred← citeshttps://doi.org/10.1109/patmos.2014.6951885openalex-snapshot
Optimization on cell-library design for digital Application Specific Printed Electronics Circuits
inferred← citeshttps://doi.org/10.1109/socc.2014.6948940openalex-snapshot
Reliability aware logic synthesis through rewriting
inferred← citeshttps://doi.org/10.1109/tcad.2006.887925openalex-snapshot
Improvements to Technology Mapping for LUT-Based FPGAs
inferred← citeshttps://doi.org/10.1109/tcad.2008.2003272openalex-snapshot
Exploiting Symmetries to Speed Up SAT-Based Boolean Matching for Logic Synthesis of FPGAs
inferred← citeshttps://doi.org/10.1109/tcad.2008.2006156openalex-snapshot
Optimizing Nonmonotonic Interconnect Using Functional Simulation and Logic Restructuring
inferred← citeshttps://doi.org/10.1109/tcad.2008.915545openalex-snapshot
Scalable Synthesis and Clustering Techniques Using Decision Diagrams
inferred← citeshttps://doi.org/10.1109/tcad.2009.2013995openalex-snapshot
Inferno: Streamlining Verification With Inferred Semantics
inferred← citeshttps://doi.org/10.1109/tcad.2010.2041847openalex-snapshot
Partitioning Interpolant-Based Verification for Effective Unbounded Model Checking
inferred← citeshttps://doi.org/10.1109/tcad.2010.2058510openalex-snapshot
Fast Node Merging With Don't Cares Using Logic Implications
inferred← citeshttps://doi.org/10.1109/tcad.2011.2165067openalex-snapshot
Field Programmable Stateful Logic Array
inferred← citeshttps://doi.org/10.1109/tcad.2015.2488484openalex-snapshot
Majority-Inverter Graph: A New Paradigm for Logic Optimization
inferred← citeshttps://doi.org/10.1109/tvlsi.2015.2451658openalex-snapshot
Hybrid LUT/Multiplexer FPGA Logic Architectures
inferred← citeshttps://doi.org/10.1109/vlsid.2014.20openalex-snapshot
Effective Liveness Verification Using a Transformation-Based Framework
inferred← citeshttps://doi.org/10.1145/2660540.2661008openalex-snapshot
Deriving Reduced Transistor Count Circuits from AIGs
inferred← citeshttps://doi.org/10.1145/3127041.3127065openalex-snapshot
Yise - a novel framework for boolean networks using y-inverter graphs
inferred← citeshttps://doi.org/10.1145/3240765.3240790openalex-snapshot
DALS
inferred← citeshttps://doi.org/10.1145/3287624.3287671openalex-snapshot
Structural rewriting in XOR-majority graphs
inferred← citeshttps://doi.org/10.1145/3649329.3655904openalex-snapshot
PONO: Power Optimization with Near Optimal SMT-based Sub-circuit Generation
inferred← citeshttps://doi.org/10.1145/3649476.3658739openalex-snapshot
Incremental SAT-based Exact Synthesis
inferred← citeshttps://doi.org/10.1145/3771280openalex-snapshot
Advanced And-Inverter Graph Decomposition Technique for Reducing Circuit Complexity
inferred← citeshttps://doi.org/10.1515/itit-2024-0073openalex-snapshot
PSOP decomposition for EXOR-based synthesis
inferred← citeshttps://doi.org/10.23919/date56975.2023.10136964openalex-snapshot
ObfusLock: An Efficient Obfuscated Locking Framework for Circuit IP Protection†
inferred← citeshttps://doi.org/10.23919/date58400.2024.10546512openalex-snapshot
BoolGebra: Attributed Graph-Learning for Boolean Algebraic Manipulation
inferred← citeshttps://doi.org/10.23919/date58400.2024.10546807openalex-snapshot
Scalable Logic Rewriting Using Don't Cares
inferred← citeshttps://doi.org/10.25046/aj040123openalex-snapshot
Critical Embedded Systems Development Using Formal Methods and Statistical Reliability Metrics
inferred← citeshttps://doi.org/10.3390/app10113926openalex-snapshot
Technology Mapping of FSM Oriented to LUT-Based FPGA
inferred← citeshttps://doi.org/10.3390/chips3020008openalex-snapshot
Directed Acyclic Graph-Based Datapath Synthesis Using Graph Isomorphism and Gate Reconfiguration
inferred← citeshttps://doi.org/10.3390/electronics11030382openalex-snapshot
Techniques for SAT-Based Boolean Reasoning on Multiple Faults Affecting Logic Cells and Interconnects in Digital ICs
inferred← citeshttps://doi.org/10.5555/1509456.1509477openalex-snapshot
Boolean factoring and decomposition of logic networks
inferred← citeshttps://doi.org/10.5555/1509456.1509516openalex-snapshot
Scalable and scalably-verifiable sequential synthesis
inferred← citeshttps://doi.org/10.5555/2492708.2493093openalex-snapshot
Mapping into LUT structures
inferred← citeshttps://doi.org/10.5555/2561828.2561882openalex-snapshot
ICCAD-2013 CAD contest in technology mapping for macro blocks and benchmark suite
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.