On the public citation graph

A timing analysis algorithm for circuits with level-sensitive latches

0 signed · 24 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.1109/dac.1992.227771openalex-snapshot
Computing optimal clock schedules
inferredcites →https://doi.org/10.1109/dac.1992.227772openalex-snapshot
Analyzing cycle stealing on synchronous circuits with level-sensitive latches
inferredcites →https://doi.org/10.1109/iccad.1990.129979openalex-snapshot
CheckT/sub c/ and minT/sub c/: timing verification and optimal clocking of synchronous digital circuits
inferredcites →https://doi.org/10.1109/iccad.1992.279386openalex-snapshot
Identification of critical paths in circuits with level-sensitive latches
inferredcites →https://doi.org/10.1109/iccad.1992.279387openalex-snapshot
Verifying clock schedules
inferredcites →https://doi.org/10.1109/iccad.1992.279401openalex-snapshot
Graph algorithms for clock schedule optimization
inferredcites →https://doi.org/10.1137/1.9781611970265openalex-snapshot
Data Structures and Network Algorithms
inferredcites →https://doi.org/10.1137/1.9781611970265.ch7openalex-snapshot
7. Shortest Paths
inferredcites →https://doi.org/10.1142/9789811241086_0002openalex-snapshot
Data Structure and Algorithms
inferredcites →https://doi.org/10.1145/800263.809264openalex-snapshot
Timing Verification and the Timing Analysis program
inferredcites →https://doi.org/10.5555/113938.149504openalex-snapshot
Analyzing cycle stealing on synchronous circuits with level-sensitive latches
inferredcites →https://doi.org/10.5555/113938.149547openalex-snapshot
Computing optimal clock schedules
inferredcites →https://doi.org/10.5555/304032.304073openalex-snapshot
Graph algorithms for clock schedule optimization

What points at this work

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

inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00339-0openalex-snapshot
Maximum mean weight cycle in a digraph and minimizing cycle time of a logic chip
inferred← citeshttps://doi.org/10.1109/aspdac.2005.1466512openalex-snapshot
Integrated algorithmic logical and physical design of integer multiplier
inferred← citeshttps://doi.org/10.1109/aspdac.2006.1594807openalex-snapshot
Convergence-provable statistical timing analysis with level-sensitive latches and feedback loops
inferred← citeshttps://doi.org/10.1109/icecs.2004.1399753openalex-snapshot
Advanced timing of level-sensitive sequential circuits
inferred← citeshttps://doi.org/10.1109/tvlsi.2003.820525openalex-snapshot
Linearization of the timing analysis and optimization of level-sensitive digital synchronous circuits
inferred← citeshttps://doi.org/10.1145/1055137.1055149openalex-snapshot
Delay insertion method in clock skew scheduling
inferred← citeshttps://doi.org/10.1145/1118299.1118511openalex-snapshot
Convergence-provable statistical timing analysis with level-sensitive latches and feedback loops
inferred← citeshttps://doi.org/10.1145/1120725.1120780openalex-snapshot
Integrated algorithmic logical and physical design of integer multiplier
inferred← citeshttps://doi.org/10.1145/1403375.1403653openalex-snapshot
Latch modeling for statistical timing analysis
inferred← citeshttps://doi.org/10.1145/1508128.1508160openalex-snapshot
Intel® atom™ processor core made FPGA-synthesizable
inferred← citeshttps://doi.org/10.1145/589411.589437openalex-snapshot
Performance optimization of single-phase level-sensitive circuits using time borrowing and non-zero clock skew
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.