On the public citation graph

The transduction method-design of logic networks based on permissible functions

0 signed · 250 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/978-1-4615-8243-4_5openalex-snapshot
Logical Design of Optimal Digital Networks by Integer Programming
inferredcites →https://doi.org/10.1049/ep.1980.0099openalex-snapshot
Logic Design and Switching Theory
inferredcites →https://doi.org/10.1109/pgec.1965.264081openalex-snapshot
A Computer-Oriented Factoring Algorithm for NOR Logic Design
inferredcites →https://doi.org/10.1109/pgec.1965.264209openalex-snapshot
A Synthesis of Combinational Logic with NAND or NOR Elements
inferredcites →https://doi.org/10.1109/t-c.1971.223156openalex-snapshot
Computer-Aided Synthesis or Multiple-Output Multilevel NAND Networks witk Fan-in and Fan-out Constraints
inferredcites →https://doi.org/10.1109/t-c.1972.223426openalex-snapshot
A Transform for NAND Network Design
inferredcites →https://doi.org/10.1109/t-c.1974.223778openalex-snapshot
Optimal One-Bit Full Adders With Different Types of Gates
inferredcites →https://doi.org/10.1109/tc.1976.1674714openalex-snapshot
Minimization of Logic Networks Under a Generalized Cost Function
inferredcites →https://doi.org/10.1287/opre.19.4.1090openalex-snapshot
Technical Note—Results in Using Gomory's All-Integer Integer Algorithm to Design Optimum Logic Networks

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/(sici)1520-684x(199910)30:11<12::aid-scj2>3.0.co;2-mopenalex-snapshot
FPGA circuit optimization using block integration based on multiple output capability
inferred← citeshttps://doi.org/10.1002/047134608x.w1802openalex-snapshot
Logic Synthesis
inferred← citeshttps://doi.org/10.1002/047134608x.w1810openalex-snapshot
Power Estimation and Optimization
inferred← citeshttps://doi.org/10.1002/9781118750124.ch2openalex-snapshot
Concept of Logic Rewiring
inferred← citeshttps://doi.org/10.1002/9781118750124.ch4openalex-snapshot
Delete‐First Rewiring Techniques
inferred← citeshttps://doi.org/10.1002/ecjc.4430741201openalex-snapshot
An area‐minimum synthesis method based on topology decomposition of multistage complex MOS gates
inferred← citeshttps://doi.org/10.1002/scj.4690240703openalex-snapshot
Removal of redundancy in combinational circuits under classification of undetectable faults
inferred← citeshttps://doi.org/10.1002/scj.4690271102openalex-snapshot
Design of logic circuits with wired‐logic utilizing transduction method
inferred← citeshttps://doi.org/10.1002/scj.4690271208openalex-snapshot
Optimization methods for look‐up table‐type FPGAs based on permissible functions
inferred← citeshttps://doi.org/10.1007/3-540-56402-0_56openalex-snapshot
Analysis and manipulation of Boolean functions in terms of decision graphs
inferred← citeshttps://doi.org/10.1007/3-540-56503-5_57openalex-snapshot
Frontiers of feasible and probabilistic feasible Boolean manipulation with branching programs
inferred← citeshttps://doi.org/10.1007/3-540-57301-1_11openalex-snapshot
Data structure and algorithms for new hardware technology
inferred← citeshttps://doi.org/10.1007/3-540-60294-1_113openalex-snapshot
The CSYN verilog compiler and other tools
inferred← citeshttps://doi.org/10.1007/978-0-387-34920-6_2openalex-snapshot
Multiple-Level Logic Optimization with Boolean Relations
inferred← citeshttps://doi.org/10.1007/978-1-4615-0292-0_14openalex-snapshot
Logic Synthesis Overview
inferred← citeshttps://doi.org/10.1007/978-1-4615-0292-0_6openalex-snapshot
Verification of Large Synthesized Designs
inferred← citeshttps://doi.org/10.1007/978-1-4615-0817-5_1openalex-snapshot
Two-Level Logic Minimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-0817-5_2openalex-snapshot
Multi-Level Logic Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-0817-5_3openalex-snapshot
Flexibility in Logic
inferred← citeshttps://doi.org/10.1007/978-1-4615-3154-8_15openalex-snapshot
A New Technology Mapping Method Based on Concurrent Factorization and Mapping
inferred← citeshttps://doi.org/10.1007/978-1-4615-3154-8_3openalex-snapshot
Logic Synthesizers, The Transduction Method and Its Extension, Sylon
inferred← citeshttps://doi.org/10.1007/978-1-4615-3154-8_4openalex-snapshot
Network Optimization Using Don’t-Cares and Boolean Relations
inferred← citeshttps://doi.org/10.1007/978-1-4615-3154-8_5openalex-snapshot
Multi-Level Logic Minimization of Large Combinational Circuits by Partitioning
inferred← citeshttps://doi.org/10.1007/978-1-4615-3154-8_6openalex-snapshot
A Partitioning Method for Area Optimization by Tree Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4615-5453-0_6openalex-snapshot
Logic Minimization for Low Power
inferred← citeshttps://doi.org/10.1007/978-1-4615-5685-5_9openalex-snapshot
Combinational Circuit Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4757-2572-8_4openalex-snapshot
AND/OR Reasoning Graphs
inferred← citeshttps://doi.org/10.1007/978-3-031-28916-3_3openalex-snapshot
External Don’t Cares in Logic Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-031-83093-8_9openalex-snapshot
Netlist Optimization Using Formal Methods Under External Constraints
inferred← citeshttps://doi.org/10.1007/978-3-319-43174-1_3openalex-snapshot
Majority Logic
inferred← citeshttps://doi.org/10.1007/bf01182592openalex-snapshot
Using ordered binary decision diagrams to factorize multi-level logic
inferred← citeshttps://doi.org/10.1007/s100090100038openalex-snapshot
Zero-suppressed BDDs and their applications
inferred← citeshttps://doi.org/10.1007/s11182-014-0313-8openalex-snapshot
Providing Reliability of Physical Systems: Partially Programmable Circuit Design
inferred← citeshttps://doi.org/10.1016/0141-9331(90)90009-kopenalex-snapshot
Speed tunable finite state machine compiler: Zephcad
inferred← citeshttps://doi.org/10.1016/b978-0-444-89208-9.50016-8openalex-snapshot
Description Methods of CHDL for Redesign Methods
inferred← citeshttps://doi.org/10.1016/j.eswa.2007.04.010openalex-snapshot
Applicability of feed-forward and recurrent neural networks to Boolean function complexity modeling
inferred← citeshttps://doi.org/10.1016/j.physleta.2024.129913openalex-snapshot
Vulnerability of AND/OR logic networks under cascading failures
inferred← citeshttps://doi.org/10.1016/s0065-2458(08)60245-4openalex-snapshot
Computer-Aided Logic Synthesis for VLSI Chips
inferred← citeshttps://doi.org/10.1049/ip-cdt:20000275openalex-snapshot
Multi-level logic optimisation based on permissible perturbations
inferred← citeshttps://doi.org/10.1049/ip-cdt:20020160openalex-snapshot
Removing multiple redundancies in combinational circuits
inferred← citeshttps://doi.org/10.1049/ip-cdt:20030575openalex-snapshot
Multilevel logic simplification based on a containment recursive paradigm
inferred← citeshttps://doi.org/10.1080/00207219508926164openalex-snapshot
Synthesis of multilevel NAND gate circuits for incompletely specified multi-output Boolean functions and CAD using permissible cubes and PCRM graphs
inferred← citeshttps://doi.org/10.1093/ietfec/e88-a.4.1038openalex-snapshot
SPFD-Based Flexible Transformation of LUT-Based FPGA Circuits
inferred← citeshttps://doi.org/10.1109/4.75014openalex-snapshot
Circuit partitioning for logic synthesis
inferred← citeshttps://doi.org/10.1109/43.144847openalex-snapshot
Symbolic minimization of multilevel logic and the input encoding problem
inferred← citeshttps://doi.org/10.1109/43.215001openalex-snapshot
Don't care set specifications in combinational and synchronous logic circuits
inferred← citeshttps://doi.org/10.1109/43.238030openalex-snapshot
Redundancy identification/removal and test generation for sequential circuits using implicit state enumeration
inferred← citeshttps://doi.org/10.1109/43.277629openalex-snapshot
Identification of redundant delay faults
inferred← citeshttps://doi.org/10.1109/43.293943openalex-snapshot
Don't care sequences and the optimization of interacting finite state machines
inferred← citeshttps://doi.org/10.1109/43.370421openalex-snapshot
On correction of multiple design errors
inferred← citeshttps://doi.org/10.1109/43.391740openalex-snapshot
Combinational and sequential logic optimization by redundancy addition and removal
inferred← citeshttps://doi.org/10.1109/43.469659openalex-snapshot
Optimization of combinational logic circuits based on compatible gates
inferred← citeshttps://doi.org/10.1109/43.486269openalex-snapshot
A novel framework for logic verification in a synthesis environment
inferred← citeshttps://doi.org/10.1109/43.494701openalex-snapshot
Fast factorization method for implicit cube set representation
inferred← citeshttps://doi.org/10.1109/43.503942openalex-snapshot
Permissible functions for multioutput components in combinational logic optimization
inferred← citeshttps://doi.org/10.1109/43.511569openalex-snapshot
An approach for multilevel logic optimization targeting low power
inferred← citeshttps://doi.org/10.1109/43.552082openalex-snapshot
Perturb and simplify: multilevel Boolean network optimizer
inferred← citeshttps://doi.org/10.1109/43.594832openalex-snapshot
Logic optimization and equivalence checking by implication analysis
inferred← citeshttps://doi.org/10.1109/43.62792openalex-snapshot
Synchronous logic synthesis: algorithms for cycle-time minimization
inferred← citeshttps://doi.org/10.1109/43.62793openalex-snapshot
Retiming and resynthesis: optimizing sequential networks with combinational techniques
inferred← citeshttps://doi.org/10.1109/43.640617openalex-snapshot
Postlayout logic restructuring using alternative wires
inferred← citeshttps://doi.org/10.1109/43.662674openalex-snapshot
Symbolic timing analysis and resynthesis for low power of combinational circuits containing false paths
inferred← citeshttps://doi.org/10.1109/43.703819openalex-snapshot
Don't cares in synthesis: theoretical pitfalls and practical solutions
inferred← citeshttps://doi.org/10.1109/43.703921openalex-snapshot
LOT: Logic Optimization with Testability. New transformations for logic synthesis
inferred← citeshttps://doi.org/10.1109/43.709395openalex-snapshot
Computing observability don't cares efficiently through polarization
inferred← citeshttps://doi.org/10.1109/43.748158openalex-snapshot
Logic synthesis for engineering change
inferred← citeshttps://doi.org/10.1109/43.856972openalex-snapshot
SPFD: A new method to express functional flexibility
inferred← citeshttps://doi.org/10.1109/43.945310openalex-snapshot
Theorems and extensions of single wire replacement
inferred← citeshttps://doi.org/10.1109/5.52213openalex-snapshot
Multilevel logic synthesis
inferred← citeshttps://doi.org/10.1109/92.250199openalex-snapshot
PREST: a system for logic partitioning and resynthesis for testability
inferred← citeshttps://doi.org/10.1109/92.311641openalex-snapshot
Logic design error diagnosis and correction
inferred← citeshttps://doi.org/10.1109/92.953501openalex-snapshot
Resynthesis of combinational logic circuits for improved path delay fault testability using comparison units
inferred← citeshttps://doi.org/10.1109/access.2020.3045014openalex-snapshot
Extending Boolean Methods for Scalable Logic Synthesis
inferred← citeshttps://doi.org/10.1109/asic.1991.242900openalex-snapshot
Timing optimization of MOS combinational networks
inferred← citeshttps://doi.org/10.1109/asicon58565.2023.10396421openalex-snapshot
Logic Synthesis for Emerging Technologies
inferred← citeshttps://doi.org/10.1109/asp-dac58780.2024.10473816openalex-snapshot
Transduction Method for AIG Minimization
inferred← citeshttps://doi.org/10.1109/aspdac.1995.486238openalex-snapshot
Logic rectification and synthesis for engineering change
inferred← citeshttps://doi.org/10.1109/aspdac.1995.486245openalex-snapshot
Optimization methods for lookup-table-based FPGAs using Transduction Method
inferred← citeshttps://doi.org/10.1109/aspdac.1997.600326openalex-snapshot
AND/OR reasoning graphs for determining prime implicants in multi-level combinational networks
inferred← citeshttps://doi.org/10.1109/aspdac.2003.1195016openalex-snapshot
Logic optimization for asynchronous speed independent controllers using transduction method
inferred← citeshttps://doi.org/10.1109/aspdac.2004.1337662openalex-snapshot
Transduction method for design of logic cell structure
inferred← citeshttps://doi.org/10.1109/aspdac.2006.1594693openalex-snapshot
A transduction-based framework to synthesize RSFQ circuits
inferred← citeshttps://doi.org/10.1109/ats.1995.485361openalex-snapshot
Low power design and its testability
inferred← citeshttps://doi.org/10.1109/dac.1990.114826openalex-snapshot
Efficient implementation of a BDD package
inferred← citeshttps://doi.org/10.1109/dac.1990.114868openalex-snapshot
Boolean resubstitution with permissible functions and binary decision diagrams
inferred← citeshttps://doi.org/10.1109/dac.1990.114878openalex-snapshot
Timing optimization for multi-level combination networks
inferred← citeshttps://doi.org/10.1109/dac.1990.114954openalex-snapshot
The use of observability and external don't cares for the simplification of multi-level networks
inferred← citeshttps://doi.org/10.1109/dac.1992.227762openalex-snapshot
Efficient sum-to-one subsets algorithm for logic optimization
inferred← citeshttps://doi.org/10.1109/dac.1992.227823openalex-snapshot
Recurrence equations and the optimization of synchronous logic circuits
inferred← citeshttps://doi.org/10.1109/dac.1995.250044openalex-snapshot
Logic Synthesis for Engineering Change
inferred← citeshttps://doi.org/10.1109/dac.1995.250045openalex-snapshot
A Partitioning-based Logic Optimization Method for Large Scale Circuits with Boolean Matrix
inferred← citeshttps://doi.org/10.1109/dac.1995.250046openalex-snapshot
Multi-Level Logic Minimization based on Multi-Signal Implications
inferred← citeshttps://doi.org/10.1109/dac.1995.250047openalex-snapshot
An Efficient Algorithm for Local Don't Care Sets Calculation
inferred← citeshttps://doi.org/10.1109/dac.1995.250048openalex-snapshot
Logic Clause Analysis for Delay Optimization
inferred← citeshttps://doi.org/10.1109/dac.1995.250076openalex-snapshot
On Synthesis-for-Testability of Combinational Logic Circuits
inferred← citeshttps://doi.org/10.1109/dac.1996.545571openalex-snapshot
Tutorial: design of a logic synthesis system
inferred← citeshttps://doi.org/10.1109/dac.1996.545679openalex-snapshot
Reducing power dissipation after technology mapping by structural transformations
inferred← citeshttps://doi.org/10.1109/dac.1997.597225openalex-snapshot
Technology-dependent Transformations For Low-power Synthesis
inferred← citeshttps://doi.org/10.1109/date.1999.761112openalex-snapshot
Logic transformation for low power synthesis
inferred← citeshttps://doi.org/10.1109/date.2000.840039openalex-snapshot
Power and delay reduction via simultaneous logic and placement optimization in FPGAs
inferred← citeshttps://doi.org/10.1109/ddecs.2017.7934583openalex-snapshot
Are XORs in logic synthesis really necessary?
inferred← citeshttps://doi.org/10.1109/dsn64029.2025.00034openalex-snapshot
GREAT: Global Representation and Edge-Attention for Hardware Trojan Detection
inferred← citeshttps://doi.org/10.1109/edac.1991.206358openalex-snapshot
On variable ordering of binary decision diagrams for the application of multi-level logic synthesis
inferred← citeshttps://doi.org/10.1109/edac.1992.205928openalex-snapshot
Synthesis and optimization of synchronous logic circuits from recurrence equations
inferred← citeshttps://doi.org/10.1109/edac.1993.386445openalex-snapshot
Multi-level logic optimization based on pseudo maximum sets of permissible functions
inferred← citeshttps://doi.org/10.1109/edac.1993.386447openalex-snapshot
Multi-level logic optimization by redundancy addition and removal
inferred← citeshttps://doi.org/10.1109/edac.1993.386465openalex-snapshot
Input order for ROBDDs based on kernel analysis
inferred← citeshttps://doi.org/10.1109/edtc.1994.326812openalex-snapshot
Efficient calculation of Boolean relations for multi-level logic optimization
inferred← citeshttps://doi.org/10.1109/edtc.1994.326877openalex-snapshot
Nondeterministic finite-state machines and sequential don't cares
inferred← citeshttps://doi.org/10.1109/edtc.1994.326893openalex-snapshot
Introduction of permissible bridges with application to logic optimization after technology mapping
inferred← citeshttps://doi.org/10.1109/edtc.1996.494322openalex-snapshot
Sequential permissible functions and their application to circuit optimization
inferred← citeshttps://doi.org/10.1109/edtc.1997.582338openalex-snapshot
Random benchmark circuits with controlled attributes
inferred← citeshttps://doi.org/10.1109/edtc.1997.582441openalex-snapshot
The input pattern fault model and its application
inferred← citeshttps://doi.org/10.1109/eurdac.1992.246239openalex-snapshot
Maximal reduction of lookup-table based FPGAs
inferred← citeshttps://doi.org/10.1109/eurdac.1992.246247openalex-snapshot
Boolean matching in logic synthesis
inferred← citeshttps://doi.org/10.1109/eurdac.1993.410656openalex-snapshot
A new logic minimization method for multiplexor-based FPGA synthesis
inferred← citeshttps://doi.org/10.1109/ewdts.2014.7027067openalex-snapshot
Partially programmable circuit design
inferred← citeshttps://doi.org/10.1109/ftcs.1992.243575openalex-snapshot
Removal of redundancy in logic circuits under classification of undetectable faults
inferred← citeshttps://doi.org/10.1109/hicss.1990.205141openalex-snapshot
Logic transformations for synchronous logic synthesis
inferred← citeshttps://doi.org/10.1109/iccad.1989.76892openalex-snapshot
A powerful global router: based on Steiner min-max trees
inferred← citeshttps://doi.org/10.1109/iccad.1989.77011openalex-snapshot
SYLON-DREAM: a multi-level network synthesizer
inferred← citeshttps://doi.org/10.1109/iccad.1989.77012openalex-snapshot
Multi-level logic optimization using binary decision diagrams
inferred← citeshttps://doi.org/10.1109/iccad.1990.129824openalex-snapshot
A routing algorithm for harvesting multipipeline arrays with small intercell and pipeline delays
inferred← citeshttps://doi.org/10.1109/iccad.1990.129834openalex-snapshot
Automatic and semi-automatic verification of switch-level circuits with temporal logic and binary decision diagrams
inferred← citeshttps://doi.org/10.1109/iccad.1990.129938openalex-snapshot
Multi-level logic minimization across latch boundaries
inferred← citeshttps://doi.org/10.1109/iccad.1990.129965openalex-snapshot
Observability don't care sets and Boolean relations
inferred← citeshttps://doi.org/10.1109/iccad.1990.129966openalex-snapshot
PHIFACT-a Boolean preprocessor for multi-level logic synthesis
inferred← citeshttps://doi.org/10.1109/iccad.1990.129981openalex-snapshot
MIS-MV: optimization of multi-level logic with multiple-values inputs
inferred← citeshttps://doi.org/10.1109/iccad.1990.129982openalex-snapshot
Multi-level logic optimization for large scale ASICs
inferred← citeshttps://doi.org/10.1109/iccad.1991.185175openalex-snapshot
A cell-replicating approach to minicut-based circuit partitioning
inferred← citeshttps://doi.org/10.1109/iccad.1991.185318openalex-snapshot
Application of Boolean unification to combinational logic synthesis
inferred← citeshttps://doi.org/10.1109/iccad.1991.185320openalex-snapshot
Observability relations and observability don't cares
inferred← citeshttps://doi.org/10.1109/iccad.1993.580075openalex-snapshot
The maximum set of permissible behaviors for FSM networks
inferred← citeshttps://doi.org/10.1109/iccad.1993.580110openalex-snapshot
Verification of large synthesized designs
inferred← citeshttps://doi.org/10.1109/iccad.1993.580160openalex-snapshot
Maximum projections of don't care conditions in a Boolean network
inferred← citeshttps://doi.org/10.1109/iccad.1994.629734openalex-snapshot
Perturb And Simplify: Multi-level Boolean Network Optimizer
inferred← citeshttps://doi.org/10.1109/iccad.1994.629735openalex-snapshot
Multi-level Logic Optimization By Implication Analysis
inferred← citeshttps://doi.org/10.1109/iccad.1994.629888openalex-snapshot
A Redesign Technique For Combinational Circuits Based On Gate Recomections
inferred← citeshttps://doi.org/10.1109/iccad.1995.480135openalex-snapshot
LOT: Logic optimization with testability - new transformations using recursive learning
inferred← citeshttps://doi.org/10.1109/iccad.1995.480254openalex-snapshot
Multi-level logic optimization of FSM networks
inferred← citeshttps://doi.org/10.1109/iccad.1996.569635openalex-snapshot
A new method to express functional permissibilities for LUT based FPGAs and its applications
inferred← citeshttps://doi.org/10.1109/iccad.1996.569641openalex-snapshot
Fast Boolean optimization by rewiring
inferred← citeshttps://doi.org/10.1109/iccad.1996.571331openalex-snapshot
Polarized observability don't cares
inferred← citeshttps://doi.org/10.1109/iccad.1997.643522openalex-snapshot
Sequential optimisation without state space exploration
inferred← citeshttps://doi.org/10.1109/iccad.2001.968725openalex-snapshot
Compatible observability don't cares revisited
inferred← citeshttps://doi.org/10.1109/iccd.1989.63381openalex-snapshot
A logic network synthesis system, SYLON
inferred← citeshttps://doi.org/10.1109/iccd.1990.130157openalex-snapshot
The observability don't-care set and its approximations
inferred← citeshttps://doi.org/10.1109/iccd.1990.130227openalex-snapshot
SYLON-REDUCE: an MOS network optimization algorithms using permissible functions
inferred← citeshttps://doi.org/10.1109/iccd.1990.130228openalex-snapshot
Boolean technology mapping for both ECI and CMOS circuits based on permissible functions and binary decision diagrams
inferred← citeshttps://doi.org/10.1109/iccd.1991.139841openalex-snapshot
Concurrent resynthesis for network optimization
inferred← citeshttps://doi.org/10.1109/iccd.1991.139842openalex-snapshot
Dual global flow
inferred← citeshttps://doi.org/10.1109/iccd.1991.139849openalex-snapshot
Redundancy identification and removal based on implicit state enumeration
inferred← citeshttps://doi.org/10.1109/iccd.1993.393341openalex-snapshot
Logic optimization with multi-output gates
inferred← citeshttps://doi.org/10.1109/iccd.1994.331967openalex-snapshot
ZEPHCAD and FLORA: logic synthesis for control and datapath
inferred← citeshttps://doi.org/10.1109/iccd.1997.628897openalex-snapshot
Properties of the input pattern fault model
inferred← citeshttps://doi.org/10.1109/iccd.1998.727128openalex-snapshot
Combining technology mapping with post-placement resynthesis for performance optimization
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/icm.2007.4497737openalex-snapshot
A new method for power estimation and optimization of combinational circuits
inferred← citeshttps://doi.org/10.1109/icvd.1993.669703openalex-snapshot
A Shared Memory Parallel Algorithm for Logic Synthesis
inferred← citeshttps://doi.org/10.1109/icvd.1996.489487openalex-snapshot
LUT-based FPGA technology mapping using permissible functions
inferred← citeshttps://doi.org/10.1109/icvd.1996.489495openalex-snapshot
On finding functionally identical and functionally opposite lines in combinational logic circuits
inferred← citeshttps://doi.org/10.1109/inmic.2006.358161openalex-snapshot
Using Recurrent Neural Networks for Circuit Complexity Modeling
inferred← citeshttps://doi.org/10.1109/iscas.1990.112533openalex-snapshot
Synchronous logic synthesis: circuit specifications and optimization algorithms
inferred← citeshttps://doi.org/10.1109/iscas.1990.112552openalex-snapshot
Boolean factoring with kernels and rectangle covering
inferred← citeshttps://doi.org/10.1109/iscas.1992.230386openalex-snapshot
Optimizing large networks by repeated local optimization using a windowing scheme
inferred← citeshttps://doi.org/10.1109/iscas.1996.542103openalex-snapshot
Combinationally irredundant ISCAS-89 benchmark circuits
inferred← citeshttps://doi.org/10.1109/iscas58744.2024.10558264openalex-snapshot
An Enhanced Resubstitution Algorithm for Area-Oriented Logic Optimization
inferred← citeshttps://doi.org/10.1109/ismvl.2000.848628openalex-snapshot
Evolutionary multi-level network synthesis in given design style
inferred← citeshttps://doi.org/10.1109/ismvl.2001.924573openalex-snapshot
Information theory method for flexible network synthesis
inferred← citeshttps://doi.org/10.1109/ismvl68998.2026.00045openalex-snapshot
Observability Don’t Cares in Algebraic Geometry
inferred← citeshttps://doi.org/10.1109/jproc.2018.2869760openalex-snapshot
Logic Synthesis for Established and Emerging Computing
inferred← citeshttps://doi.org/10.1109/lpe.1996.547527openalex-snapshot
Gate-level synthesis for low-power using new transformations
inferred← citeshttps://doi.org/10.1109/mwscas.1992.271293openalex-snapshot
A pipelined VLSI arithmetic architecture
inferred← citeshttps://doi.org/10.1109/tc.2023.3280134openalex-snapshot
Node-Wise Hardware Trojan Detection Based on Graph Learning
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/tcad.2025.3525617openalex-snapshot
Area-Oriented Resubstitution For Networks of Look-Up Tables
inferred← citeshttps://doi.org/10.1109/test.1992.527896openalex-snapshot
ACCORD : Automatic Catching and Correction of Logic Design Errors in Combinational Circuits
inferred← citeshttps://doi.org/10.1109/trustcom63139.2024.00217openalex-snapshot
Robust Hardware Trojan Detection: Conventional Machine Learning vs. Graph Learning Approaches
inferred← citeshttps://doi.org/10.1145/1118299.1118368openalex-snapshot
A transduction-based framework to synthesize RSFQ circuits
inferred← citeshttps://doi.org/10.1145/1119772.1119811openalex-snapshot
Logic optimization for asynchronous speed independent controllers using transduction method
inferred← citeshttps://doi.org/10.1145/123186.105253openalex-snapshot
Timing optimization for multi-level combinational networks
inferred← citeshttps://doi.org/10.1145/123186.123222openalex-snapshot
Efficient implementation of a BDD package
inferred← citeshttps://doi.org/10.1145/123186.123276openalex-snapshot
Boolean resubstitution with permissible functions and binary decision diagrams
inferred← citeshttps://doi.org/10.1145/123186.123280openalex-snapshot
The use of observability and external don't cares for the simplification of multi-level networks
inferred← citeshttps://doi.org/10.1145/127601.127712openalex-snapshot
A resynthesis approach for network optimization
inferred← citeshttps://doi.org/10.1145/127601.127713openalex-snapshot
Logic optimization of MOS networks
inferred← citeshttps://doi.org/10.1145/127601.127729openalex-snapshot
Incremental techniques for the identification of statically sensitizable critical paths
inferred← citeshttps://doi.org/10.1145/1508128.1508152openalex-snapshot
Scalable don't-care-based logic optimization and resynthesis
inferred← citeshttps://doi.org/10.1145/157485.165073openalex-snapshot
Optimization of combinational logic circuits based on compatible gates
inferred← citeshttps://doi.org/10.1145/1754405.1754411openalex-snapshot
Logic synthesis and circuit customization using extensive external don't-cares
inferred← citeshttps://doi.org/10.1145/196244.196452openalex-snapshot
Random generation of test instances for logic optimizers
inferred← citeshttps://doi.org/10.1145/1973009.1973095openalex-snapshot
Integrated logic synthesis using simulated annealing
inferred← citeshttps://doi.org/10.1145/2068716.2068720openalex-snapshot
Scalable don't-care-based logic optimization and resynthesis
inferred← citeshttps://doi.org/10.1145/217474.217518openalex-snapshot
On synthesis-for-testability of combinational logic circuits
inferred← citeshttps://doi.org/10.1145/217474.217604openalex-snapshot
Logic synthesis for engineering change
inferred← citeshttps://doi.org/10.1145/224818.224913openalex-snapshot
Logic rectification and synthesis for engineering change
inferred← citeshttps://doi.org/10.1145/224818.224921openalex-snapshot
Optimization methods for lookup-table-based FPGAs using transduction method
inferred← citeshttps://doi.org/10.1145/233539.233540openalex-snapshot
Combinational logic synthesis for LUT based field programmable gate arrays
inferred← citeshttps://doi.org/10.1145/2348839.2348854openalex-snapshot
ECR
inferred← citeshttps://doi.org/10.1145/240518.240554openalex-snapshot
Design of a logic synthesis system (tutorial)
showing the first 200 of 241 · page through all 241
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.