On the public citation graph
Is redundancy necessary to reduce delay?
0 signed · 71 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-1-4615-0292-0_23openalex-snapshot
TILOS: A Posynomial Programming Approach to Transistor Sizing
inferredcites →https://doi.org/10.1007/978-3-642-95432-0_6openalex-snapshot
TV: An nMOS Timing Analyzer
inferredcites →https://doi.org/10.1109/12.5996openalex-snapshot
Timing analysis using functional analysis
inferredcites →https://doi.org/10.1109/43.3211openalex-snapshot
Multi-level logic minimization using implicit don't cares
inferredcites →https://doi.org/10.1109/ftcs.1988.5293openalex-snapshot
Advanced automatic test pattern generation and redundancy identification techniques
inferredcites →https://doi.org/10.1109/iccad.1988.122511openalex-snapshot
Timing optimization of combinational logic
inferredcites →https://doi.org/10.1109/iccad.1989.76982openalex-snapshot
Synthesis of delay fault testable combinational logic
inferredcites →https://doi.org/10.1109/iccad.1989.76983openalex-snapshot
On properties of algebraic transformation and the multifault testability of multilevel logic
inferredcites →https://doi.org/10.1109/tc.1983.1676139openalex-snapshot
Redundancy and Don't Cares in Logic Synthesis
inferredcites →https://doi.org/10.1109/tcad.1985.1270130openalex-snapshot
A Switch-Level Timing Verifier for Digital MOS VLSI
inferredcites →https://doi.org/10.1109/tcad.1987.1270347openalex-snapshot
MIS: A Multiple-Level Logic Optimization System
inferredcites →https://doi.org/10.1109/tec.1961.5219274openalex-snapshot
Skip Techniques for High-Speed Carry-Propagation in Binary Arithmetic Units
inferredcites →https://doi.org/10.1145/74382.74475openalex-snapshot
On the general false path problem in timing analysis
inferredcites →https://doi.org/10.1145/74382.74476openalex-snapshot
Efficient algorithms for computing the longest viable path in a combinational network
inferredcites →https://doi.org/10.1145/74382.74477openalex-snapshot
Static timing analysis of dynamically sensitizable paths
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_14openalex-snapshot
Logic Synthesis Overview
inferred← citeshttps://doi.org/10.1007/978-1-4615-3506-5_2openalex-snapshot
Optimizing Logic for Speed, Size, and Testability
inferred← citeshttps://doi.org/10.1007/bf00971960openalex-snapshot
Self-checking combinational circuit design for single and unidirectional multibit error
inferred← citeshttps://doi.org/10.1016/0045-7906(95)00010-ropenalex-snapshot
A detailed analysis of combinational multiple-line redundant circuits
inferred← citeshttps://doi.org/10.1016/0167-9260(93)90002-topenalex-snapshot
Path-delay-fault testability properties of multiplexor-based networks
inferred← citeshttps://doi.org/10.1023/a:1008316631868openalex-snapshot
False-Path Removal Using Delay Fault Simulation
inferred← citeshttps://doi.org/10.1109/12.869333openalex-snapshot
Isomorph-redundancy in sequential circuits
inferred← citeshttps://doi.org/10.1109/43.293944openalex-snapshot
Circuit structure relations to redundancy and delay
inferred← citeshttps://doi.org/10.1109/43.363125openalex-snapshot
Delay fault coverage, test set size, and performance trade-offs
inferred← citeshttps://doi.org/10.1109/43.406708openalex-snapshot
Exploiting multicycle false paths in the performance optimization of sequential logic circuits
inferred← citeshttps://doi.org/10.1109/43.552080openalex-snapshot
Algorithms for approximate FSM traversal based on state space decomposition
inferred← citeshttps://doi.org/10.1109/92.238423openalex-snapshot
Statistical timing analysis of combinational logic circuits
inferred← citeshttps://doi.org/10.1109/ats.1995.485356openalex-snapshot
A graph coloring based approach for self-checking logic circuit design
inferred← citeshttps://doi.org/10.1109/ccece.1994.405831openalex-snapshot
On the relationship between fault-masking and multiple-line redundancies in combinational circuits
inferred← citeshttps://doi.org/10.1109/cicc.2001.929767openalex-snapshot
Effect of RTL coding style on testability
inferred← citeshttps://doi.org/10.1109/dac.1992.227828openalex-snapshot
Circuit structure relations to redundancy and delay: the KMS algorithm revisited
inferred← citeshttps://doi.org/10.1109/dac.1995.250048openalex-snapshot
Logic Clause Analysis for Delay Optimization
inferred← citeshttps://doi.org/10.1109/date.1998.655991openalex-snapshot
Path verification using Boolean satisfiability
inferred← citeshttps://doi.org/10.1109/edac.1993.386424openalex-snapshot
Functional timing analysis using ATPG
inferred← citeshttps://doi.org/10.1109/edtc.1994.326813openalex-snapshot
Timing analysis of combinational circuits using ADDs
inferred← citeshttps://doi.org/10.1109/edtc.1994.326894openalex-snapshot
Delay reduction by segment substitution
inferred← citeshttps://doi.org/10.1109/edtc.1997.582337openalex-snapshot
Fast controllers for data dominated applications
inferred← citeshttps://doi.org/10.1109/eurdac.1992.246253openalex-snapshot
The exact solution of timing verification
inferred← citeshttps://doi.org/10.1109/fpl.2006.311225openalex-snapshot
Multi-Bit Carry Chains for High-Performance Reconfigurable Fabrics
inferred← citeshttps://doi.org/10.1109/glsv.1992.218372openalex-snapshot
On the use of hierarchy in timing verification with statically sensitizable paths
inferred← citeshttps://doi.org/10.1109/iccad.1992.279319openalex-snapshot
Exploiting multi-cycle false paths in the performance optimization of sequential circuits
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.2011.6105401openalex-snapshot
MACACO: Modeling and analysis of circuits for approximate computing
inferred← citeshttps://doi.org/10.1109/iccd.1991.139937openalex-snapshot
Logic synthesis of 100-percent testable logic networks
inferred← citeshttps://doi.org/10.1109/iccd.1992.276210openalex-snapshot
Statistical timing analysis of combinational circuits
inferred← citeshttps://doi.org/10.1109/iccd.1993.393403openalex-snapshot
An analysis of path sensitization criteria
inferred← citeshttps://doi.org/10.1109/icvd.1995.512084openalex-snapshot
Functional clock schedule optimization
inferred← citeshttps://doi.org/10.1109/iscas.1991.176795openalex-snapshot
Analysis and design of regular structures for robust dynamic fault testability
inferred← citeshttps://doi.org/10.1109/melcon.1994.381039openalex-snapshot
The influence of cell library characteristics on power consumption of CMOS circuits
inferred← citeshttps://doi.org/10.1109/melcon.1994.381090openalex-snapshot
FPGA synthesis using Look-Up Table and Multiplexor Based architectures
inferred← citeshttps://doi.org/10.1109/mwscas.1993.343338openalex-snapshot
A detailed analysis of combinational, multiple-line redundant circuits
inferred← citeshttps://doi.org/10.1109/sbcci.2000.876002openalex-snapshot
Testability properties of vertex precedent BDDs
inferred← citeshttps://doi.org/10.1109/sbcci.2002.1137641openalex-snapshot
Testability properties of BDDs
inferred← citeshttps://doi.org/10.1109/ssst.1995.390556openalex-snapshot
Weighted-output based approach for self-checking combinational logic design
inferred← citeshttps://doi.org/10.1109/vlsi.2008.22openalex-snapshot
Design-for-Testability for Improved Path Delay Fault Coverage of Critical Paths
inferred← citeshttps://doi.org/10.1109/vtest.1993.313309openalex-snapshot
Input and output encoding techniques for on-line error detection in combinational logic circuits
inferred← citeshttps://doi.org/10.1109/vtest.1996.510894openalex-snapshot
Isomorph-redundancy in sequential circuits
inferred← citeshttps://doi.org/10.1109/vtest.1997.600295openalex-snapshot
Testability of sequential circuits with multi-cycle false paths
inferred← citeshttps://doi.org/10.1145/1057661.1057735openalex-snapshot
A new approach to the use of satisfiability in false path detection
inferred← citeshttps://doi.org/10.1145/1255456.1255473openalex-snapshot
Event propagation for accurate circuit delay calculation using SAT
inferred← citeshttps://doi.org/10.1145/1629911.1630015openalex-snapshot
Timing-driven optimization using lookahead logic circuits
inferred← citeshttps://doi.org/10.1145/337292.337417openalex-snapshot
Removing user specified false paths from timing graphs
inferred← citeshttps://doi.org/10.1155/1994/29238openalex-snapshot
Techniques for Self‐Checking Combinational LogicSynthesis
inferred← citeshttps://doi.org/10.5555/113938.149425openalex-snapshot
Circuit structure relations to redundancy and delay: the KMS algorithm revisited
inferred← citeshttps://doi.org/10.5555/159754.161742openalex-snapshot
The exact solution of timing verification
inferred← citeshttps://doi.org/10.5555/304032.304041openalex-snapshot
Configuring multiple scan chains for minimum test time
inferred← citeshttps://doi.org/10.5555/304032.304161openalex-snapshot
Exploiting multi-cycle false paths in the performance optimization of sequential circuits
inferred← citeshttps://doi.org/10.5555/339492.339554openalex-snapshot
Marsh: min-area retiming with setup and hold constraints
inferred← citeshttps://doi.org/10.5555/787260.787641openalex-snapshot
Fast controllers for data dominated applications
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.