On the public citation graph

On the complexity of computing tests for CMOS gates

0 signed · 14 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.1002/j.1538-7305.1978.tb02106.xopenalex-snapshot
Fault Modeling and Logic Simulation of CMOS and MOS Integrated Circuits
inferredcites →https://doi.org/10.1007/3-540-16078-7_83openalex-snapshot
Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report)
inferredcites →https://doi.org/10.1109/ftcs.1988.5298openalex-snapshot
Computational complexity of controllability/observability problems for combinational circuits
inferredcites →https://doi.org/10.1109/tc.1982.1676041openalex-snapshot
The Complexity of Fault Detection Problems for Combinational Logic Circuits

What points at this work

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

inferred← citeshttps://doi.org/10.1007/bf02960763openalex-snapshot
BIST design for detecting multiple stuck-open faults in CMOS circuits using transition count
inferred← citeshttps://doi.org/10.1049/ip-cdt:20040031openalex-snapshot
Testing of stuck-open faults in generalised Reed–Muller and EXOR sum-of-products CMOS circuits
inferred← citeshttps://doi.org/10.1080/0020721031000147318openalex-snapshot
Universal and robust testing of stuck-open faults in Reed–Muller canonical CMOS circuits
inferred← citeshttps://doi.org/10.1109/43.46808openalex-snapshot
Computing optimal test sequences from complete test sets for stuck-open faults in CMOS circuits
inferred← citeshttps://doi.org/10.1109/apasic.2000.896969openalex-snapshot
Transition count based BIST for detecting multiple stuck-open faults in CMOS circuits
inferred← citeshttps://doi.org/10.1109/aspdac.1999.760015openalex-snapshot
An adaptive BIST to detect multiple stuck-open faults in CMOS circuits
inferred← citeshttps://doi.org/10.1109/etw.1999.804299openalex-snapshot
A scalable BIST architecture for delay faults
inferred← citeshttps://doi.org/10.1109/icvd.1992.658020openalex-snapshot
On Computing Tests for Bridging and Leakage Faults: Complexity Results and Universal Test Sets
inferred← citeshttps://doi.org/10.1109/icvd.1997.568094openalex-snapshot
New BIST techniques for universal and robust testing of CMOS stuck-open faults
inferred← citeshttps://doi.org/10.1109/tim.2008.926414openalex-snapshot
An Adaptive BIST Design for Detecting Multiple Stuck-Open Faults in a CMOS Complex Cell
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.