On the public citation graph
Timing analysis using functional analysis
0 signed · 89 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.1007/978-3-642-95424-5openalex-snapshot
Diagnosis & Reliable Design of Digital Systems
inferredcites →https://doi.org/10.1109/12.5996openalex-snapshot
Timing analysis using functional analysis
inferredcites →https://doi.org/10.1109/tc.1983.1676139openalex-snapshot
Redundancy and Don't Cares in Logic Synthesis
inferredcites →https://doi.org/10.1147/rd.261.0100openalex-snapshot
Timing Analysis of Computer Hardware
inferredcites →https://doi.org/10.1147/rd.285.0537openalex-snapshot
LSS: A system for production logic synthesis
inferredcites →https://doi.org/10.1147/rd.441.0157openalex-snapshot
LSS: A system for production logic synthesis
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-4615-0292-0_43openalex-snapshot
Timing, Test and Manufacturing Overview
inferred← citeshttps://doi.org/10.1007/978-1-4615-0292-0_45openalex-snapshot
Timing Analysis using Functional Relationships
inferred← citeshttps://doi.org/10.1007/978-1-4615-3154-8_8openalex-snapshot
Delay Models and Exact Timing Analysis
inferred← citeshttps://doi.org/10.1007/978-981-10-8240-5_17openalex-snapshot
Statistical Viability Analysis and Optimization Through Gate Sizing
inferred← citeshttps://doi.org/10.1049/ip-cdt:19982018openalex-snapshot
Sensitisable-path-oriented clustered voltage scaling technique for low power
inferred← citeshttps://doi.org/10.1049/ip-cdt:20020201openalex-snapshot
Logic simulation methods for longest path delay estimation
inferred← citeshttps://doi.org/10.1109/12.795120openalex-snapshot
Automatic synthesis of large telescopic units based on near-minimum timed supersetting
inferred← citeshttps://doi.org/10.1109/4.84939openalex-snapshot
The use of RTL descriptions in accurate timing verification and test generation (VLSI)
inferred← citeshttps://doi.org/10.1109/43.144857openalex-snapshot
An efficient delay test generation system for combinational logic circuits
inferred← citeshttps://doi.org/10.1109/43.205001openalex-snapshot
Path sensitization in critical path problem (logic circuit design)
inferred← citeshttps://doi.org/10.1109/43.251155openalex-snapshot
Computation of floating mode delay in combinational circuits: theory and algorithms
inferred← citeshttps://doi.org/10.1109/43.251156openalex-snapshot
Computation of floating mode delay in combinational circuits: practice and implementation
inferred← citeshttps://doi.org/10.1109/43.265674openalex-snapshot
Timed Boolean calculus and its applications in timing analysis
inferred← citeshttps://doi.org/10.1109/43.277629openalex-snapshot
Identification of redundant delay faults
inferred← citeshttps://doi.org/10.1109/43.285254openalex-snapshot
Event suppression: improving the efficiency of timing simulation for synchronous digital circuits
inferred← citeshttps://doi.org/10.1109/43.293942openalex-snapshot
The role of long and short paths in circuit performance optimization
inferred← citeshttps://doi.org/10.1109/43.293948openalex-snapshot
An efficient parallel critical path algorithm
inferred← citeshttps://doi.org/10.1109/43.298037openalex-snapshot
The calculation of signal stable ranges in combinational circuits
inferred← citeshttps://doi.org/10.1109/43.46805openalex-snapshot
On computing the sizes of detected delay faults
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.703835openalex-snapshot
Efficient timing analysis for CMOS circuits considering data dependent delays
inferred← citeshttps://doi.org/10.1109/43.703945openalex-snapshot
Performance optimization by gate sizing and path sensitization
inferred← citeshttps://doi.org/10.1109/43.75626openalex-snapshot
Is redundancy necessary to reduce delay?
inferred← citeshttps://doi.org/10.1109/92.311642openalex-snapshot
Certified timing verification and the transition delay of a logic circuit
inferred← citeshttps://doi.org/10.1109/92.532035openalex-snapshot
Efficient logic-level timing analysis using constraint-guided critical path search
inferred← citeshttps://doi.org/10.1109/aspdac.1995.486202openalex-snapshot
Synthesis of false loop free circuits
inferred← citeshttps://doi.org/10.1109/dac.1990.114841openalex-snapshot
Timing analysis in precharge/unate networks
inferred← citeshttps://doi.org/10.1109/dac.1990.114859openalex-snapshot
Is redundancy necessary to reduce delay?
inferred← citeshttps://doi.org/10.1109/dac.1992.227745openalex-snapshot
The role of long and short paths in circuit performance optimization
inferred← citeshttps://doi.org/10.1109/date.1998.655949openalex-snapshot
Propagation of last-transition-time constraints in gate-level timing analysis
inferred← citeshttps://doi.org/10.1109/edac.1990.136703openalex-snapshot
SLOCOP-II: a versatile timing verification system for MOSVLSI
inferred← citeshttps://doi.org/10.1109/edac.1991.206405openalex-snapshot
A hierarchical approach to timing verification in CMOS VLSI design
inferred← citeshttps://doi.org/10.1109/edac.1992.205960openalex-snapshot
Timing verification: a new understanding of false paths
inferred← citeshttps://doi.org/10.1109/edtc.1994.326855openalex-snapshot
Towards incorporating device parameter variations in timing analysis
inferred← citeshttps://doi.org/10.1109/esscirc.1989.5468072openalex-snapshot
SLOCOP-II: Improved accuracy and efficiency in Timing Verification, based on logic functionality and MOS circuit hierarchy
inferred← citeshttps://doi.org/10.1109/eurdac.1992.246253openalex-snapshot
The exact solution of timing verification
inferred← citeshttps://doi.org/10.1109/glsv.1994.289965openalex-snapshot
Area, performance, and sensitizable paths [logic design]
inferred← citeshttps://doi.org/10.1109/glsv.1998.665289openalex-snapshot
Timed supersetting and the synthesis of large telescopic units
inferred← citeshttps://doi.org/10.1109/iccad.1991.185225openalex-snapshot
Timing analysis and delay-fault test generation using path-recursive functions
inferred← citeshttps://doi.org/10.1109/iccad.1991.185233openalex-snapshot
Path sensitization in critical path problem
inferred← citeshttps://doi.org/10.1109/iccad.1991.185262openalex-snapshot
The calculation of signal stable ranges in combinational circuits
inferred← citeshttps://doi.org/10.1109/iccad.1992.279349openalex-snapshot
False loops through resource sharing (logic CAD)
inferred← citeshttps://doi.org/10.1109/iccad.1999.810709openalex-snapshot
Timing-safe false path removal for combinational modules
inferred← citeshttps://doi.org/10.1109/iccad.2007.4397292openalex-snapshot
Timing constraint-driven technology mapping for FPGAs considering false paths and multi-clock domains
inferred← citeshttps://doi.org/10.1109/iccd.1991.139991openalex-snapshot
Indentification of viable paths using binary decision diagrams
inferred← citeshttps://doi.org/10.1109/iccd.1993.393402openalex-snapshot
A path sensitization approach to area reduction
inferred← citeshttps://doi.org/10.1109/iccd.1993.393403openalex-snapshot
An analysis of path sensitization criteria
inferred← citeshttps://doi.org/10.1109/iccd.1994.331878openalex-snapshot
Efficient timing analysis for CMOS circuit considering data dependent delays
inferred← citeshttps://doi.org/10.1109/iccd.1998.727082openalex-snapshot
Timing analysis of combinational circuits containing complex gates
inferred← citeshttps://doi.org/10.1109/icces.2006.320416openalex-snapshot
Global False Coupling Interaction-Aware Hierarchical Timing Analysis
inferred← citeshttps://doi.org/10.1109/icedsa.2010.5503092openalex-snapshot
Timing analysis of combinational circuits using Weights Binary Decision Diagram (WBDD)
inferred← citeshttps://doi.org/10.1109/icedsa.2010.5503095openalex-snapshot
Design of auto control interface circuit for thick film heater gas sensor
inferred← citeshttps://doi.org/10.1109/icvd.2001.902655openalex-snapshot
Timing verification and delay test generation for hierarchical designs
inferred← citeshttps://doi.org/10.1109/iecon.2004.1431885openalex-snapshot
Global false path-aware hierarchical timing analysis
inferred← citeshttps://doi.org/10.1109/iscas.1991.176862openalex-snapshot
Fast timing analysis of VLSI circuits: a dynamic and hierarchical approach
inferred← citeshttps://doi.org/10.1109/iscas.1996.542001openalex-snapshot
A new gate selection method for resizing to circuit performance optimization
inferred← citeshttps://doi.org/10.1109/iscas.2001.922103openalex-snapshot
An optimization-based low-power voltage scaling technique using multiple supply voltages
inferred← citeshttps://doi.org/10.1109/isqed.2000.838903openalex-snapshot
Quality of EDA CAD tools: definitions, metrics and directions
inferred← citeshttps://doi.org/10.1109/tcad.2012.2202392openalex-snapshot
Variation-Aware False Path Analysis Based on Statistical Dynamic Timing Analysis
inferred← citeshttps://doi.org/10.1109/tcad.2012.2211102openalex-snapshot
Statistical Viability Analysis for Detecting False Paths Under Delay Variation
inferred← citeshttps://doi.org/10.1109/test.1991.519749openalex-snapshot
Test Application Timing: The Unexplored Issue in AC Test
inferred← citeshttps://doi.org/10.1142/s0218126602000513openalex-snapshot
AN OPTIMIZATION-BASED MULTIPLE-VOLTAGE SCALING TECHNIQUE FOR LOW-POWER CMOS DIGITAL DESIGN
inferred← citeshttps://doi.org/10.1145/123186.123239openalex-snapshot
Timing analysis in precharge/unate networks
inferred← citeshttps://doi.org/10.1145/123186.128295openalex-snapshot
Is redundancy necessary to reduce delay
inferred← citeshttps://doi.org/10.1145/127601.127728openalex-snapshot
An efficient parallel critical path algorithm
inferred← citeshttps://doi.org/10.1145/224818.224840openalex-snapshot
Synthesis of false loop free circuits
inferred← citeshttps://doi.org/10.1145/513918.514061openalex-snapshot
False-path-aware statistical timing analysis and efficient path selection for delay testing and timing validation
inferred← citeshttps://doi.org/10.1147/rd.404.0407openalex-snapshot
BooleDozer: Logic synthesis for ASICs
inferred← citeshttps://doi.org/10.1155/1996/61747openalex-snapshot
Improving Path Sensitizability ofCombinational Circuits
inferred← citeshttps://doi.org/10.5555/113938.149627openalex-snapshot
The role of long and short paths in circuit performance optimization
inferred← citeshttps://doi.org/10.5555/1326073.1326149openalex-snapshot
Timing constraint-driven technology mapping for FPGAs considering false paths and multi-clock domains
inferred← citeshttps://doi.org/10.5555/159754.161742openalex-snapshot
The exact solution of timing verification
inferred← citeshttps://doi.org/10.5555/198174.198287openalex-snapshot
Gate-level timing verification using waveform narrowing
inferred← citeshttps://doi.org/10.5555/198174.198289openalex-snapshot
Exact path sensitization in timing analysis
inferred← citeshttps://doi.org/10.5555/304032.304131openalex-snapshot
False loops through resource sharing
inferred← citeshttps://doi.org/10.5555/339492.339554openalex-snapshot
Marsh: min-area retiming with setup and hold constraints
inferred← citeshttps://doi.org/10.5555/368058.368418openalex-snapshot
Propagation of last-transition-time constraints in gate-level timing analysis
inferred← citeshttps://doi.org/10.5555/949970.950087openalex-snapshot
SLOCOP-II: a versatile timing verification system for MOSVLSI
inferred← citeshttps://doi.org/10.5555/951513.951571openalex-snapshot
A hierarchical approach to timing verification in CMOS VLSI design
showing the first 82 of 83 · page through all 83
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.