On the public citation graph
Implementation of VLSI self-testing by regularization
0 signed · 22 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.1090/s0025-5718-1973-0327722-7openalex-snapshot
Primitive Binary Polynomials
inferredcites →https://doi.org/10.1109/43.3134openalex-snapshot
Hybrid designs generating maximum-length sequences
inferredcites →https://doi.org/10.1109/jssc.1980.1051391openalex-snapshot
Built-in test for complex digital integrated circuits
inferredcites →https://doi.org/10.1109/jssc.1985.1052325openalex-snapshot
A Self-Testing Dynamic RAM Chip
inferredcites →https://doi.org/10.1109/mdt.1985.294856openalex-snapshot
Built-In Self-Test Techniques
inferredcites →https://doi.org/10.1109/tc.1980.1675610openalex-snapshot
Measures of the Effectiveness of Fault Signature Analysis
inferredcites →https://doi.org/10.1109/tc.1981.1675715openalex-snapshot
Design of Easily Testable Bit-Sliced Systems
inferredcites →https://doi.org/10.1109/tc.1983.1676202openalex-snapshot
Exhaustive Generation of Bit Patterns with Applications to VLSI Self-Testing
inferredcites →https://doi.org/10.1137/1024041openalex-snapshot
A Survey of Full Length Nonlinear Shift Register Cycle Algorithms
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf00135230openalex-snapshot
Test generation, design-for-testability and built-in self-test for arithmetic units based on graph labeling
inferred← citeshttps://doi.org/10.1007/bf00136077openalex-snapshot
Balance testing and balance-testable design of logic circuits
inferred← citeshttps://doi.org/10.1007/bf00137388openalex-snapshot
A hierarchical test generation methodology for digital circuits
inferred← citeshttps://doi.org/10.1109/12.102824openalex-snapshot
Polynomial complexity algorithms for increasing the testability of digital circuits by testing-module insertion
inferred← citeshttps://doi.org/10.1109/12.536237openalex-snapshot
Testability of convergent tree circuits
inferred← citeshttps://doi.org/10.1109/43.124403openalex-snapshot
A limited exponential complexity algorithm for increasing the testability of digital circuits by testing-module insertion
inferred← citeshttps://doi.org/10.1109/43.238612openalex-snapshot
On clustering for maximal regularity extraction
inferred← citeshttps://doi.org/10.1109/43.543772openalex-snapshot
Test response compaction using multiplexed parity trees
inferred← citeshttps://doi.org/10.1109/92.365455openalex-snapshot
Cumulative balance testing of logic circuits
inferred← citeshttps://doi.org/10.1109/ftcs.1993.627321openalex-snapshot
Efficient testing of tree circuits
inferred← citeshttps://doi.org/10.1109/rice67503.2025.11439976openalex-snapshot
Optimized Capture-Per-Clock Logic Bist with Hybrid Test-Point Insertion for Efficient VLSI Testing
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.