On the public citation graph
Design of parity testable combinational circuits
0 signed · 18 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.1002/j.1538-7305.1959.tb01585.xopenalex-snapshot
Representation of Switching Circuits by Binary-Decision Programs
inferredcites →https://doi.org/10.1109/43.3166openalex-snapshot
A parity bit signature for exhaustive testing
inferredcites →https://doi.org/10.1109/tc.1978.1674978openalex-snapshot
A Practical Approach to Fault Detection in Combinational Networks
inferredcites →https://doi.org/10.1109/tc.1986.1676819openalex-snapshot
Graph-Based Algorithms for Boolean Function Manipulation
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00135231openalex-snapshot
Analysis of Hamming count compaction scheme
inferred← citeshttps://doi.org/10.1007/bf00137393openalex-snapshot
Multiple-output parity bit signature for exhaustive testing
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.1109/43.184851openalex-snapshot
Multiple fault testing using minimal single fault test set for fanout-free circuits
inferred← citeshttps://doi.org/10.1109/45.127641openalex-snapshot
Built-in self-testing of VLSI circuits-getting errors to catch themselves
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/ats.2001.990335openalex-snapshot
Non-exhaustive parity testing
inferred← citeshttps://doi.org/10.1109/icvd.1996.489629openalex-snapshot
Syndrome signature in output compaction for VLSI BIST
inferred← citeshttps://doi.org/10.1109/mwscas.1990.140717openalex-snapshot
A syndrome signature for exhaustive testing of combinational circuits
inferred← citeshttps://doi.org/10.1109/mwscas.1994.519226openalex-snapshot
Modified dynamic space compression for built-in self-testing of VLSI circuits
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
inferred← citeshttps://doi.org/10.1145/1179461.1179469openalex-snapshot
Performance-driven technology mapping with MSG partition and selective gate duplication
inferred← citeshttps://doi.org/10.1155/1998/45472openalex-snapshot
Syndrome Signature in Output Compaction for VLSI Built‐in Self‐Test
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.