On the public citation graph
Partitioning circuits for improved testability
0 signed · 46 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-3-642-95432-0_7openalex-snapshot
Optimizing Synchronous Circuitry by Retiming (Preliminary Version)
inferredcites →https://doi.org/10.1080/00401706.1961.10489978openalex-snapshot
Error Correcting Codes
inferredcites →https://doi.org/10.1109/jssc.1980.1051391openalex-snapshot
Built-in test for complex digital integrated circuits
inferredcites →https://doi.org/10.1109/tc.1980.1675641openalex-snapshot
Testing by Feedback Shift Register
inferredcites →https://doi.org/10.1109/tc.1983.1676175openalex-snapshot
Exhaustive Test Pattern Generation with Constant Weight Vectors
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.1145/800070.802178openalex-snapshot
The theory of signature testing for VLSI
inferredcites →https://doi.org/10.1147/rd.282.0212openalex-snapshot
Iterative Exhaustive Pattern Generation for Logic Testing
inferredcites →https://doi.org/10.5555/800262.809170openalex-snapshot
A logic design structure for LSI testability
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11685654_5openalex-snapshot
Parceling the Butterfly and the Batcher Sorting Network
inferred← citeshttps://doi.org/10.1007/bf02085633openalex-snapshot
A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits
inferred← citeshttps://doi.org/10.1007/bfb0018549openalex-snapshot
Cooperative multi-thread parallel tabu search with an application to circuit partitioning
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00150-copenalex-snapshot
Graph partitioning applied to the logic testing of combinational circuits
inferred← citeshttps://doi.org/10.1016/j.tcs.2003.11.018openalex-snapshot
Minimal length test vectors for multiple-fault detection
inferred← citeshttps://doi.org/10.1080/02533839.1992.9677400openalex-snapshot
Automatic synthesis of testable VLSI cellular array multipliers
inferred← citeshttps://doi.org/10.1109/12.53577openalex-snapshot
Easily testable iterative logic arrays
inferred← citeshttps://doi.org/10.1109/43.108616openalex-snapshot
The pseudoexhaustive test of sequential circuits
inferred← citeshttps://doi.org/10.1109/43.265670openalex-snapshot
Optimizing resource utilization using transformations
inferred← citeshttps://doi.org/10.1109/43.310906openalex-snapshot
A method for pseudo-exhaustive test pattern generation
inferred← citeshttps://doi.org/10.1109/43.365128openalex-snapshot
A coordinated circuit partitioning and test generation method for pseudo-exhaustive testing of VLSI circuits
inferred← citeshttps://doi.org/10.1109/43.905682openalex-snapshot
A timing-driven pseudoexhaustive testing for VLSI circuits
inferred← citeshttps://doi.org/10.1109/92.250200openalex-snapshot
Cost-effective LFSR synthesis for optimal pseudoexhaustive BIST test sets
inferred← citeshttps://doi.org/10.1109/act.2009.109openalex-snapshot
Low Power Pseudoexhaustive Testing with Cellular Automata
inferred← citeshttps://doi.org/10.1109/artcom.2009.145openalex-snapshot
Circuit Partitioning Using Particle Swarm Optimization for Pseudo-Exhaustive Testing
inferred← citeshttps://doi.org/10.1109/cicc.1992.591300openalex-snapshot
Efficient Segmentation For Pseudo-exhaustive BIST
inferred← citeshttps://doi.org/10.1109/cicc.1994.379690openalex-snapshot
Circuit partitioning for pipelined pseudo-exhaustive testing using simulated annealing
inferred← citeshttps://doi.org/10.1109/ftcs.1989.105582openalex-snapshot
Pseudo-exhaustive test and segmentation: formal definitions and extended fault coverage results
inferred← citeshttps://doi.org/10.1109/iccd.1992.276289openalex-snapshot
On minimizing hardware overhead for pseudoexhaustive circuit testability
inferred← citeshttps://doi.org/10.1109/iscas.1988.15295openalex-snapshot
On partitioning for pseudo exhaustive testing of VLSI circuits
inferred← citeshttps://doi.org/10.1109/iscas.1992.229934openalex-snapshot
A metric towards efficient pseudo-exhaustive test pattern generation
inferred← citeshttps://doi.org/10.1109/iscas.2000.856416openalex-snapshot
A timing-driven pseudo-exhaustive testing of VLSI circuits
inferred← citeshttps://doi.org/10.1109/nrsc.2000.838953openalex-snapshot
An efficient algorithm to partition the combinational circuits for pseudoexhaustive testing
inferred← citeshttps://doi.org/10.1109/test.1988.207832openalex-snapshot
Reconfigurable hardware for pseudoexhaustive test
inferred← citeshttps://doi.org/10.1109/test.1989.82273openalex-snapshot
The pseudoexhaustive test of sequential circuits
inferred← citeshttps://doi.org/10.1109/test.1990.114118openalex-snapshot
Practical partitioning for testability with time-shared boundary scan
inferred← citeshttps://doi.org/10.1109/test.1993.470600openalex-snapshot
Multiconfiguration technique to reduce test duration for sequential circuits
inferred← citeshttps://doi.org/10.1109/test.1998.743170openalex-snapshot
A tree-structured LFSR synthesis scheme for pseudo-exhaustive testing of VLSI circuits
inferred← citeshttps://doi.org/10.1145/157485.164880openalex-snapshot
An efficient partitioning strategy for pseudo-exhaustive testing
inferred← citeshttps://doi.org/10.1145/74382.74470openalex-snapshot
A coordinated approach to partitioning and test pattern generation for pseudoexhaustive testing
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.2087openalex-snapshot
Quiescent current testing of CMOS data converters
inferred← citeshttps://doi.org/10.48550/arxiv.1208.1814openalex-snapshot
On the Rank Number of Grid Graphs
inferred← citeshttps://doi.org/10.5555/949970.949974openalex-snapshot
Tools and devices supporting the pseudo-exhaustive 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.