On the public citation graph

Circuit partitioning for logic synthesis

0 signed · 49 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-4613-2821-6openalex-snapshot
Logic Minimization Algorithms for VLSI Synthesis
inferredcites →https://doi.org/10.1007/978-1-4615-0292-0_17openalex-snapshot
Improved Logic Optimization Using Global-Flow Analysis
inferredcites →https://doi.org/10.1016/0167-9260(89)90059-xopenalex-snapshot
A new model for computation of probabilistic testability in combinational circuits
inferredcites →https://doi.org/10.1109/12.35836openalex-snapshot
The transduction method-design of logic networks based on permissible functions
inferredcites →https://doi.org/10.1109/12.53597openalex-snapshot
Computational complexity of controllability/observability problems for combinational circuits
inferredcites →https://doi.org/10.1109/4.18601openalex-snapshot
Boolean decomposition in multilevel logic optimization
inferredcites →https://doi.org/10.1109/41.19078openalex-snapshot
Automated synthesis for testability
inferredcites →https://doi.org/10.1109/43.3211openalex-snapshot
Multi-level logic minimization using implicit don't cares
inferredcites →https://doi.org/10.1109/cicc.1990.124829openalex-snapshot
Circuit partitioning and resynthesis
inferredcites →https://doi.org/10.1109/ftcs.1988.5309openalex-snapshot
A reconvergent fanout analysis for efficient exact fault simulation of combinational circuits
inferredcites →https://doi.org/10.1109/hicss.1989.47144openalex-snapshot
BOLD: The Boulder Optimal Logic Design system
inferredcites →https://doi.org/10.1109/iccad.1988.122452openalex-snapshot
BEATNP: a tool for partitioning Boolean networks
inferredcites →https://doi.org/10.1109/iccad.1988.122471openalex-snapshot
Don't cares and global flow analysis of Boolean networks
inferredcites →https://doi.org/10.1109/iccad.1988.122472openalex-snapshot
Improved logic optimization using global flow analysis
inferredcites →https://doi.org/10.1109/iccd.1988.25701openalex-snapshot
McMAP: a fast technology mapping procedure for multi-level logic synthesis
inferredcites →https://doi.org/10.1109/iscas.1989.100747openalex-snapshot
Combinational profiles of sequential benchmark circuits
inferredcites →https://doi.org/10.1109/t-c.1971.223081openalex-snapshot
Synthesis of Networks with a Minimum Number of Negative Gates
inferredcites →https://doi.org/10.1109/tc.1983.1676139openalex-snapshot
Redundancy and Don't Cares in Logic Synthesis
inferredcites →https://doi.org/10.1109/tc.1983.1676174openalex-snapshot
On the Acceleration of Test Generation Algorithms
inferredcites →https://doi.org/10.1109/tc.1986.1676664openalex-snapshot
Global Flow Analysis in Automatic Logic Design
inferredcites →https://doi.org/10.1109/tcad.1987.1270347openalex-snapshot
MIS: A Multiple-Level Logic Optimization System
inferredcites →https://doi.org/10.1137/0203006openalex-snapshot
Finding Dominators in Directed Graphs
inferredcites →https://doi.org/10.1145/123186.123416openalex-snapshot
Corolla based circuit partitioning and resynthesis
inferredcites →https://doi.org/10.1145/37888.37963openalex-snapshot
A topological search algorithm for ATPG
inferredcites →https://doi.org/10.1145/74382.74429openalex-snapshot
Multi-level logic simplification using don't cares and filters
inferredcites →https://doi.org/10.1147/rd.254.0272openalex-snapshot
Logic Synthesis Through Local Transformations
inferredcites →https://doi.org/10.21236/ada606736openalex-snapshot
Multiple-Valued Logic Minimization for PLA Synthesis

What points at this work

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

inferred← citeshttps://doi.org/10.1016/0167-9260(94)90005-1openalex-snapshot
A backtracing-oriented procedure for the analysis of combinational gate-level designs
inferred← citeshttps://doi.org/10.1016/s0167-9260(97)00002-3openalex-snapshot
Retiming: Theory and practice
inferred← citeshttps://doi.org/10.1109/12.238481openalex-snapshot
Generalized Hopfield neural network for concurrent testing
inferred← citeshttps://doi.org/10.1109/12.238487openalex-snapshot
Test-pattern generation based on Reed-Muller coefficients
inferred← citeshttps://doi.org/10.1109/43.108618openalex-snapshot
A framework and method for hierarchical test generation
inferred← citeshttps://doi.org/10.1109/43.365130openalex-snapshot
A row-based cell placement method that utilizes circuit structural properties
inferred← citeshttps://doi.org/10.1109/43.752930openalex-snapshot
A timing-driven soft-macro placement and resynthesis method in interaction with chip floorplanning
inferred← citeshttps://doi.org/10.1109/92.238444openalex-snapshot
Transformations and resynthesis for testability of RT-level control-data path specifications
inferred← citeshttps://doi.org/10.1109/asap71856.2026.00013openalex-snapshot
PARAYOSYS: Tail-Aware Partition-Based Parallel RTL Synthesis
inferred← citeshttps://doi.org/10.1109/edac.1993.386482openalex-snapshot
RT-level transformations for gate-level testability
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/iccad.1992.279320openalex-snapshot
Performance optimization of sequential circuits by eliminating retiming bottlenecks
inferred← citeshttps://doi.org/10.1109/iccad.1995.480197openalex-snapshot
PROP: a recursive paradigm for area-efficient and performance oriented partitioning of large FPGA netlists
inferred← citeshttps://doi.org/10.1109/iccd.1991.139848openalex-snapshot
Partitioning sequential circuits for logic optimization
inferred← citeshttps://doi.org/10.1109/ssst.1992.712208openalex-snapshot
Bridging Behavioral and Register-Transfer Synthesis
inferred← citeshttps://doi.org/10.1109/ssst.1992.712210openalex-snapshot
OASIS/sup R/ Application to Re-Synthesis of FPGA Designs as Standard Cell ASICs
inferred← citeshttps://doi.org/10.1145/267665.267709openalex-snapshot
Preserving HDL synthesis hierarchy for cell placement
inferred← citeshttps://doi.org/10.1145/274535.274537openalex-snapshot
Performance-driven soft-macro clustering and placement by preserving HDL design hierarchy
inferred← citeshttps://doi.org/10.5555/198174.198261openalex-snapshot
A unified cost model for min-cut partitioning with replication applied to optimization of large heterogeneous FPGA partitions
inferred← citeshttps://doi.org/10.5555/224841.225132openalex-snapshot
PROP: a recursive paradigm for area-efficient and performance oriented partitioning of large FPGA netlists
inferred← citeshttps://doi.org/10.5555/304032.304041openalex-snapshot
Configuring multiple scan chains for minimum test time
inferred← citeshttps://doi.org/10.5555/304032.304160openalex-snapshot
Performance optimization of sequential circuits by eliminating retiming bottlenecks
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.