On the public citation graph
Testability of convergent tree circuits
0 signed · 40 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/bf00137251openalex-snapshot
Constant testability of combinational cellular tree structures
inferredcites →https://doi.org/10.1016/0377-2217(90)90290-ropenalex-snapshot
Digital Systems : Testing and Testable Design
inferredcites →https://doi.org/10.1109/12.156535openalex-snapshot
A spanning tree carry lookahead adder
inferredcites →https://doi.org/10.1109/12.2262openalex-snapshot
Efficient testing of optimal time adders
inferredcites →https://doi.org/10.1109/12.53577openalex-snapshot
Easily testable iterative logic arrays
inferredcites →https://doi.org/10.1109/43.16804openalex-snapshot
Implementation of VLSI self-testing by regularization
inferredcites →https://doi.org/10.1109/43.55212openalex-snapshot
Designing for high-level test generation
inferredcites →https://doi.org/10.1109/focs.1967.33openalex-snapshot
Testing for faults in combinational cellular logic arrays
inferredcites →https://doi.org/10.1109/ftcs.1993.627321openalex-snapshot
Efficient testing of tree circuits
inferredcites →https://doi.org/10.1109/t-c.1973.223651openalex-snapshot
Easily Testable Iterative Systems
inferredcites →https://doi.org/10.1109/tc.1978.1675103openalex-snapshot
On Combinational Networks with Restricted Fan-Out
inferredcites →https://doi.org/10.1109/tc.1981.1675715openalex-snapshot
Design of Easily Testable Bit-Sliced Systems
inferredcites →https://doi.org/10.1109/tc.1981.1675718openalex-snapshot
Design of Testable Structures Defined by Simple Loops
inferredcites →https://doi.org/10.1109/tcs.1981.1084934openalex-snapshot
A testable design of iterative logic arrays
inferredcites →https://doi.org/10.1109/test.1993.470646openalex-snapshot
Quality testing requires quality thinking
inferredcites →https://doi.org/10.1109/test.1993.470648openalex-snapshot
Dos and Don'ts in computing fault coverage
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1023/a:1008262321471openalex-snapshot
Testability Properties of Divergent Trees
inferred← citeshttps://doi.org/10.1023/a:1023749030268openalex-snapshot
Easily Testable Cellular Carry Lookahead Adders
inferred← citeshttps://doi.org/10.1080/1065514021000012255openalex-snapshot
Timing‐Driven‐Testable Convergent Tree Adders
inferred← citeshttps://doi.org/10.1109/12.795222openalex-snapshot
An effective built-in self-test scheme for parallel multipliers
inferred← citeshttps://doi.org/10.1109/92.831442openalex-snapshot
On the design of fast, easily testable ALU's
inferred← citeshttps://doi.org/10.1109/asic.1998.722982openalex-snapshot
Timing optimization for testable convergent tree adders
inferred← citeshttps://doi.org/10.1109/asmc.2016.7491080openalex-snapshot
Logic characterization vehicle design for yield learning
inferred← citeshttps://doi.org/10.1109/ats.2004.40openalex-snapshot
Efficient Test Methodologies for Conditional Sum Adders
inferred← citeshttps://doi.org/10.1109/ats.2008.40openalex-snapshot
Level-Testability of Multi-operand Adders
inferred← citeshttps://doi.org/10.1109/edtc.1997.582441openalex-snapshot
The input pattern fault model and its application
inferred← citeshttps://doi.org/10.1109/iccd.1997.628897openalex-snapshot
Properties of the input pattern fault model
inferred← citeshttps://doi.org/10.1109/icvd.1999.745128openalex-snapshot
I/sub DDQ/-testability of tree circuits
inferred← citeshttps://doi.org/10.1109/ipfa.2004.1345592openalex-snapshot
Electrical diagnosis and failure analysis on tree structure circuit
inferred← citeshttps://doi.org/10.1109/secon.1998.673378openalex-snapshot
A novel fault-model for regular and irregular parallel-prefix adders
inferred← citeshttps://doi.org/10.1109/tc.2019.2895074openalex-snapshot
Concurrent Error Detectable Carry Select Adder with Easy Testability
inferred← citeshttps://doi.org/10.1109/test.1997.639701openalex-snapshot
An effective BIST scheme for arithmetic logic units
inferred← citeshttps://doi.org/10.1109/test.2014.7035345openalex-snapshot
Logic characterization vehicle design for maximal information extraction for yield learning
inferred← citeshttps://doi.org/10.1109/test.2016.7805849openalex-snapshot
Logic characterization vehicle design reflection via layout rewiring
inferred← citeshttps://doi.org/10.1109/vtest.1996.510829openalex-snapshot
Design of a fast, easily testable ALU
inferred← citeshttps://doi.org/10.1145/606603.606609openalex-snapshot
On the properties of the input pattern fault model
inferred← citeshttps://doi.org/10.1587/transinf.e93.d.2783openalex-snapshot
A C-Testable 4-2 Adder Tree for an Easily Testable High-Speed Multiplier
inferred← citeshttps://doi.org/10.1587/transinf.e95.d.1084openalex-snapshot
A C-Testable Multiple-Block Carry Select Adder
inferred← citeshttps://doi.org/10.5555/787260.787733openalex-snapshot
The input pattern fault model and its application
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.