On the public citation graph
Logic decomposition during technology mapping
0 signed · 83 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/43.180261openalex-snapshot
A theory and implementation of sequential hardware equivalence
inferredcites →https://doi.org/10.1109/dac.1990.114826openalex-snapshot
Efficient implementation of a BDD package
inferredcites →https://doi.org/10.1109/iccd.1992.276282openalex-snapshot
Sequential circuit design using synthesis and optimization
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
inferredcites →https://doi.org/10.1145/37888.37940openalex-snapshot
DAGON: technology binding and local optimization by DAG matching
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-48550-3_6openalex-snapshot
Congestion Optimization During Technology Mapping and Logic Synthesis
inferred← citeshttps://doi.org/10.1007/978-1-4615-0292-0_14openalex-snapshot
Logic Synthesis Overview
inferred← citeshttps://doi.org/10.1007/978-3-642-57199-2_2openalex-snapshot
Cell-based Logic Optimization
inferred← citeshttps://doi.org/10.1016/b978-0-12-374364-0.50013-8openalex-snapshot
Logic synthesis in a nutshell
inferred← citeshttps://doi.org/10.1016/s0167-9260(99)00023-1openalex-snapshot
Technology mapping for area and speed
inferred← citeshttps://doi.org/10.1021/sb400139hopenalex-snapshot
Optimal Part and Module Selection for Synthetic Gene Circuit Design Automation
inferred← citeshttps://doi.org/10.1021/sb500339kopenalex-snapshot
Fast and Accurate Circuit Design Automation through Hierarchical Model Switching
inferred← citeshttps://doi.org/10.1109/asp-dac58780.2024.10473889openalex-snapshot
In Medio Stat Virtus*: Combining Boolean and Pattern Matching
inferred← citeshttps://doi.org/10.1109/aspdac.2000.835124openalex-snapshot
Timing closure: the solution and its problems
inferred← citeshttps://doi.org/10.1109/aspdac.2011.5722218openalex-snapshot
A robust ECO engine by resource-constraint-aware technology mapping and incremental routing optimization
inferred← citeshttps://doi.org/10.1109/dac.2003.1218874openalex-snapshot
A new-enhanced constructive decomposition and mapping algorithm
inferred← citeshttps://doi.org/10.1109/dac.2003.1219085openalex-snapshot
Gain-based technology mapping for discrete-size cell libraries
inferred← citeshttps://doi.org/10.1109/dac18072.2020.9218500openalex-snapshot
SFO: A Scalable Approach to Fanout-Bounded Logic Synthesis for Emerging Technologies
inferred← citeshttps://doi.org/10.1109/dac18074.2021.9586230openalex-snapshot
SLAP: A Supervised Learning Approach for Priority Cuts Technology Mapping
inferred← citeshttps://doi.org/10.1109/dac18074.2021.9586331openalex-snapshot
Deep Integration of Circuit Simulator and SAT Solver
inferred← citeshttps://doi.org/10.1109/dac56929.2023.10247838openalex-snapshot
Lightweight Structural Choices Operator for Technology Mapping
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11133110openalex-snapshot
E-morphic: Scalable Equality Saturation for Structural Exploration in Logic Synthesis
inferred← citeshttps://doi.org/10.1109/dac63849.2025.11133368openalex-snapshot
Mixed Structural Choice Operator: Enhancing Technology Mapping with Heterogeneous Representations
inferred← citeshttps://doi.org/10.1109/date.1999.761178openalex-snapshot
Wavefront technology mapping
inferred← citeshttps://doi.org/10.1109/date.2009.5090937openalex-snapshot
Variable-latency design by function speculation
inferred← citeshttps://doi.org/10.1109/date.2012.6176724openalex-snapshot
Mapping into LUT structures
inferred← citeshttps://doi.org/10.1109/dtis.2006.1708714openalex-snapshot
Simultaneous delay optimization and depth reduction in logic trees with minimum resources
inferred← citeshttps://doi.org/10.1109/iccad.2001.968615openalex-snapshot
Min-area retiming on flexible circuit structures
inferred← citeshttps://doi.org/10.1109/iccad.2005.1560122openalex-snapshot
Reducing structural bias in technology mapping
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.4681654openalex-snapshot
Robust FPGA resynthesis based on fault-tolerant Boolean matching
inferred← citeshttps://doi.org/10.1109/iccad.2011.6105357openalex-snapshot
Delay optimization using SOP balancing
inferred← citeshttps://doi.org/10.1109/iccad66269.2025.11240920openalex-snapshot
Revisit Choice Network for Synthesis and Technology Mapping
inferred← citeshttps://doi.org/10.1109/iccd.2008.4751913openalex-snapshot
A dynamic accuracy-refinement approach to timing-driven technology mapping
inferred← citeshttps://doi.org/10.1109/iccd.2015.7357109openalex-snapshot
CSL: Coordinated and scalable logic synthesis techniques for effective NBTI reduction
inferred← citeshttps://doi.org/10.1109/icecs.2005.4633590openalex-snapshot
An algebraic approach for transistor circuit synthesis
inferred← citeshttps://doi.org/10.1109/iciinfs.2013.6732055openalex-snapshot
Probabilistic power analysis technique for low power VLSI circuits
inferred← citeshttps://doi.org/10.1109/icraset59632.2023.10419968openalex-snapshot
Dynamic Power Synthesis Techniques for Combinational Circuit
inferred← citeshttps://doi.org/10.1109/jproc.2015.2484299openalex-snapshot
Technology-Dependent Logic Optimization
inferred← citeshttps://doi.org/10.1109/mwscas.2006.382201openalex-snapshot
Simultaneous Delay optimization and Depth reduction in Logic trees with minimum resources
inferred← citeshttps://doi.org/10.1109/norcas66540.2025.11231311openalex-snapshot
The PAE Cell: A Novel Multiple Outputs Logic Cell and Technology Mapping for eFPGA
inferred← citeshttps://doi.org/10.1109/sbcci.2003.1232803openalex-snapshot
Boolean technology mapping based on logic decomposition
inferred← citeshttps://doi.org/10.1109/tasc.2018.2880343openalex-snapshot
PBMap: A Path Balancing Technology Mapping Algorithm for Single Flux Quantum Logic Circuits
inferred← citeshttps://doi.org/10.1109/tcad.2003.811447openalex-snapshot
Timing-driven logic bi-decomposition
inferred← citeshttps://doi.org/10.1109/tcad.2005.860955openalex-snapshot
Using simulation and satisfiability to compute flexibilities in Boolean networks
inferred← citeshttps://doi.org/10.1109/tcad.2006.882484openalex-snapshot
Reducing Structural Bias in Technology Mapping
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.2006.890583openalex-snapshot
Optimizing Sequential Cycles Through Shannon Decomposition and Retiming
inferred← citeshttps://doi.org/10.1109/tcad.2007.907067openalex-snapshot
Technology Mapping Using Logical Effort for Solving the Load-Distribution Problem
inferred← citeshttps://doi.org/10.1109/tcad.2008.2006153openalex-snapshot
A Layout-Level Logic Restructuring Framework for LUT-Based FPGAs
inferred← citeshttps://doi.org/10.1109/tcad.2017.2664059openalex-snapshot
Exact Synthesis of Majority-Inverter Graphs and Its Applications
inferred← citeshttps://doi.org/10.1109/tcad.2024.3457378openalex-snapshot
Enhancing Delay-Driven LUT Mapping With Boolean Decomposition
inferred← citeshttps://doi.org/10.1109/vdat.2007.373253openalex-snapshot
Input Selection Encoding for Low Power Multiplexer Tree
inferred← citeshttps://doi.org/10.1145/1044111.1044121openalex-snapshot
An efficient algorithm for finding the minimal-area FPGA technology mapping
inferred← citeshttps://doi.org/10.1145/1117201.1117208openalex-snapshot
Improvements to technology mapping for LUT-based FPGAs
inferred← citeshttps://doi.org/10.1145/1228784.1228857openalex-snapshot
DAG based library-free technology mapping
inferred← citeshttps://doi.org/10.1145/1353629.1353652openalex-snapshot
A framework for layout-level logic restructuring
inferred← citeshttps://doi.org/10.1145/1508128.1508151openalex-snapshot
FPGA technology mapping with encoded libraries andstaged priority cuts
inferred← citeshttps://doi.org/10.1145/1723112.1723144openalex-snapshot
Global delay optimization using structural choices
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.2429455openalex-snapshot
ICCAD-2012 CAD contest in finding the minimal logic difference for functional ECO and benchmark suite
inferred← citeshttps://doi.org/10.1145/277044.277142openalex-snapshot
Delay-optimal technology mapping by DAG covering
inferred← citeshttps://doi.org/10.1145/360276.360298openalex-snapshot
Simultaneous logic decomposition with technology mapping in FPGA designs
inferred← citeshttps://doi.org/10.1145/544536.544541openalex-snapshot
Technology mapping algorithms for domino logic
inferred← citeshttps://doi.org/10.1145/775832.775871openalex-snapshot
A new enhanced constructive decomposition and mapping algorithm
inferred← citeshttps://doi.org/10.1145/775832.775979openalex-snapshot
Gain-based technology mapping for discrete-size cell libraries
inferred← citeshttps://doi.org/10.1145/775870.775871openalex-snapshot
A new enhanced constructive decomposition and mapping algorithm
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.